./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_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_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 14d20b200dda38e95ec4ea5c7128c00d20347c5bcda51cecce271855ce0b9ab5 --- 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 17:04:58,346 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:04:58,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:04:58,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:04:58,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:04:58,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:04:58,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:04:58,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:04:58,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:04:58,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:04:58,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:04:58,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:04:58,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:04:58,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:04:58,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:04:58,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:04:58,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:04:58,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:04:58,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:04:58,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:04:58,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:04:58,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:04:58,387 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:04:58,388 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:04:58,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:04:58,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:04:58,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:04:58,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:04:58,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:04:58,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:04:58,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:04:58,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:04:58,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:04:58,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:04:58,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:04:58,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:04:58,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:04:58,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:04:58,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:04:58,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:04:58,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:04:58,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 17:04:58,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:04:58,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:04:58,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:04:58,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:04:58,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:04:58,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:04:58,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:04:58,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:04:58,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:04:58,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:04:58,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:04:58,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:04:58,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:04:58,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:04:58,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:04:58,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:04:58,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:04:58,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:04:58,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:04:58,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:04:58,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:04:58,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:04:58,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:04:58,436 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:04:58,436 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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 -> 14d20b200dda38e95ec4ea5c7128c00d20347c5bcda51cecce271855ce0b9ab5 [2022-12-13 17:04:58,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:04:58,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:04:58,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:04:58,641 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:04:58,641 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:04:58,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2022-12-13 17:05:01,246 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:05:01,403 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:05:01,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2022-12-13 17:05:01,413 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/b6d21e681/16351ed8a2ba41838f0b07d69a56c9ed/FLAG34c05b8cb [2022-12-13 17:05:01,423 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/b6d21e681/16351ed8a2ba41838f0b07d69a56c9ed [2022-12-13 17:05:01,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:05:01,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:05:01,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:01,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:05:01,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:05:01,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d723221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01, skipping insertion in model container [2022-12-13 17:05:01,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:05:01,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:05:01,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_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i[994,1007] [2022-12-13 17:05:01,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:01,703 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:05:01,712 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_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i[994,1007] [2022-12-13 17:05:01,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:01,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:01,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:01,775 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:05:01,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01 WrapperNode [2022-12-13 17:05:01,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:01,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:01,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:05:01,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:05:01,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,810 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 17:05:01,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:01,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:05:01,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:05:01,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:05:01,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,832 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:05:01,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:05:01,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:05:01,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:05:01,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (1/1) ... [2022-12-13 17:05:01,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:05:01,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:05:01,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:05:01,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:05:01,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:05:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:05:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:05:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:05:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:05:01,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:05:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:05:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:05:01,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:05:01,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:05:01,901 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 17:05:02,025 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:05:02,028 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:05:02,439 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:05:02,742 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:05:02,742 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:05:02,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:02 BoogieIcfgContainer [2022-12-13 17:05:02,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:05:02,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:05:02,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:05:02,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:05:02,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:05:01" (1/3) ... [2022-12-13 17:05:02,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2d8adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:02, skipping insertion in model container [2022-12-13 17:05:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:01" (2/3) ... [2022-12-13 17:05:02,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2d8adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:02, skipping insertion in model container [2022-12-13 17:05:02,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:02" (3/3) ... [2022-12-13 17:05:02,750 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2022-12-13 17:05:02,764 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:05:02,764 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 17:05:02,764 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:05:02,865 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:05:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 182 transitions, 379 flow [2022-12-13 17:05:02,949 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-12-13 17:05:02,949 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:02,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 17:05:02,954 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 182 transitions, 379 flow [2022-12-13 17:05:02,958 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 179 transitions, 367 flow [2022-12-13 17:05:02,961 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:05:02,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 367 flow [2022-12-13 17:05:02,970 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 367 flow [2022-12-13 17:05:02,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 367 flow [2022-12-13 17:05:03,001 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-12-13 17:05:03,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:03,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 17:05:03,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 7406 [2022-12-13 17:05:10,834 INFO L134 LiptonReduction]: Checked pairs total: 34320 [2022-12-13 17:05:10,834 INFO L136 LiptonReduction]: Total number of compositions: 154 [2022-12-13 17:05:10,844 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:05:10,848 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;@3d435bd9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:05:10,848 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 17:05:10,849 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 17:05:10,850 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:10,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:10,850 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 17:05:10,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1081, now seen corresponding path program 1 times [2022-12-13 17:05:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:10,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031653142] [2022-12-13 17:05:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:10,950 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 17:05:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:10,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031653142] [2022-12-13 17:05:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031653142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:10,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:10,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 17:05:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967733926] [2022-12-13 17:05:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:10,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 17:05:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:10,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 17:05:10,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:05:10,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 336 [2022-12-13 17:05:10,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 157 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 17:05:10,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:10,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 336 [2022-12-13 17:05:10,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:13,281 INFO L130 PetriNetUnfolder]: 11260/15877 cut-off events. [2022-12-13 17:05:13,281 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 17:05:13,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31820 conditions, 15877 events. 11260/15877 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 99943 event pairs, 11260 based on Foata normal form. 0/7399 useless extension candidates. Maximal degree in co-relation 31809. Up to 15867 conditions per place. [2022-12-13 17:05:13,349 INFO L137 encePairwiseOnDemand]: 305/336 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2022-12-13 17:05:13,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2022-12-13 17:05:13,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 17:05:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 17:05:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2022-12-13 17:05:13,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5014880952380952 [2022-12-13 17:05:13,360 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2022-12-13 17:05:13,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2022-12-13 17:05:13,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:13,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2022-12-13 17:05:13,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:13,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:13,369 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:13,370 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 157 flow. Second operand 2 states and 337 transitions. [2022-12-13 17:05:13,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2022-12-13 17:05:13,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 17:05:13,375 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2022-12-13 17:05:13,376 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 17:05:13,379 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2022-12-13 17:05:13,379 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2022-12-13 17:05:13,379 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 17:05:13,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:13,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 17:05:13,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:05:13,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:13,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1068440, now seen corresponding path program 1 times [2022-12-13 17:05:13,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267955954] [2022-12-13 17:05:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:13,578 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 17:05:13,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:13,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267955954] [2022-12-13 17:05:13,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267955954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:13,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:13,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:05:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356511980] [2022-12-13 17:05:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:13,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:13,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:13,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:13,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:13,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 336 [2022-12-13 17:05:13,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:13,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:13,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 336 [2022-12-13 17:05:13,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:14,638 INFO L130 PetriNetUnfolder]: 4344/6246 cut-off events. [2022-12-13 17:05:14,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:14,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12536 conditions, 6246 events. 4344/6246 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 34981 event pairs, 4344 based on Foata normal form. 0/3772 useless extension candidates. Maximal degree in co-relation 12533. Up to 6237 conditions per place. [2022-12-13 17:05:14,663 INFO L137 encePairwiseOnDemand]: 328/336 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-12-13 17:05:14,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2022-12-13 17:05:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-12-13 17:05:14,666 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42956349206349204 [2022-12-13 17:05:14,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-12-13 17:05:14,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-12-13 17:05:14,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:14,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-12-13 17:05:14,668 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 17:05:14,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:14,670 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:14,670 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 433 transitions. [2022-12-13 17:05:14,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2022-12-13 17:05:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 17:05:14,672 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 17:05:14,672 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 17:05:14,672 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 17:05:14,672 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2022-12-13 17:05:14,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:14,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:14,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 17:05:14,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:05:14,673 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:14,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1068439, now seen corresponding path program 1 times [2022-12-13 17:05:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384507546] [2022-12-13 17:05:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:14,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:14,730 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 17:05:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:14,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384507546] [2022-12-13 17:05:14,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384507546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:14,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:14,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:05:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818912433] [2022-12-13 17:05:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:14,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:14,772 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 336 [2022-12-13 17:05:14,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:14,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:14,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 336 [2022-12-13 17:05:14,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:15,396 INFO L130 PetriNetUnfolder]: 2598/4059 cut-off events. [2022-12-13 17:05:15,396 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8100 conditions, 4059 events. 2598/4059 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 23894 event pairs, 1498 based on Foata normal form. 0/3163 useless extension candidates. Maximal degree in co-relation 8096. Up to 2252 conditions per place. [2022-12-13 17:05:15,409 INFO L137 encePairwiseOnDemand]: 320/336 looper letters, 33 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2022-12-13 17:05:15,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 180 flow [2022-12-13 17:05:15,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-12-13 17:05:15,411 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42658730158730157 [2022-12-13 17:05:15,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-12-13 17:05:15,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-12-13 17:05:15,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:15,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-12-13 17:05:15,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:15,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:15,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:15,414 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 430 transitions. [2022-12-13 17:05:15,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 180 flow [2022-12-13 17:05:15,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:05:15,415 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 147 flow [2022-12-13 17:05:15,415 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-12-13 17:05:15,416 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 17:05:15,416 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 147 flow [2022-12-13 17:05:15,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:15,416 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:15,416 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:15,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:05:15,416 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -589522731, now seen corresponding path program 1 times [2022-12-13 17:05:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:15,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472224279] [2022-12-13 17:05:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:05:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:15,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472224279] [2022-12-13 17:05:15,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472224279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:15,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:15,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:05:15,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894300215] [2022-12-13 17:05:15,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:15,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:15,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:15,515 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 336 [2022-12-13 17:05:15,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 147 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 17:05:15,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:15,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 336 [2022-12-13 17:05:15,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:16,183 INFO L130 PetriNetUnfolder]: 2518/4129 cut-off events. [2022-12-13 17:05:16,184 INFO L131 PetriNetUnfolder]: For 1172/1177 co-relation queries the response was YES. [2022-12-13 17:05:16,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11229 conditions, 4129 events. 2518/4129 cut-off events. For 1172/1177 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26461 event pairs, 910 based on Foata normal form. 0/3680 useless extension candidates. Maximal degree in co-relation 11224. Up to 2515 conditions per place. [2022-12-13 17:05:16,197 INFO L137 encePairwiseOnDemand]: 332/336 looper letters, 65 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2022-12-13 17:05:16,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 395 flow [2022-12-13 17:05:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2022-12-13 17:05:16,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2022-12-13 17:05:16,200 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2022-12-13 17:05:16,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2022-12-13 17:05:16,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:16,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2022-12-13 17:05:16,202 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 17:05:16,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:16,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:16,205 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 147 flow. Second operand 3 states and 453 transitions. [2022-12-13 17:05:16,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 395 flow [2022-12-13 17:05:16,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:16,218 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 142 flow [2022-12-13 17:05:16,218 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-13 17:05:16,219 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2022-12-13 17:05:16,219 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 142 flow [2022-12-13 17:05:16,219 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 17:05:16,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:16,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:16,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:05:16,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash -589522381, now seen corresponding path program 1 times [2022-12-13 17:05:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:16,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709431127] [2022-12-13 17:05:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:16,381 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 17:05:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:16,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709431127] [2022-12-13 17:05:16,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709431127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:16,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:16,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:05:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008637336] [2022-12-13 17:05:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:16,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:16,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:16,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 336 [2022-12-13 17:05:16,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:16,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:16,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 336 [2022-12-13 17:05:16,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:17,142 INFO L130 PetriNetUnfolder]: 3060/4736 cut-off events. [2022-12-13 17:05:17,142 INFO L131 PetriNetUnfolder]: For 1236/1236 co-relation queries the response was YES. [2022-12-13 17:05:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13043 conditions, 4736 events. 3060/4736 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 28520 event pairs, 948 based on Foata normal form. 0/3955 useless extension candidates. Maximal degree in co-relation 13037. Up to 3264 conditions per place. [2022-12-13 17:05:17,160 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 64 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2022-12-13 17:05:17,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 374 flow [2022-12-13 17:05:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-12-13 17:05:17,162 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2022-12-13 17:05:17,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-12-13 17:05:17,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-12-13 17:05:17,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:17,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-12-13 17:05:17,163 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 17:05:17,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,165 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,165 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 142 flow. Second operand 3 states and 447 transitions. [2022-12-13 17:05:17,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 374 flow [2022-12-13 17:05:17,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:17,167 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 144 flow [2022-12-13 17:05:17,167 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 17:05:17,168 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2022-12-13 17:05:17,168 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 144 flow [2022-12-13 17:05:17,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:17,168 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:17,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:05:17,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:17,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:17,169 INFO L85 PathProgramCache]: Analyzing trace with hash -286221775, now seen corresponding path program 1 times [2022-12-13 17:05:17,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:17,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905080568] [2022-12-13 17:05:17,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:17,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:17,274 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 17:05:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905080568] [2022-12-13 17:05:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905080568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:05:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614147926] [2022-12-13 17:05:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:17,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:17,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 336 [2022-12-13 17:05:17,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:17,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 336 [2022-12-13 17:05:17,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:17,960 INFO L130 PetriNetUnfolder]: 2425/3918 cut-off events. [2022-12-13 17:05:17,960 INFO L131 PetriNetUnfolder]: For 509/514 co-relation queries the response was YES. [2022-12-13 17:05:17,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10436 conditions, 3918 events. 2425/3918 cut-off events. For 509/514 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 24167 event pairs, 833 based on Foata normal form. 0/3169 useless extension candidates. Maximal degree in co-relation 10429. Up to 1468 conditions per place. [2022-12-13 17:05:17,971 INFO L137 encePairwiseOnDemand]: 327/336 looper letters, 62 selfloop transitions, 9 changer transitions 0/73 dead transitions. [2022-12-13 17:05:17,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 390 flow [2022-12-13 17:05:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:05:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2022-12-13 17:05:17,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4174107142857143 [2022-12-13 17:05:17,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2022-12-13 17:05:17,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2022-12-13 17:05:17,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:17,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2022-12-13 17:05:17,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,979 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 144 flow. Second operand 4 states and 561 transitions. [2022-12-13 17:05:17,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 390 flow [2022-12-13 17:05:17,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:17,981 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 212 flow [2022-12-13 17:05:17,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-13 17:05:17,982 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2022-12-13 17:05:17,982 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 212 flow [2022-12-13 17:05:17,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:17,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:17,983 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:05:17,983 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1095325416, now seen corresponding path program 1 times [2022-12-13 17:05:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:17,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047709868] [2022-12-13 17:05:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:18,109 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 17:05:18,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:18,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047709868] [2022-12-13 17:05:18,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047709868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:18,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:18,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:05:18,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116842154] [2022-12-13 17:05:18,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:18,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:05:18,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:18,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:05:18,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:05:18,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 336 [2022-12-13 17:05:18,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:18,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:18,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 336 [2022-12-13 17:05:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:18,762 INFO L130 PetriNetUnfolder]: 2361/3822 cut-off events. [2022-12-13 17:05:18,762 INFO L131 PetriNetUnfolder]: For 2820/2825 co-relation queries the response was YES. [2022-12-13 17:05:18,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11556 conditions, 3822 events. 2361/3822 cut-off events. For 2820/2825 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 23475 event pairs, 997 based on Foata normal form. 32/3517 useless extension candidates. Maximal degree in co-relation 11547. Up to 2292 conditions per place. [2022-12-13 17:05:18,773 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 63 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 17:05:18,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 412 flow [2022-12-13 17:05:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:05:18,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2022-12-13 17:05:18,776 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43005952380952384 [2022-12-13 17:05:18,776 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2022-12-13 17:05:18,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2022-12-13 17:05:18,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:18,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2022-12-13 17:05:18,778 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 17:05:18,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:18,780 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:18,781 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 212 flow. Second operand 4 states and 578 transitions. [2022-12-13 17:05:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 412 flow [2022-12-13 17:05:18,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 68 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:18,796 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 209 flow [2022-12-13 17:05:18,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2022-12-13 17:05:18,797 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2022-12-13 17:05:18,797 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 209 flow [2022-12-13 17:05:18,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:18,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:18,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:18,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:05:18,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash -68825457, now seen corresponding path program 1 times [2022-12-13 17:05:18,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:18,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442873006] [2022-12-13 17:05:18,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:18,941 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 17:05:18,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:18,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442873006] [2022-12-13 17:05:18,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442873006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:18,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:18,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:05:18,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868489869] [2022-12-13 17:05:18,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:18,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:18,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:18,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 336 [2022-12-13 17:05:18,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:18,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:18,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 336 [2022-12-13 17:05:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:19,520 INFO L130 PetriNetUnfolder]: 2332/3839 cut-off events. [2022-12-13 17:05:19,520 INFO L131 PetriNetUnfolder]: For 2684/2689 co-relation queries the response was YES. [2022-12-13 17:05:19,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11474 conditions, 3839 events. 2332/3839 cut-off events. For 2684/2689 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 24404 event pairs, 866 based on Foata normal form. 12/3514 useless extension candidates. Maximal degree in co-relation 11466. Up to 2281 conditions per place. [2022-12-13 17:05:19,532 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 62 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2022-12-13 17:05:19,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 407 flow [2022-12-13 17:05:19,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:19,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:19,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2022-12-13 17:05:19,534 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44841269841269843 [2022-12-13 17:05:19,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2022-12-13 17:05:19,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2022-12-13 17:05:19,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:19,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2022-12-13 17:05:19,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:19,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:19,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:19,536 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 209 flow. Second operand 3 states and 452 transitions. [2022-12-13 17:05:19,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 407 flow [2022-12-13 17:05:19,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:19,549 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 216 flow [2022-12-13 17:05:19,549 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-13 17:05:19,549 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 17:05:19,549 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 216 flow [2022-12-13 17:05:19,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:19,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:19,550 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:05:19,550 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 404688026, now seen corresponding path program 1 times [2022-12-13 17:05:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:19,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537509720] [2022-12-13 17:05:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:19,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:19,638 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 17:05:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:19,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537509720] [2022-12-13 17:05:19,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537509720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:19,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:19,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:05:19,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299346135] [2022-12-13 17:05:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:19,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:19,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:19,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:19,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 336 [2022-12-13 17:05:19,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:19,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:19,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 336 [2022-12-13 17:05:19,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:20,238 INFO L130 PetriNetUnfolder]: 2017/3195 cut-off events. [2022-12-13 17:05:20,238 INFO L131 PetriNetUnfolder]: For 2318/2318 co-relation queries the response was YES. [2022-12-13 17:05:20,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10376 conditions, 3195 events. 2017/3195 cut-off events. For 2318/2318 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 18306 event pairs, 840 based on Foata normal form. 52/2927 useless extension candidates. Maximal degree in co-relation 10367. Up to 1309 conditions per place. [2022-12-13 17:05:20,248 INFO L137 encePairwiseOnDemand]: 323/336 looper letters, 47 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2022-12-13 17:05:20,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 430 flow [2022-12-13 17:05:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:05:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2022-12-13 17:05:20,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-13 17:05:20,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2022-12-13 17:05:20,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2022-12-13 17:05:20,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:20,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2022-12-13 17:05:20,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:20,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:20,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:20,252 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 216 flow. Second operand 4 states and 544 transitions. [2022-12-13 17:05:20,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 430 flow [2022-12-13 17:05:20,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 420 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:20,262 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 333 flow [2022-12-13 17:05:20,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-13 17:05:20,262 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -29 predicate places. [2022-12-13 17:05:20,263 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 333 flow [2022-12-13 17:05:20,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:20,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:20,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:20,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:05:20,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:20,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:20,264 INFO L85 PathProgramCache]: Analyzing trace with hash -654382869, now seen corresponding path program 1 times [2022-12-13 17:05:20,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:20,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872544985] [2022-12-13 17:05:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:20,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:20,979 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 17:05:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:20,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872544985] [2022-12-13 17:05:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872544985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:20,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:20,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796693307] [2022-12-13 17:05:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:20,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:05:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:05:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:21,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 336 [2022-12-13 17:05:21,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 333 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 17:05:21,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:21,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 336 [2022-12-13 17:05:21,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:21,939 INFO L130 PetriNetUnfolder]: 2301/3645 cut-off events. [2022-12-13 17:05:21,939 INFO L131 PetriNetUnfolder]: For 3432/3432 co-relation queries the response was YES. [2022-12-13 17:05:21,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13090 conditions, 3645 events. 2301/3645 cut-off events. For 3432/3432 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 21396 event pairs, 1024 based on Foata normal form. 14/3312 useless extension candidates. Maximal degree in co-relation 13080. Up to 3227 conditions per place. [2022-12-13 17:05:21,954 INFO L137 encePairwiseOnDemand]: 323/336 looper letters, 78 selfloop transitions, 22 changer transitions 0/102 dead transitions. [2022-12-13 17:05:21,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 102 transitions, 774 flow [2022-12-13 17:05:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:05:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 17:05:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2022-12-13 17:05:21,958 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2022-12-13 17:05:21,958 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2022-12-13 17:05:21,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2022-12-13 17:05:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:21,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2022-12-13 17:05:21,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:21,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 336.0) internal successors, (3360), 10 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:21,964 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 336.0) internal successors, (3360), 10 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:21,964 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 333 flow. Second operand 9 states and 1113 transitions. [2022-12-13 17:05:21,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 102 transitions, 774 flow [2022-12-13 17:05:21,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 768 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:05:21,980 INFO L231 Difference]: Finished difference. Result has 67 places, 73 transitions, 589 flow [2022-12-13 17:05:21,980 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2022-12-13 17:05:21,980 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -16 predicate places. [2022-12-13 17:05:21,981 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 589 flow [2022-12-13 17:05:21,981 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 17:05:21,981 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:21,981 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:21,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:05:21,982 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1841108509, now seen corresponding path program 2 times [2022-12-13 17:05:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:21,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116728557] [2022-12-13 17:05:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:22,935 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 17:05:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:22,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116728557] [2022-12-13 17:05:22,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116728557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:22,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:22,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:05:22,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559848613] [2022-12-13 17:05:22,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:22,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:05:22,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:22,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:05:22,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:05:23,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 336 [2022-12-13 17:05:23,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 589 flow. Second operand has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:23,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:23,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 336 [2022-12-13 17:05:23,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:24,092 INFO L130 PetriNetUnfolder]: 2569/4057 cut-off events. [2022-12-13 17:05:24,092 INFO L131 PetriNetUnfolder]: For 5912/5915 co-relation queries the response was YES. [2022-12-13 17:05:24,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16037 conditions, 4057 events. 2569/4057 cut-off events. For 5912/5915 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 24070 event pairs, 510 based on Foata normal form. 6/3690 useless extension candidates. Maximal degree in co-relation 16020. Up to 3399 conditions per place. [2022-12-13 17:05:24,107 INFO L137 encePairwiseOnDemand]: 325/336 looper letters, 88 selfloop transitions, 30 changer transitions 0/120 dead transitions. [2022-12-13 17:05:24,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 1091 flow [2022-12-13 17:05:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 17:05:24,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 17:05:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1099 transitions. [2022-12-13 17:05:24,110 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36342592592592593 [2022-12-13 17:05:24,110 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1099 transitions. [2022-12-13 17:05:24,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1099 transitions. [2022-12-13 17:05:24,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:24,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1099 transitions. [2022-12-13 17:05:24,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.11111111111111) internal successors, (1099), 9 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:24,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 336.0) internal successors, (3360), 10 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:24,115 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 336.0) internal successors, (3360), 10 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:24,115 INFO L175 Difference]: Start difference. First operand has 67 places, 73 transitions, 589 flow. Second operand 9 states and 1099 transitions. [2022-12-13 17:05:24,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 1091 flow [2022-12-13 17:05:24,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 120 transitions, 1085 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 17:05:24,161 INFO L231 Difference]: Finished difference. Result has 80 places, 92 transitions, 888 flow [2022-12-13 17:05:24,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=888, PETRI_PLACES=80, PETRI_TRANSITIONS=92} [2022-12-13 17:05:24,162 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -3 predicate places. [2022-12-13 17:05:24,162 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 888 flow [2022-12-13 17:05:24,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:24,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:24,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:24,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:05:24,162 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash 913095275, now seen corresponding path program 3 times [2022-12-13 17:05:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:24,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650637393] [2022-12-13 17:05:24,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:24,862 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 17:05:24,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:24,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650637393] [2022-12-13 17:05:24,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650637393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:24,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:24,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:24,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417321507] [2022-12-13 17:05:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:24,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:05:24,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:05:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:25,033 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 336 [2022-12-13 17:05:25,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 888 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 17:05:25,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:25,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 336 [2022-12-13 17:05:25,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:25,991 INFO L130 PetriNetUnfolder]: 2556/4058 cut-off events. [2022-12-13 17:05:25,991 INFO L131 PetriNetUnfolder]: For 8211/8214 co-relation queries the response was YES. [2022-12-13 17:05:26,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17309 conditions, 4058 events. 2556/4058 cut-off events. For 8211/8214 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 24298 event pairs, 297 based on Foata normal form. 6/3692 useless extension candidates. Maximal degree in co-relation 17286. Up to 2803 conditions per place. [2022-12-13 17:05:26,009 INFO L137 encePairwiseOnDemand]: 326/336 looper letters, 101 selfloop transitions, 58 changer transitions 0/161 dead transitions. [2022-12-13 17:05:26,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 161 transitions, 1638 flow [2022-12-13 17:05:26,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:05:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 17:05:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1357 transitions. [2022-12-13 17:05:26,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3671536796536797 [2022-12-13 17:05:26,012 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1357 transitions. [2022-12-13 17:05:26,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1357 transitions. [2022-12-13 17:05:26,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:26,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1357 transitions. [2022-12-13 17:05:26,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.36363636363636) internal successors, (1357), 11 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:26,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 336.0) internal successors, (4032), 12 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:26,017 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 336.0) internal successors, (4032), 12 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:26,017 INFO L175 Difference]: Start difference. First operand has 80 places, 92 transitions, 888 flow. Second operand 11 states and 1357 transitions. [2022-12-13 17:05:26,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 161 transitions, 1638 flow [2022-12-13 17:05:26,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 161 transitions, 1628 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-13 17:05:26,074 INFO L231 Difference]: Finished difference. Result has 95 places, 114 transitions, 1321 flow [2022-12-13 17:05:26,074 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1321, PETRI_PLACES=95, PETRI_TRANSITIONS=114} [2022-12-13 17:05:26,075 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 12 predicate places. [2022-12-13 17:05:26,075 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 114 transitions, 1321 flow [2022-12-13 17:05:26,075 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 17:05:26,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:26,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:26,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:05:26,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -339572046, now seen corresponding path program 1 times [2022-12-13 17:05:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979703196] [2022-12-13 17:05:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:26,222 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 17:05:26,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:26,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979703196] [2022-12-13 17:05:26,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979703196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:26,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:26,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252125617] [2022-12-13 17:05:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:26,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:05:26,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:05:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:26,372 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 336 [2022-12-13 17:05:26,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 114 transitions, 1321 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:26,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:26,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 336 [2022-12-13 17:05:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:27,186 INFO L130 PetriNetUnfolder]: 2476/3996 cut-off events. [2022-12-13 17:05:27,186 INFO L131 PetriNetUnfolder]: For 12281/12281 co-relation queries the response was YES. [2022-12-13 17:05:27,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18199 conditions, 3996 events. 2476/3996 cut-off events. For 12281/12281 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 24416 event pairs, 340 based on Foata normal form. 90/3893 useless extension candidates. Maximal degree in co-relation 18170. Up to 1174 conditions per place. [2022-12-13 17:05:27,204 INFO L137 encePairwiseOnDemand]: 321/336 looper letters, 136 selfloop transitions, 46 changer transitions 1/184 dead transitions. [2022-12-13 17:05:27,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 184 transitions, 2276 flow [2022-12-13 17:05:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:05:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:05:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2022-12-13 17:05:27,206 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 17:05:27,206 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2022-12-13 17:05:27,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2022-12-13 17:05:27,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:27,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2022-12-13 17:05:27,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:27,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 336.0) internal successors, (2688), 8 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:27,210 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 336.0) internal successors, (2688), 8 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:27,210 INFO L175 Difference]: Start difference. First operand has 95 places, 114 transitions, 1321 flow. Second operand 7 states and 896 transitions. [2022-12-13 17:05:27,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 184 transitions, 2276 flow [2022-12-13 17:05:27,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 2189 flow, removed 35 selfloop flow, removed 3 redundant places. [2022-12-13 17:05:27,261 INFO L231 Difference]: Finished difference. Result has 101 places, 122 transitions, 1531 flow [2022-12-13 17:05:27,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1531, PETRI_PLACES=101, PETRI_TRANSITIONS=122} [2022-12-13 17:05:27,261 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2022-12-13 17:05:27,262 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 122 transitions, 1531 flow [2022-12-13 17:05:27,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:27,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:27,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:27,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:05:27,262 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash -339571986, now seen corresponding path program 1 times [2022-12-13 17:05:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028416574] [2022-12-13 17:05:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:27,477 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 17:05:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:27,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028416574] [2022-12-13 17:05:27,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028416574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:27,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:27,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:05:27,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565803082] [2022-12-13 17:05:27,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:27,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:05:27,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:27,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:05:27,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:05:27,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 336 [2022-12-13 17:05:27,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 122 transitions, 1531 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:27,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:27,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 336 [2022-12-13 17:05:27,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:28,985 INFO L130 PetriNetUnfolder]: 3115/4951 cut-off events. [2022-12-13 17:05:28,986 INFO L131 PetriNetUnfolder]: For 17207/17207 co-relation queries the response was YES. [2022-12-13 17:05:28,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 4951 events. 3115/4951 cut-off events. For 17207/17207 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 29891 event pairs, 988 based on Foata normal form. 4/4828 useless extension candidates. Maximal degree in co-relation 24166. Up to 2839 conditions per place. [2022-12-13 17:05:29,009 INFO L137 encePairwiseOnDemand]: 328/336 looper letters, 189 selfloop transitions, 30 changer transitions 0/220 dead transitions. [2022-12-13 17:05:29,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 220 transitions, 2960 flow [2022-12-13 17:05:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:05:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:05:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions. [2022-12-13 17:05:29,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3796768707482993 [2022-12-13 17:05:29,012 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 893 transitions. [2022-12-13 17:05:29,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions. [2022-12-13 17:05:29,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:29,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions. [2022-12-13 17:05:29,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 336.0) internal successors, (2688), 8 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,015 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 336.0) internal successors, (2688), 8 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,015 INFO L175 Difference]: Start difference. First operand has 101 places, 122 transitions, 1531 flow. Second operand 7 states and 893 transitions. [2022-12-13 17:05:29,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 220 transitions, 2960 flow [2022-12-13 17:05:29,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 220 transitions, 2905 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:29,111 INFO L231 Difference]: Finished difference. Result has 109 places, 146 transitions, 1988 flow [2022-12-13 17:05:29,111 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1988, PETRI_PLACES=109, PETRI_TRANSITIONS=146} [2022-12-13 17:05:29,111 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 26 predicate places. [2022-12-13 17:05:29,111 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 146 transitions, 1988 flow [2022-12-13 17:05:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:29,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:29,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:05:29,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:29,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1395513182, now seen corresponding path program 1 times [2022-12-13 17:05:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463446242] [2022-12-13 17:05:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:29,215 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 17:05:29,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:29,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463446242] [2022-12-13 17:05:29,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463446242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:29,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:29,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:05:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202814558] [2022-12-13 17:05:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:29,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:05:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:05:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:05:29,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 336 [2022-12-13 17:05:29,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 146 transitions, 1988 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 17:05:29,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:29,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 336 [2022-12-13 17:05:29,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:29,781 INFO L130 PetriNetUnfolder]: 1415/2492 cut-off events. [2022-12-13 17:05:29,781 INFO L131 PetriNetUnfolder]: For 10717/10720 co-relation queries the response was YES. [2022-12-13 17:05:29,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12782 conditions, 2492 events. 1415/2492 cut-off events. For 10717/10720 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14778 event pairs, 263 based on Foata normal form. 40/2457 useless extension candidates. Maximal degree in co-relation 12746. Up to 2265 conditions per place. [2022-12-13 17:05:29,793 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 159 selfloop transitions, 4 changer transitions 0/167 dead transitions. [2022-12-13 17:05:29,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 167 transitions, 2447 flow [2022-12-13 17:05:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:05:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:05:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-12-13 17:05:29,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42757936507936506 [2022-12-13 17:05:29,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-12-13 17:05:29,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-12-13 17:05:29,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:29,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-12-13 17:05:29,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,796 INFO L175 Difference]: Start difference. First operand has 109 places, 146 transitions, 1988 flow. Second operand 3 states and 431 transitions. [2022-12-13 17:05:29,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 167 transitions, 2447 flow [2022-12-13 17:05:29,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 167 transitions, 2422 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 17:05:29,830 INFO L231 Difference]: Finished difference. Result has 110 places, 143 transitions, 1903 flow [2022-12-13 17:05:29,831 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=110, PETRI_TRANSITIONS=143} [2022-12-13 17:05:29,831 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 27 predicate places. [2022-12-13 17:05:29,831 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 143 transitions, 1903 flow [2022-12-13 17:05:29,831 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 17:05:29,831 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:29,831 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:29,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:05:29,831 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:29,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1456384431, now seen corresponding path program 1 times [2022-12-13 17:05:29,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:29,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140442722] [2022-12-13 17:05:29,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:29,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:29,928 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 17:05:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140442722] [2022-12-13 17:05:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140442722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:29,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:29,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:05:29,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655227740] [2022-12-13 17:05:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:29,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:05:29,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:29,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:05:29,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:05:29,935 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 336 [2022-12-13 17:05:29,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 143 transitions, 1903 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:29,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:29,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 336 [2022-12-13 17:05:29,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:30,918 INFO L130 PetriNetUnfolder]: 2753/4827 cut-off events. [2022-12-13 17:05:30,919 INFO L131 PetriNetUnfolder]: For 24038/24038 co-relation queries the response was YES. [2022-12-13 17:05:30,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25577 conditions, 4827 events. 2753/4827 cut-off events. For 24038/24038 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 31415 event pairs, 533 based on Foata normal form. 28/4716 useless extension candidates. Maximal degree in co-relation 25540. Up to 2539 conditions per place. [2022-12-13 17:05:30,945 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 284 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2022-12-13 17:05:30,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 290 transitions, 4537 flow [2022-12-13 17:05:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:05:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-12-13 17:05:30,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43601190476190477 [2022-12-13 17:05:30,947 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-12-13 17:05:30,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-12-13 17:05:30,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:30,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-12-13 17:05:30,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:30,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:30,967 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:30,968 INFO L175 Difference]: Start difference. First operand has 110 places, 143 transitions, 1903 flow. Second operand 4 states and 586 transitions. [2022-12-13 17:05:30,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 290 transitions, 4537 flow [2022-12-13 17:05:31,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 290 transitions, 4528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:05:31,054 INFO L231 Difference]: Finished difference. Result has 114 places, 144 transitions, 1912 flow [2022-12-13 17:05:31,054 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1912, PETRI_PLACES=114, PETRI_TRANSITIONS=144} [2022-12-13 17:05:31,054 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 31 predicate places. [2022-12-13 17:05:31,054 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 144 transitions, 1912 flow [2022-12-13 17:05:31,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:31,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:31,055 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:31,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:05:31,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:31,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:31,055 INFO L85 PathProgramCache]: Analyzing trace with hash -499823505, now seen corresponding path program 2 times [2022-12-13 17:05:31,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:31,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451787433] [2022-12-13 17:05:31,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:31,160 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 17:05:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:31,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451787433] [2022-12-13 17:05:31,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451787433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:31,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:05:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086713431] [2022-12-13 17:05:31,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:31,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:05:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:31,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:05:31,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:05:31,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 336 [2022-12-13 17:05:31,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 144 transitions, 1912 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 17:05:31,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:31,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 336 [2022-12-13 17:05:31,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:31,535 INFO L130 PetriNetUnfolder]: 730/1473 cut-off events. [2022-12-13 17:05:31,535 INFO L131 PetriNetUnfolder]: For 5995/5998 co-relation queries the response was YES. [2022-12-13 17:05:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7196 conditions, 1473 events. 730/1473 cut-off events. For 5995/5998 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8786 event pairs, 100 based on Foata normal form. 82/1504 useless extension candidates. Maximal degree in co-relation 7157. Up to 773 conditions per place. [2022-12-13 17:05:31,542 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 126 selfloop transitions, 7 changer transitions 0/138 dead transitions. [2022-12-13 17:05:31,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 138 transitions, 1825 flow [2022-12-13 17:05:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:05:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:05:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2022-12-13 17:05:31,544 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42485119047619047 [2022-12-13 17:05:31,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2022-12-13 17:05:31,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2022-12-13 17:05:31,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:31,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2022-12-13 17:05:31,545 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 17:05:31,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:31,546 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:31,546 INFO L175 Difference]: Start difference. First operand has 114 places, 144 transitions, 1912 flow. Second operand 4 states and 571 transitions. [2022-12-13 17:05:31,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 138 transitions, 1825 flow [2022-12-13 17:05:31,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 138 transitions, 1688 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-13 17:05:31,563 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 1145 flow [2022-12-13 17:05:31,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1145, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2022-12-13 17:05:31,564 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, 24 predicate places. [2022-12-13 17:05:31,564 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 1145 flow [2022-12-13 17:05:31,564 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 17:05:31,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:31,565 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 17:05:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 17:05:31,565 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash 936577466, now seen corresponding path program 1 times [2022-12-13 17:05:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931816705] [2022-12-13 17:05:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:31,707 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 17:05:31,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:05:31,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931816705] [2022-12-13 17:05:31,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931816705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:31,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:31,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:05:31,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144233590] [2022-12-13 17:05:31,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:31,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:05:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:05:31,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:05:31,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:05:31,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 336 [2022-12-13 17:05:31,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 1145 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 17:05:31,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:31,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 336 [2022-12-13 17:05:31,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:05:31,960 INFO L130 PetriNetUnfolder]: 465/900 cut-off events. [2022-12-13 17:05:31,960 INFO L131 PetriNetUnfolder]: For 3376/3379 co-relation queries the response was YES. [2022-12-13 17:05:31,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4117 conditions, 900 events. 465/900 cut-off events. For 3376/3379 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5078 event pairs, 77 based on Foata normal form. 34/912 useless extension candidates. Maximal degree in co-relation 4085. Up to 414 conditions per place. [2022-12-13 17:05:31,964 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 73 selfloop transitions, 10 changer transitions 4/91 dead transitions. [2022-12-13 17:05:31,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 91 transitions, 955 flow [2022-12-13 17:05:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:05:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:05:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-12-13 17:05:31,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41369047619047616 [2022-12-13 17:05:31,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-12-13 17:05:31,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-12-13 17:05:31,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:05:31,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-12-13 17:05:31,966 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 17:05:31,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:31,968 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:05:31,968 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 1145 flow. Second operand 5 states and 695 transitions. [2022-12-13 17:05:31,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 91 transitions, 955 flow [2022-12-13 17:05:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 91 transitions, 786 flow, removed 19 selfloop flow, removed 20 redundant places. [2022-12-13 17:05:31,971 INFO L231 Difference]: Finished difference. Result has 79 places, 51 transitions, 356 flow [2022-12-13 17:05:31,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=356, PETRI_PLACES=79, PETRI_TRANSITIONS=51} [2022-12-13 17:05:31,972 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -4 predicate places. [2022-12-13 17:05:31,972 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 51 transitions, 356 flow [2022-12-13 17:05:31,972 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 17:05:31,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:31,972 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 17:05:31,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:31,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash -855639582, now seen corresponding path program 1 times [2022-12-13 17:05:31,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:05:31,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625235670] [2022-12-13 17:05:31,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:05:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:05:32,020 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:05:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:05:32,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:05:32,086 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:05:32,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 17:05:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 17:05:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 17:05:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 17:05:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 17:05:32,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 17:05:32,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 17:05:32,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 17:05:32,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 17:05:32,092 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 17:05:32,093 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 17:05:32,094 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 17:05:32,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 17:05:32,095 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:05:32,099 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:05:32,099 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:05:32,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:05:32 BasicIcfg [2022-12-13 17:05:32,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:05:32,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:05:32,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:05:32,147 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:05:32,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:02" (3/4) ... [2022-12-13 17:05:32,149 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 17:05:32,149 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:05:32,150 INFO L158 Benchmark]: Toolchain (without parser) took 30723.92ms. Allocated memory was 136.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.3MB in the beginning and 600.6MB in the end (delta: -501.3MB). Peak memory consumption was 719.7MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,150 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:05:32,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.44ms. Allocated memory is still 136.3MB. Free memory was 99.3MB in the beginning and 71.1MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.54ms. Allocated memory is still 136.3MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,150 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 136.3MB. Free memory was 68.9MB in the beginning and 66.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,150 INFO L158 Benchmark]: RCFGBuilder took 907.17ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 66.5MB in the beginning and 90.3MB in the end (delta: -23.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,151 INFO L158 Benchmark]: TraceAbstraction took 29400.60ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 89.3MB in the beginning and 600.6MB in the end (delta: -511.3MB). Peak memory consumption was 681.9MB. Max. memory is 16.1GB. [2022-12-13 17:05:32,151 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 1.4GB. Free memory is still 600.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:05:32,152 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 136.3MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.44ms. Allocated memory is still 136.3MB. Free memory was 99.3MB in the beginning and 71.1MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.54ms. Allocated memory is still 136.3MB. Free memory was 71.1MB in the beginning and 68.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 136.3MB. Free memory was 68.9MB in the beginning and 66.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 907.17ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 66.5MB in the beginning and 90.3MB in the end (delta: -23.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29400.60ms. Allocated memory was 163.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 89.3MB in the beginning and 600.6MB in the end (delta: -511.3MB). Peak memory consumption was 681.9MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 1.4GB. Free memory is still 600.6MB. 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: 7.9s, 187 PlacesBefore, 83 PlacesAfterwards, 179 TransitionsBefore, 74 TransitionsAfterwards, 7406 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 154 TotalNumberOfCompositions, 34320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12731, independent: 12171, independent conditional: 0, independent unconditional: 12171, dependent: 560, dependent conditional: 0, dependent unconditional: 560, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3186, independent: 3094, independent conditional: 0, independent unconditional: 3094, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12731, independent: 9077, independent conditional: 0, independent unconditional: 9077, dependent: 468, dependent conditional: 0, dependent unconditional: 468, unknown: 3186, unknown conditional: 0, unknown unconditional: 3186] , Statistics on independence cache: Total cache size (in pairs): 527, Positive cache size: 470, Positive conditional cache size: 0, Positive unconditional cache size: 470, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, 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_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1737; [L851] FCALL, FORK 0 pthread_create(&t1737, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1737, ((void *)0), P0, ((void *)0))=8, t1737={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1738; [L853] FCALL, FORK 0 pthread_create(&t1738, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1738, ((void *)0), P1, ((void *)0))=9, t1737={6:0}, t1738={7:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 1 __unbuffered_p0_EBX = y 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L854] 0 pthread_t t1739; 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1737={6:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 2 __unbuffered_p1_EAX = y 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 2 x$flush_delayed = weak$$choice2 [L803] EXPR 2 \read(x) [L803] 2 x$mem_tmp = x [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 \read(x) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L805] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L806] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L807] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L808] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L810] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 2 \read(x) [L811] 2 __unbuffered_p1_EBX = x [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] EXPR 2 \read(x) [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] 2 x = x$flush_delayed ? x$mem_tmp : x [L813] 2 x$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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L855] FCALL, FORK 0 pthread_create(&t1739, ((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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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(&t1739, ((void *)0), P2, ((void *)0))=10, t1737={6:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L825] 3 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L830] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L832] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 \read(x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1737={6:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L872] 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=1, __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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 240 locations, 85 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: 29.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1894 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1433 mSDsluCounter, 554 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4208 IncrementalHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 183 mSDtfsCounter, 4208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1988occurred in iteration=14, InterpolantAutomatonStates: 88, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 2163 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 17:05:32,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 14d20b200dda38e95ec4ea5c7128c00d20347c5bcda51cecce271855ce0b9ab5 --- 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 17:05:33,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:05:33,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:05:33,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:05:33,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:05:33,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:05:33,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:05:33,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:05:33,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:05:33,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:05:33,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:05:33,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:05:33,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:05:33,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:05:33,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:05:33,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:05:33,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:05:33,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:05:33,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:05:33,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:05:33,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:05:33,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:05:33,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:05:33,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:05:33,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:05:33,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:05:33,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:05:33,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:05:33,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:05:33,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:05:33,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:05:33,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:05:33,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:05:33,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:05:33,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:05:33,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:05:33,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:05:33,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:05:33,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:05:33,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:05:33,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:05:33,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 17:05:33,891 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:05:33,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:05:33,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:05:33,892 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:05:33,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:05:33,893 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:05:33,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:05:33,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:05:33,894 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:05:33,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:05:33,894 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:05:33,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:05:33,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:05:33,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:05:33,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:05:33,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 17:05:33,895 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 17:05:33,895 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 17:05:33,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:05:33,896 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 17:05:33,896 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 17:05:33,896 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 17:05:33,896 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:05:33,897 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:05:33,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:05:33,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:05:33,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:05:33,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:05:33,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:05:33,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:05:33,898 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 17:05:33,898 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 17:05:33,898 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:05:33,899 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:05:33,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:05:33,899 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 17:05:33,899 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:05:33,899 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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 -> 14d20b200dda38e95ec4ea5c7128c00d20347c5bcda51cecce271855ce0b9ab5 [2022-12-13 17:05:34,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:05:34,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:05:34,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:05:34,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:05:34,131 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:05:34,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2022-12-13 17:05:36,630 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:05:36,854 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:05:36,855 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2022-12-13 17:05:36,868 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/c2438b09a/1a0dbd4df0ad41e8811879b72ddd5918/FLAG422d2edd4 [2022-12-13 17:05:37,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/data/c2438b09a/1a0dbd4df0ad41e8811879b72ddd5918 [2022-12-13 17:05:37,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:05:37,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:05:37,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:37,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:05:37,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:05:37,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585ae2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37, skipping insertion in model container [2022-12-13 17:05:37,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:05:37,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:05:37,338 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_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i[994,1007] [2022-12-13 17:05:37,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:37,534 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:05:37,545 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_4907d7dd-536f-48a7-b9db-fce6d8619e15/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i[994,1007] [2022-12-13 17:05:37,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:05:37,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:05:37,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:05:37,631 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:05:37,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37 WrapperNode [2022-12-13 17:05:37,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:05:37,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:37,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:05:37,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:05:37,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,677 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2022-12-13 17:05:37,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:05:37,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:05:37,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:05:37,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:05:37,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:05:37,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:05:37,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:05:37,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:05:37,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (1/1) ... [2022-12-13 17:05:37,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:05:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:05:37,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:05:37,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:05:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 17:05:37,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:05:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:05:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:05:37,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:05:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:05:37,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:05:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:05:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:05:37,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:05:37,773 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 17:05:37,915 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:05:37,917 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:05:38,485 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:05:38,847 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:05:38,847 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:05:38,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:38 BoogieIcfgContainer [2022-12-13 17:05:38,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:05:38,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:05:38,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:05:38,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:05:38,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:05:37" (1/3) ... [2022-12-13 17:05:38,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4555a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:38, skipping insertion in model container [2022-12-13 17:05:38,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:05:37" (2/3) ... [2022-12-13 17:05:38,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4555a50e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:05:38, skipping insertion in model container [2022-12-13 17:05:38,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:38" (3/3) ... [2022-12-13 17:05:38,855 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2022-12-13 17:05:38,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:05:38,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 17:05:38,870 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:05:38,987 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:05:39,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 183 transitions, 381 flow [2022-12-13 17:05:39,092 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-12-13 17:05:39,093 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:39,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 279 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 17:05:39,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 183 transitions, 381 flow [2022-12-13 17:05:39,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 180 transitions, 369 flow [2022-12-13 17:05:39,107 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:05:39,116 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 180 transitions, 369 flow [2022-12-13 17:05:39,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 180 transitions, 369 flow [2022-12-13 17:05:39,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 180 transitions, 369 flow [2022-12-13 17:05:39,169 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-12-13 17:05:39,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:39,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 278 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 17:05:39,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 7406 [2022-12-13 17:05:58,091 INFO L134 LiptonReduction]: Checked pairs total: 34003 [2022-12-13 17:05:58,092 INFO L136 LiptonReduction]: Total number of compositions: 153 [2022-12-13 17:05:58,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:05:58,105 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;@250f4876, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:05:58,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 17:05:58,107 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 17:05:58,107 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:05:58,107 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:05:58,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 17:05:58,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:05:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:05:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1082, now seen corresponding path program 1 times [2022-12-13 17:05:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:05:58,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404139690] [2022-12-13 17:05:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:05:58,122 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 17:05:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:05:58,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:05:58,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:05:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:05:58,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 17:05:58,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:05:58,211 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 17:05:58,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:05:58,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:05:58,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404139690] [2022-12-13 17:05:58,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404139690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:05:58,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:05:58,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 17:05:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94810249] [2022-12-13 17:05:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:05:58,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 17:05:58,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:05:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 17:05:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 17:05:58,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 336 [2022-12-13 17:05:58,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 157 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 17:05:58,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:05:58,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 336 [2022-12-13 17:05:58,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:00,905 INFO L130 PetriNetUnfolder]: 11260/15878 cut-off events. [2022-12-13 17:06:00,905 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 17:06:00,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31821 conditions, 15878 events. 11260/15878 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 99952 event pairs, 11260 based on Foata normal form. 0/7400 useless extension candidates. Maximal degree in co-relation 31810. Up to 15867 conditions per place. [2022-12-13 17:06:00,975 INFO L137 encePairwiseOnDemand]: 305/336 looper letters, 40 selfloop transitions, 0 changer transitions 0/42 dead transitions. [2022-12-13 17:06:00,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 173 flow [2022-12-13 17:06:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 17:06:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 17:06:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2022-12-13 17:06:00,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2022-12-13 17:06:00,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2022-12-13 17:06:00,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2022-12-13 17:06:00,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:00,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2022-12-13 17:06:00,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:00,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:00,994 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:00,995 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 157 flow. Second operand 2 states and 339 transitions. [2022-12-13 17:06:00,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 173 flow [2022-12-13 17:06:00,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:01,000 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 90 flow [2022-12-13 17:06:01,001 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 17:06:01,004 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -33 predicate places. [2022-12-13 17:06:01,004 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 90 flow [2022-12-13 17:06:01,004 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 17:06:01,004 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:01,005 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 17:06:01,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:01,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:01,207 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1069520, now seen corresponding path program 1 times [2022-12-13 17:06:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:01,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119207365] [2022-12-13 17:06:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:01,212 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 17:06:01,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:01,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:01,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:01,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:06:01,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:01,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 17:06:01,436 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 17:06:01,463 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 17:06:01,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:01,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119207365] [2022-12-13 17:06:01,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119207365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:01,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:01,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:06:01,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108623627] [2022-12-13 17:06:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:01,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:01,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:01,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:01,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:06:01,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 336 [2022-12-13 17:06:01,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:01,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:01,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 336 [2022-12-13 17:06:01,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:02,797 INFO L130 PetriNetUnfolder]: 4344/6247 cut-off events. [2022-12-13 17:06:02,797 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:06:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 6247 events. 4344/6247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 34924 event pairs, 4344 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 12534. Up to 6237 conditions per place. [2022-12-13 17:06:02,821 INFO L137 encePairwiseOnDemand]: 328/336 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-12-13 17:06:02,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2022-12-13 17:06:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:02,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:02,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-12-13 17:06:02,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.435515873015873 [2022-12-13 17:06:02,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-12-13 17:06:02,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-12-13 17:06:02,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:02,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-12-13 17:06:02,825 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 17:06:02,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:02,827 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:02,827 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 90 flow. Second operand 3 states and 439 transitions. [2022-12-13 17:06:02,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2022-12-13 17:06:02,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 17:06:02,828 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 17:06:02,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 17:06:02,829 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 17:06:02,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2022-12-13 17:06:02,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:02,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:02,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 17:06:02,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:03,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:03,032 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1069519, now seen corresponding path program 1 times [2022-12-13 17:06:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:03,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525905095] [2022-12-13 17:06:03,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:03,036 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 17:06:03,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:03,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:03,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:03,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:06:03,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:03,157 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 17:06:03,158 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 17:06:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:03,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:03,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:03,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525905095] [2022-12-13 17:06:03,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525905095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:03,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:03,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:06:03,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991994526] [2022-12-13 17:06:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:03,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:03,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:03,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:06:03,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 336 [2022-12-13 17:06:03,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 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 17:06:03,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:03,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 336 [2022-12-13 17:06:03,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:03,777 INFO L130 PetriNetUnfolder]: 1994/2944 cut-off events. [2022-12-13 17:06:03,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:06:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5917 conditions, 2944 events. 1994/2944 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 14955 event pairs, 1138 based on Foata normal form. 0/2164 useless extension candidates. Maximal degree in co-relation 5913. Up to 1817 conditions per place. [2022-12-13 17:06:03,787 INFO L137 encePairwiseOnDemand]: 327/336 looper letters, 37 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 17:06:03,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 168 flow [2022-12-13 17:06:03,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-12-13 17:06:03,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-13 17:06:03,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-12-13 17:06:03,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-12-13 17:06:03,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:03,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-12-13 17:06:03,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:03,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:03,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:03,794 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 436 transitions. [2022-12-13 17:06:03,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 168 flow [2022-12-13 17:06:03,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:06:03,795 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 89 flow [2022-12-13 17:06:03,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=3, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 17:06:03,796 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 17:06:03,796 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 89 flow [2022-12-13 17:06:03,797 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 17:06:03,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:03,797 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:03,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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)] Forceful destruction successful, exit code 0 [2022-12-13 17:06:03,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:03,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:03,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1442579718, now seen corresponding path program 1 times [2022-12-13 17:06:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422714314] [2022-12-13 17:06:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:04,000 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 17:06:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:04,002 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:04,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:06:04,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:04,147 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 17:06:04,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:04,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:04,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422714314] [2022-12-13 17:06:04,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422714314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:04,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:04,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:06:04,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654236843] [2022-12-13 17:06:04,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:04,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:06:04,159 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 336 [2022-12-13 17:06:04,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 89 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 17:06:04,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:04,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 336 [2022-12-13 17:06:04,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:04,537 INFO L130 PetriNetUnfolder]: 860/1412 cut-off events. [2022-12-13 17:06:04,537 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 17:06:04,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3097 conditions, 1412 events. 860/1412 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7071 event pairs, 303 based on Foata normal form. 18/1237 useless extension candidates. Maximal degree in co-relation 3092. Up to 1324 conditions per place. [2022-12-13 17:06:04,541 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 41 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2022-12-13 17:06:04,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 211 flow [2022-12-13 17:06:04,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-12-13 17:06:04,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-13 17:06:04,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-12-13 17:06:04,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-12-13 17:06:04,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:04,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-12-13 17:06:04,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:04,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:04,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 336.0) internal successors, (1344), 4 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:04,547 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 89 flow. Second operand 3 states and 436 transitions. [2022-12-13 17:06:04,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 211 flow [2022-12-13 17:06:04,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:06:04,549 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 111 flow [2022-12-13 17:06:04,550 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 17:06:04,550 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 17:06:04,551 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 111 flow [2022-12-13 17:06:04,551 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 17:06:04,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:04,551 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:04,559 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:04,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash -341258631, now seen corresponding path program 1 times [2022-12-13 17:06:04,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:04,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678484200] [2022-12-13 17:06:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:04,755 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 17:06:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:04,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:04,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:06:04,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:04,982 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 17:06:04,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:04,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678484200] [2022-12-13 17:06:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678484200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:04,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:06:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207515336] [2022-12-13 17:06:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:04,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:04,997 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 336 [2022-12-13 17:06:04,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 111 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 17:06:04,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:04,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 336 [2022-12-13 17:06:04,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:05,251 INFO L130 PetriNetUnfolder]: 209/419 cut-off events. [2022-12-13 17:06:05,251 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-13 17:06:05,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 419 events. 209/419 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1681 event pairs, 65 based on Foata normal form. 21/392 useless extension candidates. Maximal degree in co-relation 1037. Up to 239 conditions per place. [2022-12-13 17:06:05,253 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 49 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2022-12-13 17:06:05,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 279 flow [2022-12-13 17:06:05,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:06:05,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:06:05,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-12-13 17:06:05,255 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42931547619047616 [2022-12-13 17:06:05,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2022-12-13 17:06:05,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2022-12-13 17:06:05,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:05,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2022-12-13 17:06:05,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:05,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:05,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:05,261 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 111 flow. Second operand 4 states and 577 transitions. [2022-12-13 17:06:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 279 flow [2022-12-13 17:06:05,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:06:05,263 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 147 flow [2022-12-13 17:06:05,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2022-12-13 17:06:05,264 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -34 predicate places. [2022-12-13 17:06:05,264 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 147 flow [2022-12-13 17:06:05,264 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 17:06:05,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:05,265 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:05,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:05,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:05,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:05,466 INFO L85 PathProgramCache]: Analyzing trace with hash -635765841, now seen corresponding path program 1 times [2022-12-13 17:06:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:05,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407355135] [2022-12-13 17:06:05,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:05,467 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 17:06:05,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:05,468 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:05,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:05,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 17:06:05,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:05,615 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 17:06:05,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:05,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407355135] [2022-12-13 17:06:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407355135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:05,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:06:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368947852] [2022-12-13 17:06:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:05,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:06:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:06:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:06:05,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 336 [2022-12-13 17:06:05,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 147 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 17:06:05,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:05,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 336 [2022-12-13 17:06:05,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:05,965 INFO L130 PetriNetUnfolder]: 114/224 cut-off events. [2022-12-13 17:06:05,965 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 17:06:05,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 224 events. 114/224 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 740 event pairs, 40 based on Foata normal form. 8/225 useless extension candidates. Maximal degree in co-relation 630. Up to 92 conditions per place. [2022-12-13 17:06:05,967 INFO L137 encePairwiseOnDemand]: 331/336 looper letters, 40 selfloop transitions, 10 changer transitions 1/53 dead transitions. [2022-12-13 17:06:05,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 273 flow [2022-12-13 17:06:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:06:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:06:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2022-12-13 17:06:05,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2022-12-13 17:06:05,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2022-12-13 17:06:05,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2022-12-13 17:06:05,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:05,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2022-12-13 17:06:05,971 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 17:06:05,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:05,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:05,972 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 147 flow. Second operand 5 states and 702 transitions. [2022-12-13 17:06:05,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 273 flow [2022-12-13 17:06:05,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 257 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:05,974 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-12-13 17:06:05,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 17:06:05,975 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 17:06:05,975 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-12-13 17:06:05,975 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 17:06:05,975 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:05,975 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:05,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1582152159, now seen corresponding path program 1 times [2022-12-13 17:06:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:06,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368504975] [2022-12-13 17:06:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:06,181 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 17:06:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:06,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:06,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 17:06:06,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:06,384 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 17:06:06,405 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 17:06:06,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:06,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:06,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368504975] [2022-12-13 17:06:06,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368504975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:06,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:06,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:06:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866141372] [2022-12-13 17:06:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:06,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:06:06,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:06,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:06:06,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:06:06,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 336 [2022-12-13 17:06:06,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:06,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:06,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 336 [2022-12-13 17:06:06,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:06,702 INFO L130 PetriNetUnfolder]: 114/235 cut-off events. [2022-12-13 17:06:06,702 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 17:06:06,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 235 events. 114/235 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 845 event pairs, 24 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 662. Up to 163 conditions per place. [2022-12-13 17:06:06,704 INFO L137 encePairwiseOnDemand]: 332/336 looper letters, 41 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-13 17:06:06,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 277 flow [2022-12-13 17:06:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:06:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:06:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2022-12-13 17:06:06,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4029761904761905 [2022-12-13 17:06:06,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2022-12-13 17:06:06,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2022-12-13 17:06:06,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:06,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2022-12-13 17:06:06,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:06,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:06,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 336.0) internal successors, (2016), 6 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:06,711 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 5 states and 677 transitions. [2022-12-13 17:06:06,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 277 flow [2022-12-13 17:06:06,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:06,714 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 115 flow [2022-12-13 17:06:06,714 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 17:06:06,715 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 17:06:06,715 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 115 flow [2022-12-13 17:06:06,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:06,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:06,716 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:06,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:06,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1976501111, now seen corresponding path program 1 times [2022-12-13 17:06:06,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:06,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997679933] [2022-12-13 17:06:06,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:06,922 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 17:06:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:06,924 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:06,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:07,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 17:06:07,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:07,099 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 17:06:07,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:07,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:07,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997679933] [2022-12-13 17:06:07,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997679933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:07,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:07,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:06:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140964974] [2022-12-13 17:06:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:07,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:07,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:07,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:07,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:07,107 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 336 [2022-12-13 17:06:07,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:07,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:07,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 336 [2022-12-13 17:06:07,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:07,388 INFO L130 PetriNetUnfolder]: 205/415 cut-off events. [2022-12-13 17:06:07,388 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-13 17:06:07,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 415 events. 205/415 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1766 event pairs, 26 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1124. Up to 206 conditions per place. [2022-12-13 17:06:07,390 INFO L137 encePairwiseOnDemand]: 333/336 looper letters, 62 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2022-12-13 17:06:07,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 369 flow [2022-12-13 17:06:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:06:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:06:07,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2022-12-13 17:06:07,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42485119047619047 [2022-12-13 17:06:07,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2022-12-13 17:06:07,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2022-12-13 17:06:07,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:07,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2022-12-13 17:06:07,394 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 17:06:07,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:07,395 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 336.0) internal successors, (1680), 5 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:07,395 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 115 flow. Second operand 4 states and 571 transitions. [2022-12-13 17:06:07,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 369 flow [2022-12-13 17:06:07,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 361 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:07,397 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 123 flow [2022-12-13 17:06:07,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-13 17:06:07,397 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2022-12-13 17:06:07,397 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 123 flow [2022-12-13 17:06:07,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:07,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:07,398 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:07,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:07,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:07,599 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:07,601 INFO L85 PathProgramCache]: Analyzing trace with hash 555599075, now seen corresponding path program 2 times [2022-12-13 17:06:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:07,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095133247] [2022-12-13 17:06:07,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:06:07,603 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 17:06:07,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:07,606 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:07,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:07,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 17:06:07,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:06:07,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 17:06:07,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:06:07,810 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 17:06:07,844 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 17:06:07,931 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 17:06:07,948 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 17:06:07,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 17:06:07,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:06:07,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095133247] [2022-12-13 17:06:07,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095133247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:07,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:07,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:06:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052941317] [2022-12-13 17:06:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:07,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:06:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:06:07,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:06:07,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:06:08,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 336 [2022-12-13 17:06:08,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:08,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:08,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 336 [2022-12-13 17:06:08,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:08,727 INFO L130 PetriNetUnfolder]: 238/520 cut-off events. [2022-12-13 17:06:08,727 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-13 17:06:08,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 520 events. 238/520 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2577 event pairs, 98 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 1545. Up to 282 conditions per place. [2022-12-13 17:06:08,729 INFO L137 encePairwiseOnDemand]: 330/336 looper letters, 68 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2022-12-13 17:06:08,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 475 flow [2022-12-13 17:06:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:06:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:06:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2022-12-13 17:06:08,732 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 17:06:08,732 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2022-12-13 17:06:08,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2022-12-13 17:06:08,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:08,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2022-12-13 17:06:08,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:08,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:08,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 336.0) internal successors, (2352), 7 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:08,736 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 123 flow. Second operand 6 states and 784 transitions. [2022-12-13 17:06:08,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 475 flow [2022-12-13 17:06:08,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:06:08,739 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 165 flow [2022-12-13 17:06:08,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-13 17:06:08,739 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -29 predicate places. [2022-12-13 17:06:08,740 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 165 flow [2022-12-13 17:06:08,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:08,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:08,740 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:08,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:08,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:08,941 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 17:06:08,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:08,942 INFO L85 PathProgramCache]: Analyzing trace with hash 433449241, now seen corresponding path program 3 times [2022-12-13 17:06:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:06:08,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108273047] [2022-12-13 17:06:08,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 17:06:08,944 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 17:06:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:06:08,946 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:08,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:09,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 17:06:09,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 17:06:09,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:06:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:06:09,348 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 17:06:09,348 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:06:09,349 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 17:06:09,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 17:06:09,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 17:06:09,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 17:06:09,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 17:06:09,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 17:06:09,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 17:06:09,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 17:06:09,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 17:06:09,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 17:06:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 17:06:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 17:06:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 17:06:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 17:06:09,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 17:06:09,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 17:06:09,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 17:06:09,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 17:06:09,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 17:06:09,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 17:06:09,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 17:06:09,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 17:06:09,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 17:06:09,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 17:06:09,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 17:06:09,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 17:06:09,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 17:06:09,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 17:06:09,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 17:06:09,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 17:06:09,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 17:06:09,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 17:06:09,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 17:06:09,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 17:06:09,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 17:06:09,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 17:06:09,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 17:06:09,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 17:06:09,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 17:06:09,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 17:06:09,365 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 17:06:09,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 17:06:09,366 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 17:06:09,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:09,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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 17:06:09,567 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:09,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:06:09,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:06:09,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:06:09 BasicIcfg [2022-12-13 17:06:09,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:06:09,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:06:09,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:06:09,675 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:06:09,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:05:38" (3/4) ... [2022-12-13 17:06:09,678 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 17:06:09,678 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:06:09,678 INFO L158 Benchmark]: Toolchain (without parser) took 32488.58ms. Allocated memory was 58.7MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 36.1MB in the beginning and 1.0GB in the end (delta: -997.8MB). Peak memory consumption was 174.6MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 48.2MB. Free memory was 26.8MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:06:09,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.19ms. Allocated memory is still 58.7MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 877.4kB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.09ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 32.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,679 INFO L158 Benchmark]: Boogie Preprocessor took 31.32ms. Allocated memory is still 58.7MB. Free memory was 32.3MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,679 INFO L158 Benchmark]: RCFGBuilder took 1140.07ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 31.8MB in the end (delta: -2.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,679 INFO L158 Benchmark]: TraceAbstraction took 30823.66ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 31.3MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2022-12-13 17:06:09,680 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:06:09,681 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.18ms. Allocated memory is still 48.2MB. Free memory was 26.8MB in the beginning and 26.7MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.19ms. Allocated memory is still 58.7MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 877.4kB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.09ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 32.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.32ms. Allocated memory is still 58.7MB. Free memory was 32.3MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1140.07ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.8MB in the beginning and 31.8MB in the end (delta: -2.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 30823.66ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.2GB). Free memory was 31.3MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. 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: 19.0s, 188 PlacesBefore, 83 PlacesAfterwards, 180 TransitionsBefore, 74 TransitionsAfterwards, 7406 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 153 TotalNumberOfCompositions, 34003 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12460, independent: 11907, independent conditional: 0, independent unconditional: 11907, dependent: 553, dependent conditional: 0, dependent unconditional: 553, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3176, independent: 3085, independent conditional: 0, independent unconditional: 3085, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12460, independent: 8822, independent conditional: 0, independent unconditional: 8822, dependent: 462, dependent conditional: 0, dependent unconditional: 462, unknown: 3176, unknown conditional: 0, unknown unconditional: 3176] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 419, Positive conditional cache size: 0, Positive unconditional cache size: 419, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, 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_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1737; [L851] FCALL, FORK 0 pthread_create(&t1737, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1737, ((void *)0), P0, ((void *)0))=0, t1737={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1738; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 1 __unbuffered_p0_EBX = y 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L853] FCALL, FORK 0 pthread_create(&t1738, ((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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1738, ((void *)0), P1, ((void *)0))=1, t1737={15:0}, t1738={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 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_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 2 __unbuffered_p1_EAX = y 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 2 x$flush_delayed = weak$$choice2 [L803] EXPR 2 \read(x) [L803] 2 x$mem_tmp = x [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 \read(x) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L805] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L806] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L807] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L808] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L810] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 2 \read(x) [L811] 2 __unbuffered_p1_EBX = x [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] EXPR 2 \read(x) [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] 2 x = x$flush_delayed ? x$mem_tmp : x [L813] 2 x$flush_delayed = (_Bool)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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L854] 0 pthread_t t1739; 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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1737={15:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L855] FCALL, FORK 0 pthread_create(&t1739, ((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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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(&t1739, ((void *)0), P2, ((void *)0))=2, t1737={15:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L830] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L832] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 \read(x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1737={15:0}, t1738={7:0}, t1739={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L872] 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=1, __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_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 241 locations, 85 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: 30.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 228 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1141 IncrementalHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 71 mSDtfsCounter, 1141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=9, InterpolantAutomatonStates: 35, 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.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 634 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 17:06:09,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4907d7dd-536f-48a7-b9db-fce6d8619e15/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