./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:54:25,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:54:25,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:54:25,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:54:25,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:54:25,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:54:25,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:54:25,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:54:25,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:54:25,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:54:25,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:54:25,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:54:25,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:54:25,970 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:54:25,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:54:25,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:54:25,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:54:25,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:54:25,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:54:25,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:54:25,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:54:25,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:54:25,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:54:25,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:54:26,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:54:26,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:54:26,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:54:26,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:54:26,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:54:26,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:54:26,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:54:26,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:54:26,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:54:26,016 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:54:26,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:54:26,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:54:26,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:54:26,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:54:26,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:54:26,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:54:26,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:54:26,022 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:54:26,067 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:54:26,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:54:26,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:54:26,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:54:26,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:54:26,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:54:26,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:54:26,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:54:26,071 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:54:26,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:54:26,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:54:26,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:54:26,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:54:26,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:54:26,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:54:26,073 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:54:26,073 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:54:26,073 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:54:26,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:54:26,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:54:26,074 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:54:26,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:54:26,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:54:26,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:54:26,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:54:26,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:26,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:54:26,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:54:26,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:54:26,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:54:26,082 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:54:26,082 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:54:26,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:54:26,083 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_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2022-11-25 17:54:26,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:54:26,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:54:26,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:54:26,474 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:54:26,474 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:54:26,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:54:29,874 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:54:30,174 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:54:30,174 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:54:30,192 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/d2ccd8392/cc55157d0b5b40ea8fbf5062b9e58269/FLAGbaa74e004 [2022-11-25 17:54:30,209 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/d2ccd8392/cc55157d0b5b40ea8fbf5062b9e58269 [2022-11-25 17:54:30,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:54:30,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:54:30,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:30,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:54:30,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:54:30,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:30" (1/1) ... [2022-11-25 17:54:30,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5111dc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:30, skipping insertion in model container [2022-11-25 17:54:30,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:30" (1/1) ... [2022-11-25 17:54:30,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:54:30,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:54:30,462 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_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-11-25 17:54:30,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,798 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:30,851 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:54:30,869 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_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-11-25 17:54:30,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:30,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:30,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:31,042 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:54:31,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31 WrapperNode [2022-11-25 17:54:31,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:31,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:31,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:54:31,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:54:31,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,105 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-25 17:54:31,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:31,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:54:31,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:54:31,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:54:31,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,123 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,164 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:54:31,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:54:31,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:54:31,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:54:31,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (1/1) ... [2022-11-25 17:54:31,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:31,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:54:31,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:54:31,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:54:31,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:54:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:54:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:54:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:54:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:54:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:54:31,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:54:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:54:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:54:31,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:54:31,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:54:31,297 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:54:31,490 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:54:31,493 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:54:32,340 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:54:32,966 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:54:32,967 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:54:32,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:32 BoogieIcfgContainer [2022-11-25 17:54:32,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:54:32,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:54:32,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:54:32,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:54:32,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:54:30" (1/3) ... [2022-11-25 17:54:32,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb20348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:32, skipping insertion in model container [2022-11-25 17:54:32,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:31" (2/3) ... [2022-11-25 17:54:32,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb20348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:32, skipping insertion in model container [2022-11-25 17:54:32,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:32" (3/3) ... [2022-11-25 17:54:32,987 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:54:33,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:54:33,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-25 17:54:33,010 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:54:33,194 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:54:33,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 170 transitions, 355 flow [2022-11-25 17:54:33,434 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-11-25 17:54:33,434 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 205 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-25 17:54:33,448 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 170 transitions, 355 flow [2022-11-25 17:54:33,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 167 transitions, 343 flow [2022-11-25 17:54:33,464 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:54:33,482 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 167 transitions, 343 flow [2022-11-25 17:54:33,486 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 167 transitions, 343 flow [2022-11-25 17:54:33,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 343 flow [2022-11-25 17:54:33,538 INFO L130 PetriNetUnfolder]: 2/167 cut-off events. [2022-11-25 17:54:33,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:33,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 167 events. 2/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 204 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-25 17:54:33,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-11-25 17:54:54,274 INFO L134 LiptonReduction]: Checked pairs total: 17240 [2022-11-25 17:54:54,274 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-11-25 17:54:54,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:54:54,327 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;@e6cd662, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:54:54,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-25 17:54:54,335 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:54:54,336 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:54,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:54,338 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:54:54,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:54:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:54,348 INFO L85 PathProgramCache]: Analyzing trace with hash 953, now seen corresponding path program 1 times [2022-11-25 17:54:54,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:54,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779708559] [2022-11-25 17:54:54,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:54,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:54,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779708559] [2022-11-25 17:54:54,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779708559] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:54,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:54:54,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424509042] [2022-11-25 17:54:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:54:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:54:54,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:54:54,597 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 337 [2022-11-25 17:54:54,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 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-11-25 17:54:54,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:54,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 337 [2022-11-25 17:54:54,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:56,237 INFO L130 PetriNetUnfolder]: 3634/5311 cut-off events. [2022-11-25 17:54:56,238 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:56,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10628 conditions, 5311 events. 3634/5311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 30955 event pairs, 3634 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 10617. Up to 5271 conditions per place. [2022-11-25 17:54:56,288 INFO L137 encePairwiseOnDemand]: 314/337 looper letters, 34 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-11-25 17:54:56,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 153 flow [2022-11-25 17:54:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:54:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:54:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 325 transitions. [2022-11-25 17:54:56,310 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4821958456973294 [2022-11-25 17:54:56,311 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 325 transitions. [2022-11-25 17:54:56,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 325 transitions. [2022-11-25 17:54:56,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:56,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 325 transitions. [2022-11-25 17:54:56,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,333 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,335 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 325 transitions. [2022-11-25 17:54:56,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 153 flow [2022-11-25 17:54:56,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:54:56,346 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2022-11-25 17:54:56,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 17:54:56,353 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:54:56,353 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2022-11-25 17:54:56,353 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-11-25 17:54:56,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:56,354 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:54:56,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:54:56,355 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:54:56,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 938039, now seen corresponding path program 1 times [2022-11-25 17:54:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:56,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618587508] [2022-11-25 17:54:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618587508] [2022-11-25 17:54:56,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618587508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:56,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:56,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336772058] [2022-11-25 17:54:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:56,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:56,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 337 [2022-11-25 17:54:56,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:56,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 337 [2022-11-25 17:54:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:57,764 INFO L130 PetriNetUnfolder]: 2095/3113 cut-off events. [2022-11-25 17:54:57,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:57,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6230 conditions, 3113 events. 2095/3113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 17132 event pairs, 2095 based on Foata normal form. 0/2070 useless extension candidates. Maximal degree in co-relation 6227. Up to 3080 conditions per place. [2022-11-25 17:54:57,785 INFO L137 encePairwiseOnDemand]: 332/337 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2022-11-25 17:54:57,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 134 flow [2022-11-25 17:54:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:54:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:54:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-11-25 17:54:57,788 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42532146389713155 [2022-11-25 17:54:57,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-11-25 17:54:57,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-11-25 17:54:57,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:57,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-11-25 17:54:57,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,794 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 430 transitions. [2022-11-25 17:54:57,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 134 flow [2022-11-25 17:54:57,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:54:57,796 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2022-11-25 17:54:57,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-11-25 17:54:57,797 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2022-11-25 17:54:57,797 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2022-11-25 17:54:57,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:57,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:54:57,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:54:57,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:54:57,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 938038, now seen corresponding path program 1 times [2022-11-25 17:54:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:57,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803425293] [2022-11-25 17:54:57,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:57,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:57,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:57,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803425293] [2022-11-25 17:54:57,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803425293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:57,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:57,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:57,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277942410] [2022-11-25 17:54:57,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:57,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:57,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:57,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:57,937 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 337 [2022-11-25 17:54:57,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:57,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 337 [2022-11-25 17:54:57,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:58,667 INFO L130 PetriNetUnfolder]: 1885/2952 cut-off events. [2022-11-25 17:54:58,667 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:58,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5868 conditions, 2952 events. 1885/2952 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 16718 event pairs, 1131 based on Foata normal form. 0/2411 useless extension candidates. Maximal degree in co-relation 5864. Up to 1666 conditions per place. [2022-11-25 17:54:58,684 INFO L137 encePairwiseOnDemand]: 323/337 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2022-11-25 17:54:58,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 176 flow [2022-11-25 17:54:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:54:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:54:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-25 17:54:58,686 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42631058358061324 [2022-11-25 17:54:58,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-25 17:54:58,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-25 17:54:58,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:58,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-25 17:54:58,689 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-11-25 17:54:58,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:58,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:58,692 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 431 transitions. [2022-11-25 17:54:58,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 176 flow [2022-11-25 17:54:58,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:54:58,694 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 135 flow [2022-11-25 17:54:58,694 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-11-25 17:54:58,695 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2022-11-25 17:54:58,695 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 135 flow [2022-11-25 17:54:58,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:58,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:58,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:58,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:54:58,697 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:54:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1147888580, now seen corresponding path program 1 times [2022-11-25 17:54:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135309113] [2022-11-25 17:54:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:58,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135309113] [2022-11-25 17:54:58,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135309113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:58,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:58,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901182108] [2022-11-25 17:54:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:58,895 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 337 [2022-11-25 17:54:58,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:58,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:58,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 337 [2022-11-25 17:54:58,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:59,733 INFO L130 PetriNetUnfolder]: 1671/2731 cut-off events. [2022-11-25 17:54:59,733 INFO L131 PetriNetUnfolder]: For 726/767 co-relation queries the response was YES. [2022-11-25 17:54:59,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2731 events. 1671/2731 cut-off events. For 726/767 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 16121 event pairs, 726 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 6919. Up to 1713 conditions per place. [2022-11-25 17:54:59,754 INFO L137 encePairwiseOnDemand]: 333/337 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-11-25 17:54:59,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 337 flow [2022-11-25 17:54:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:54:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:54:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2022-11-25 17:54:59,761 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44510385756676557 [2022-11-25 17:54:59,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2022-11-25 17:54:59,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2022-11-25 17:54:59,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:59,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2022-11-25 17:54:59,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,767 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 135 flow. Second operand 3 states and 450 transitions. [2022-11-25 17:54:59,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 337 flow [2022-11-25 17:54:59,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:54:59,780 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2022-11-25 17:54:59,781 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 17:54:59,783 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:54:59,783 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2022-11-25 17:54:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,784 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:59,784 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:54:59,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:54:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:59,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1224806241, now seen corresponding path program 1 times [2022-11-25 17:54:59,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:59,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648194132] [2022-11-25 17:54:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:59,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:59,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648194132] [2022-11-25 17:54:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648194132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:59,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:59,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:54:59,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072422528] [2022-11-25 17:54:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:59,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:59,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:59,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:55:00,040 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 337 [2022-11-25 17:55:00,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:00,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:00,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 337 [2022-11-25 17:55:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:00,851 INFO L130 PetriNetUnfolder]: 1730/2836 cut-off events. [2022-11-25 17:55:00,851 INFO L131 PetriNetUnfolder]: For 643/678 co-relation queries the response was YES. [2022-11-25 17:55:00,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7280 conditions, 2836 events. 1730/2836 cut-off events. For 643/678 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 16976 event pairs, 695 based on Foata normal form. 0/2499 useless extension candidates. Maximal degree in co-relation 7274. Up to 1661 conditions per place. [2022-11-25 17:55:00,876 INFO L137 encePairwiseOnDemand]: 331/337 looper letters, 47 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2022-11-25 17:55:00,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 288 flow [2022-11-25 17:55:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:55:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-25 17:55:00,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42828882294757664 [2022-11-25 17:55:00,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-25 17:55:00,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-25 17:55:00,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:00,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-25 17:55:00,882 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-11-25 17:55:00,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:00,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:00,886 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 433 transitions. [2022-11-25 17:55:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 288 flow [2022-11-25 17:55:00,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:00,890 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 164 flow [2022-11-25 17:55:00,890 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2022-11-25 17:55:00,891 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:55:00,891 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 164 flow [2022-11-25 17:55:00,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:00,892 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:00,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:00,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:55:00,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:00,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1224806242, now seen corresponding path program 1 times [2022-11-25 17:55:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:00,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604994866] [2022-11-25 17:55:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:00,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604994866] [2022-11-25 17:55:01,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604994866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:01,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:01,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:55:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927647552] [2022-11-25 17:55:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:55:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:55:01,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:55:01,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 337 [2022-11-25 17:55:01,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:01,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:01,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 337 [2022-11-25 17:55:01,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:02,671 INFO L130 PetriNetUnfolder]: 1659/2739 cut-off events. [2022-11-25 17:55:02,671 INFO L131 PetriNetUnfolder]: For 1488/1517 co-relation queries the response was YES. [2022-11-25 17:55:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7479 conditions, 2739 events. 1659/2739 cut-off events. For 1488/1517 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 16448 event pairs, 728 based on Foata normal form. 26/2380 useless extension candidates. Maximal degree in co-relation 7472. Up to 1720 conditions per place. [2022-11-25 17:55:02,700 INFO L137 encePairwiseOnDemand]: 334/337 looper letters, 56 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2022-11-25 17:55:02,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 356 flow [2022-11-25 17:55:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:02,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-25 17:55:02,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41543026706231456 [2022-11-25 17:55:02,704 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-25 17:55:02,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-25 17:55:02,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:02,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-25 17:55:02,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:02,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:02,712 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:02,713 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 164 flow. Second operand 4 states and 560 transitions. [2022-11-25 17:55:02,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 356 flow [2022-11-25 17:55:02,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:02,734 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 157 flow [2022-11-25 17:55:02,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=157, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-11-25 17:55:02,736 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:55:02,736 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 157 flow [2022-11-25 17:55:02,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:02,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:02,737 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:02,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:55:02,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1224811180, now seen corresponding path program 1 times [2022-11-25 17:55:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:02,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598222021] [2022-11-25 17:55:02,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598222021] [2022-11-25 17:55:03,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598222021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:03,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:03,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:55:03,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657311217] [2022-11-25 17:55:03,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:03,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:55:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:55:03,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:55:03,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 337 [2022-11-25 17:55:03,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:03,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:03,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 337 [2022-11-25 17:55:03,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:03,813 INFO L130 PetriNetUnfolder]: 1627/2684 cut-off events. [2022-11-25 17:55:03,814 INFO L131 PetriNetUnfolder]: For 1390/1418 co-relation queries the response was YES. [2022-11-25 17:55:03,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7154 conditions, 2684 events. 1627/2684 cut-off events. For 1390/1418 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 15997 event pairs, 726 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 7148. Up to 1706 conditions per place. [2022-11-25 17:55:03,836 INFO L137 encePairwiseOnDemand]: 334/337 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-11-25 17:55:03,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 349 flow [2022-11-25 17:55:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:55:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-11-25 17:55:03,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44411473788328387 [2022-11-25 17:55:03,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-11-25 17:55:03,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-11-25 17:55:03,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:03,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-11-25 17:55:03,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:03,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:03,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:03,845 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 157 flow. Second operand 3 states and 449 transitions. [2022-11-25 17:55:03,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 349 flow [2022-11-25 17:55:03,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:03,853 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 164 flow [2022-11-25 17:55:03,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=153, 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=164, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-11-25 17:55:03,854 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-11-25 17:55:03,855 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 164 flow [2022-11-25 17:55:03,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:03,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:03,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:03,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:55:03,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 685557965, now seen corresponding path program 1 times [2022-11-25 17:55:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956900984] [2022-11-25 17:55:03,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:03,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:04,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-11-25 17:55:04,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:04,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956900984] [2022-11-25 17:55:04,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956900984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:04,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:04,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:04,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567285362] [2022-11-25 17:55:04,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:04,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:04,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 337 [2022-11-25 17:55:04,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 164 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-11-25 17:55:04,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:04,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 337 [2022-11-25 17:55:04,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:05,083 INFO L130 PetriNetUnfolder]: 1648/2867 cut-off events. [2022-11-25 17:55:05,083 INFO L131 PetriNetUnfolder]: For 1994/2049 co-relation queries the response was YES. [2022-11-25 17:55:05,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 2867 events. 1648/2867 cut-off events. For 1994/2049 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 19452 event pairs, 264 based on Foata normal form. 26/2558 useless extension candidates. Maximal degree in co-relation 7794. Up to 1886 conditions per place. [2022-11-25 17:55:05,104 INFO L137 encePairwiseOnDemand]: 334/337 looper letters, 60 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2022-11-25 17:55:05,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 408 flow [2022-11-25 17:55:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:55:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-25 17:55:05,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4362017804154303 [2022-11-25 17:55:05,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-25 17:55:05,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-25 17:55:05,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:05,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-25 17:55:05,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:05,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:05,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:05,114 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 164 flow. Second operand 3 states and 441 transitions. [2022-11-25 17:55:05,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 408 flow [2022-11-25 17:55:05,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:05,119 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 166 flow [2022-11-25 17:55:05,120 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=158, 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=166, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-25 17:55:05,120 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2022-11-25 17:55:05,121 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 166 flow [2022-11-25 17:55:05,121 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-11-25 17:55:05,121 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:05,122 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:05,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:55:05,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash 689277534, now seen corresponding path program 1 times [2022-11-25 17:55:05,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017791601] [2022-11-25 17:55:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:05,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017791601] [2022-11-25 17:55:05,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017791601] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:05,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:05,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404893232] [2022-11-25 17:55:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:05,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:55:05,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:55:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:55:05,526 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 337 [2022-11-25 17:55:05,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:05,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:05,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 337 [2022-11-25 17:55:05,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:06,161 INFO L130 PetriNetUnfolder]: 1739/2768 cut-off events. [2022-11-25 17:55:06,161 INFO L131 PetriNetUnfolder]: For 1030/1030 co-relation queries the response was YES. [2022-11-25 17:55:06,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8357 conditions, 2768 events. 1739/2768 cut-off events. For 1030/1030 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 16186 event pairs, 359 based on Foata normal form. 4/2444 useless extension candidates. Maximal degree in co-relation 8349. Up to 2379 conditions per place. [2022-11-25 17:55:06,182 INFO L137 encePairwiseOnDemand]: 329/337 looper letters, 50 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2022-11-25 17:55:06,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 372 flow [2022-11-25 17:55:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:06,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2022-11-25 17:55:06,185 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4102373887240356 [2022-11-25 17:55:06,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2022-11-25 17:55:06,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2022-11-25 17:55:06,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:06,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2022-11-25 17:55:06,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,191 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 166 flow. Second operand 4 states and 553 transitions. [2022-11-25 17:55:06,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 372 flow [2022-11-25 17:55:06,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:06,197 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 249 flow [2022-11-25 17:55:06,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-11-25 17:55:06,198 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-11-25 17:55:06,198 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 249 flow [2022-11-25 17:55:06,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,199 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:06,199 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:06,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:55:06,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash -222498636, now seen corresponding path program 1 times [2022-11-25 17:55:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:06,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92017362] [2022-11-25 17:55:06,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:06,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92017362] [2022-11-25 17:55:06,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92017362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:06,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:06,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454722618] [2022-11-25 17:55:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:06,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:55:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:55:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:55:06,515 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 337 [2022-11-25 17:55:06,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:06,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 337 [2022-11-25 17:55:06,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:07,292 INFO L130 PetriNetUnfolder]: 1582/2545 cut-off events. [2022-11-25 17:55:07,292 INFO L131 PetriNetUnfolder]: For 1299/1299 co-relation queries the response was YES. [2022-11-25 17:55:07,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 2545 events. 1582/2545 cut-off events. For 1299/1299 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 14587 event pairs, 649 based on Foata normal form. 15/2268 useless extension candidates. Maximal degree in co-relation 7869. Up to 979 conditions per place. [2022-11-25 17:55:07,313 INFO L137 encePairwiseOnDemand]: 326/337 looper letters, 47 selfloop transitions, 15 changer transitions 0/64 dead transitions. [2022-11-25 17:55:07,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 447 flow [2022-11-25 17:55:07,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2022-11-25 17:55:07,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4050445103857567 [2022-11-25 17:55:07,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2022-11-25 17:55:07,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2022-11-25 17:55:07,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:07,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2022-11-25 17:55:07,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:07,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:07,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:07,333 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 249 flow. Second operand 4 states and 546 transitions. [2022-11-25 17:55:07,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 447 flow [2022-11-25 17:55:07,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:55:07,348 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 342 flow [2022-11-25 17:55:07,349 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-11-25 17:55:07,351 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2022-11-25 17:55:07,352 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 342 flow [2022-11-25 17:55:07,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:07,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:07,353 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:55:07,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:07,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:07,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1633890602, now seen corresponding path program 1 times [2022-11-25 17:55:07,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760598038] [2022-11-25 17:55:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:07,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760598038] [2022-11-25 17:55:07,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760598038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:07,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473664321] [2022-11-25 17:55:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:07,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 337 [2022-11-25 17:55:07,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:07,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:07,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 337 [2022-11-25 17:55:07,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:08,786 INFO L130 PetriNetUnfolder]: 2506/4135 cut-off events. [2022-11-25 17:55:08,786 INFO L131 PetriNetUnfolder]: For 5804/6002 co-relation queries the response was YES. [2022-11-25 17:55:08,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13217 conditions, 4135 events. 2506/4135 cut-off events. For 5804/6002 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 27528 event pairs, 655 based on Foata normal form. 94/3822 useless extension candidates. Maximal degree in co-relation 13206. Up to 1444 conditions per place. [2022-11-25 17:55:08,811 INFO L137 encePairwiseOnDemand]: 333/337 looper letters, 106 selfloop transitions, 3 changer transitions 0/114 dead transitions. [2022-11-25 17:55:08,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 114 transitions, 955 flow [2022-11-25 17:55:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-11-25 17:55:08,814 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43471810089020774 [2022-11-25 17:55:08,814 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-11-25 17:55:08,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-11-25 17:55:08,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:08,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-11-25 17:55:08,817 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-11-25 17:55:08,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,820 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 342 flow. Second operand 4 states and 586 transitions. [2022-11-25 17:55:08,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 114 transitions, 955 flow [2022-11-25 17:55:08,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:55:08,840 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 356 flow [2022-11-25 17:55:08,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2022-11-25 17:55:08,841 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2022-11-25 17:55:08,841 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 356 flow [2022-11-25 17:55:08,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,841 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:08,842 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:08,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:55:08,842 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:08,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1692476482, now seen corresponding path program 1 times [2022-11-25 17:55:08,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:08,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750473705] [2022-11-25 17:55:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:09,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750473705] [2022-11-25 17:55:09,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750473705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:09,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:09,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:55:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485852255] [2022-11-25 17:55:09,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:09,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:55:09,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:55:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:55:09,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 337 [2022-11-25 17:55:09,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:09,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:09,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 337 [2022-11-25 17:55:09,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:10,127 INFO L130 PetriNetUnfolder]: 1930/3182 cut-off events. [2022-11-25 17:55:10,128 INFO L131 PetriNetUnfolder]: For 3226/3234 co-relation queries the response was YES. [2022-11-25 17:55:10,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10988 conditions, 3182 events. 1930/3182 cut-off events. For 3226/3234 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 19784 event pairs, 622 based on Foata normal form. 49/3043 useless extension candidates. Maximal degree in co-relation 10974. Up to 1269 conditions per place. [2022-11-25 17:55:10,149 INFO L137 encePairwiseOnDemand]: 325/337 looper letters, 63 selfloop transitions, 18 changer transitions 0/83 dead transitions. [2022-11-25 17:55:10,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 83 transitions, 669 flow [2022-11-25 17:55:10,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:55:10,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2022-11-25 17:55:10,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3877349159248269 [2022-11-25 17:55:10,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2022-11-25 17:55:10,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2022-11-25 17:55:10,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:10,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2022-11-25 17:55:10,158 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-11-25 17:55:10,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:10,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:10,164 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 356 flow. Second operand 6 states and 784 transitions. [2022-11-25 17:55:10,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 83 transitions, 669 flow [2022-11-25 17:55:10,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 649 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 17:55:10,188 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 461 flow [2022-11-25 17:55:10,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2022-11-25 17:55:10,191 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2022-11-25 17:55:10,191 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 461 flow [2022-11-25 17:55:10,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:10,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:10,192 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:10,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:55:10,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:10,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash 927164751, now seen corresponding path program 1 times [2022-11-25 17:55:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:10,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086511574] [2022-11-25 17:55:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:11,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086511574] [2022-11-25 17:55:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086511574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:11,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:11,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:55:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340001658] [2022-11-25 17:55:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:11,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:55:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:55:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:55:11,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 337 [2022-11-25 17:55:11,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 461 flow. Second operand has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:11,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:11,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 337 [2022-11-25 17:55:11,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:12,639 INFO L130 PetriNetUnfolder]: 1335/2298 cut-off events. [2022-11-25 17:55:12,639 INFO L131 PetriNetUnfolder]: For 4440/4450 co-relation queries the response was YES. [2022-11-25 17:55:12,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8274 conditions, 2298 events. 1335/2298 cut-off events. For 4440/4450 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13991 event pairs, 67 based on Foata normal form. 6/2288 useless extension candidates. Maximal degree in co-relation 8260. Up to 594 conditions per place. [2022-11-25 17:55:12,651 INFO L137 encePairwiseOnDemand]: 329/337 looper letters, 69 selfloop transitions, 19 changer transitions 3/98 dead transitions. [2022-11-25 17:55:12,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 772 flow [2022-11-25 17:55:12,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:55:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:55:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1128 transitions. [2022-11-25 17:55:12,656 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37190900098911966 [2022-11-25 17:55:12,656 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1128 transitions. [2022-11-25 17:55:12,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1128 transitions. [2022-11-25 17:55:12,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:12,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1128 transitions. [2022-11-25 17:55:12,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.33333333333333) internal successors, (1128), 9 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 337.0) internal successors, (3370), 10 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,667 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 337.0) internal successors, (3370), 10 states have internal predecessors, (3370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,668 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 461 flow. Second operand 9 states and 1128 transitions. [2022-11-25 17:55:12,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 772 flow [2022-11-25 17:55:12,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 755 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:55:12,701 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 444 flow [2022-11-25 17:55:12,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=444, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2022-11-25 17:55:12,703 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2022-11-25 17:55:12,703 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 444 flow [2022-11-25 17:55:12,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.66666666666667) internal successors, (1077), 9 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:12,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:12,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:55:12,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1888658234, now seen corresponding path program 1 times [2022-11-25 17:55:12,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:12,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962367461] [2022-11-25 17:55:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:12,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:12,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962367461] [2022-11-25 17:55:13,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962367461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:13,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:13,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845269677] [2022-11-25 17:55:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:13,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:13,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:13,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 337 [2022-11-25 17:55:13,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 444 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:13,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:13,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 337 [2022-11-25 17:55:13,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:14,025 INFO L130 PetriNetUnfolder]: 2668/4382 cut-off events. [2022-11-25 17:55:14,026 INFO L131 PetriNetUnfolder]: For 11958/12129 co-relation queries the response was YES. [2022-11-25 17:55:14,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16144 conditions, 4382 events. 2668/4382 cut-off events. For 11958/12129 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28155 event pairs, 635 based on Foata normal form. 84/4390 useless extension candidates. Maximal degree in co-relation 16128. Up to 1741 conditions per place. [2022-11-25 17:55:14,048 INFO L137 encePairwiseOnDemand]: 333/337 looper letters, 106 selfloop transitions, 7 changer transitions 0/119 dead transitions. [2022-11-25 17:55:14,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 119 transitions, 1225 flow [2022-11-25 17:55:14,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-11-25 17:55:14,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42952522255192876 [2022-11-25 17:55:14,053 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-11-25 17:55:14,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-11-25 17:55:14,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:14,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-11-25 17:55:14,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:14,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:14,060 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:14,061 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 444 flow. Second operand 4 states and 579 transitions. [2022-11-25 17:55:14,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 119 transitions, 1225 flow [2022-11-25 17:55:14,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 1155 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 17:55:14,124 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 483 flow [2022-11-25 17:55:14,124 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-11-25 17:55:14,125 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2022-11-25 17:55:14,125 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 483 flow [2022-11-25 17:55:14,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:14,126 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:14,126 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:14,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:55:14,127 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 927166685, now seen corresponding path program 1 times [2022-11-25 17:55:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551587031] [2022-11-25 17:55:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:14,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551587031] [2022-11-25 17:55:14,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551587031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:14,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702955020] [2022-11-25 17:55:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:14,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:14,344 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 337 [2022-11-25 17:55:14,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:14,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:14,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 337 [2022-11-25 17:55:14,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:15,133 INFO L130 PetriNetUnfolder]: 2181/3494 cut-off events. [2022-11-25 17:55:15,134 INFO L131 PetriNetUnfolder]: For 6252/6272 co-relation queries the response was YES. [2022-11-25 17:55:15,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12489 conditions, 3494 events. 2181/3494 cut-off events. For 6252/6272 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20657 event pairs, 1353 based on Foata normal form. 89/3580 useless extension candidates. Maximal degree in co-relation 12471. Up to 2753 conditions per place. [2022-11-25 17:55:15,145 INFO L137 encePairwiseOnDemand]: 326/337 looper letters, 18 selfloop transitions, 1 changer transitions 42/63 dead transitions. [2022-11-25 17:55:15,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 606 flow [2022-11-25 17:55:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2022-11-25 17:55:15,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3983679525222552 [2022-11-25 17:55:15,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2022-11-25 17:55:15,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2022-11-25 17:55:15,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:15,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2022-11-25 17:55:15,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,171 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 483 flow. Second operand 4 states and 537 transitions. [2022-11-25 17:55:15,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 606 flow [2022-11-25 17:55:15,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 575 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-25 17:55:15,226 INFO L231 Difference]: Finished difference. Result has 62 places, 21 transitions, 95 flow [2022-11-25 17:55:15,227 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=62, PETRI_TRANSITIONS=21} [2022-11-25 17:55:15,228 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2022-11-25 17:55:15,228 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 21 transitions, 95 flow [2022-11-25 17:55:15,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,229 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:15,229 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:15,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:55:15,230 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:15,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:15,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1831977854, now seen corresponding path program 1 times [2022-11-25 17:55:15,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:15,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561048652] [2022-11-25 17:55:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:15,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:16,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-11-25 17:55:16,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:16,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561048652] [2022-11-25 17:55:16,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561048652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:16,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:16,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:55:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969117556] [2022-11-25 17:55:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:16,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:55:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:16,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:55:16,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:55:16,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 337 [2022-11-25 17:55:16,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 21 transitions, 95 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:16,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:16,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 337 [2022-11-25 17:55:16,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:17,304 INFO L130 PetriNetUnfolder]: 226/402 cut-off events. [2022-11-25 17:55:17,305 INFO L131 PetriNetUnfolder]: For 407/407 co-relation queries the response was YES. [2022-11-25 17:55:17,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 402 events. 226/402 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1494 event pairs, 118 based on Foata normal form. 4/404 useless extension candidates. Maximal degree in co-relation 1116. Up to 276 conditions per place. [2022-11-25 17:55:17,307 INFO L137 encePairwiseOnDemand]: 330/337 looper letters, 31 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2022-11-25 17:55:17,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 231 flow [2022-11-25 17:55:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:55:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 723 transitions. [2022-11-25 17:55:17,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35756676557863504 [2022-11-25 17:55:17,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 723 transitions. [2022-11-25 17:55:17,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 723 transitions. [2022-11-25 17:55:17,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:17,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 723 transitions. [2022-11-25 17:55:17,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.5) internal successors, (723), 6 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:17,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:17,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:17,319 INFO L175 Difference]: Start difference. First operand has 62 places, 21 transitions, 95 flow. Second operand 6 states and 723 transitions. [2022-11-25 17:55:17,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 231 flow [2022-11-25 17:55:17,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 188 flow, removed 9 selfloop flow, removed 12 redundant places. [2022-11-25 17:55:17,323 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 113 flow [2022-11-25 17:55:17,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2022-11-25 17:55:17,324 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-11-25 17:55:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 113 flow [2022-11-25 17:55:17,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:17,325 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:17,325 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:17,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:55:17,326 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 401191314, now seen corresponding path program 2 times [2022-11-25 17:55:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:17,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191890450] [2022-11-25 17:55:17,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:18,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:18,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191890450] [2022-11-25 17:55:18,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191890450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:18,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:18,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:55:18,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947371594] [2022-11-25 17:55:18,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:18,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:55:18,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:18,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:55:18,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:55:19,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 337 [2022-11-25 17:55:19,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:19,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:19,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 337 [2022-11-25 17:55:19,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:19,596 INFO L130 PetriNetUnfolder]: 287/508 cut-off events. [2022-11-25 17:55:19,597 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-11-25 17:55:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 508 events. 287/508 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2065 event pairs, 56 based on Foata normal form. 4/512 useless extension candidates. Maximal degree in co-relation 1288. Up to 257 conditions per place. [2022-11-25 17:55:19,599 INFO L137 encePairwiseOnDemand]: 330/337 looper letters, 31 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2022-11-25 17:55:19,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 258 flow [2022-11-25 17:55:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:55:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:55:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions. [2022-11-25 17:55:19,603 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3582026282323018 [2022-11-25 17:55:19,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions. [2022-11-25 17:55:19,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions. [2022-11-25 17:55:19,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:19,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions. [2022-11-25 17:55:19,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:19,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 337.0) internal successors, (2696), 8 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:19,620 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 337.0) internal successors, (2696), 8 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:19,628 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 113 flow. Second operand 7 states and 845 transitions. [2022-11-25 17:55:19,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 258 flow [2022-11-25 17:55:19,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:55:19,630 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 183 flow [2022-11-25 17:55:19,630 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2022-11-25 17:55:19,630 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -12 predicate places. [2022-11-25 17:55:19,630 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 183 flow [2022-11-25 17:55:19,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:19,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:19,632 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:19,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:55:19,633 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:19,633 INFO L85 PathProgramCache]: Analyzing trace with hash 817242938, now seen corresponding path program 3 times [2022-11-25 17:55:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:19,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125204938] [2022-11-25 17:55:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:20,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125204938] [2022-11-25 17:55:20,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125204938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:20,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:20,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:55:20,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073943118] [2022-11-25 17:55:20,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:20,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:55:20,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:55:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:55:21,240 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 337 [2022-11-25 17:55:21,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 183 flow. Second operand has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:21,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 337 [2022-11-25 17:55:21,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:21,665 INFO L130 PetriNetUnfolder]: 279/495 cut-off events. [2022-11-25 17:55:21,666 INFO L131 PetriNetUnfolder]: For 292/292 co-relation queries the response was YES. [2022-11-25 17:55:21,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 495 events. 279/495 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2014 event pairs, 76 based on Foata normal form. 4/497 useless extension candidates. Maximal degree in co-relation 1375. Up to 290 conditions per place. [2022-11-25 17:55:21,669 INFO L137 encePairwiseOnDemand]: 331/337 looper letters, 30 selfloop transitions, 14 changer transitions 0/46 dead transitions. [2022-11-25 17:55:21,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 46 transitions, 310 flow [2022-11-25 17:55:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:55:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:55:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 958 transitions. [2022-11-25 17:55:21,673 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35534124629080116 [2022-11-25 17:55:21,673 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 958 transitions. [2022-11-25 17:55:21,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 958 transitions. [2022-11-25 17:55:21,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:21,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 958 transitions. [2022-11-25 17:55:21,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.75) internal successors, (958), 8 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 337.0) internal successors, (3033), 9 states have internal predecessors, (3033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,681 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 337.0) internal successors, (3033), 9 states have internal predecessors, (3033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,682 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 183 flow. Second operand 8 states and 958 transitions. [2022-11-25 17:55:21,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 46 transitions, 310 flow [2022-11-25 17:55:21,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 46 transitions, 293 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:21,684 INFO L231 Difference]: Finished difference. Result has 64 places, 34 transitions, 213 flow [2022-11-25 17:55:21,685 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=64, PETRI_TRANSITIONS=34} [2022-11-25 17:55:21,685 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -6 predicate places. [2022-11-25 17:55:21,685 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 34 transitions, 213 flow [2022-11-25 17:55:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:21,686 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:21,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:55:21,686 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:21,687 INFO L85 PathProgramCache]: Analyzing trace with hash -913865702, now seen corresponding path program 1 times [2022-11-25 17:55:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:21,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194204442] [2022-11-25 17:55:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:21,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:21,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194204442] [2022-11-25 17:55:21,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194204442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:21,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:21,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:21,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266445172] [2022-11-25 17:55:21,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:21,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:55:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:21,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:55:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:55:21,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 337 [2022-11-25 17:55:21,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 34 transitions, 213 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-11-25 17:55:21,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:21,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 337 [2022-11-25 17:55:21,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:22,047 INFO L130 PetriNetUnfolder]: 179/359 cut-off events. [2022-11-25 17:55:22,047 INFO L131 PetriNetUnfolder]: For 389/389 co-relation queries the response was YES. [2022-11-25 17:55:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 359 events. 179/359 cut-off events. For 389/389 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1536 event pairs, 48 based on Foata normal form. 11/365 useless extension candidates. Maximal degree in co-relation 1000. Up to 297 conditions per place. [2022-11-25 17:55:22,050 INFO L137 encePairwiseOnDemand]: 332/337 looper letters, 40 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-11-25 17:55:22,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 49 transitions, 374 flow [2022-11-25 17:55:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:55:22,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-11-25 17:55:22,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41641938674579626 [2022-11-25 17:55:22,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-11-25 17:55:22,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-11-25 17:55:22,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:22,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-11-25 17:55:22,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 337.0) internal successors, (1348), 4 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,057 INFO L175 Difference]: Start difference. First operand has 64 places, 34 transitions, 213 flow. Second operand 3 states and 421 transitions. [2022-11-25 17:55:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 49 transitions, 374 flow [2022-11-25 17:55:22,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 49 transitions, 336 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-25 17:55:22,059 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 208 flow [2022-11-25 17:55:22,060 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2022-11-25 17:55:22,060 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -8 predicate places. [2022-11-25 17:55:22,061 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 208 flow [2022-11-25 17:55:22,061 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-11-25 17:55:22,061 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:22,061 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:22,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:55:22,062 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:22,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1750199513, now seen corresponding path program 1 times [2022-11-25 17:55:22,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:22,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490281046] [2022-11-25 17:55:22,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:22,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490281046] [2022-11-25 17:55:22,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490281046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:22,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:22,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862557686] [2022-11-25 17:55:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:22,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:22,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 337 [2022-11-25 17:55:22,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:22,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 337 [2022-11-25 17:55:22,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:22,460 INFO L130 PetriNetUnfolder]: 111/249 cut-off events. [2022-11-25 17:55:22,460 INFO L131 PetriNetUnfolder]: For 352/363 co-relation queries the response was YES. [2022-11-25 17:55:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 249 events. 111/249 cut-off events. For 352/363 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1022 event pairs, 12 based on Foata normal form. 26/270 useless extension candidates. Maximal degree in co-relation 845. Up to 104 conditions per place. [2022-11-25 17:55:22,462 INFO L137 encePairwiseOnDemand]: 332/337 looper letters, 47 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-11-25 17:55:22,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 426 flow [2022-11-25 17:55:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2022-11-25 17:55:22,466 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4146884272997033 [2022-11-25 17:55:22,466 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2022-11-25 17:55:22,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2022-11-25 17:55:22,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:22,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2022-11-25 17:55:22,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 337.0) internal successors, (1685), 5 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,472 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 208 flow. Second operand 4 states and 559 transitions. [2022-11-25 17:55:22,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 426 flow [2022-11-25 17:55:22,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:55:22,475 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 244 flow [2022-11-25 17:55:22,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2022-11-25 17:55:22,476 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -5 predicate places. [2022-11-25 17:55:22,476 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 244 flow [2022-11-25 17:55:22,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,477 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:22,477 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-11-25 17:55:22,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:55:22,478 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:22,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1745154589, now seen corresponding path program 1 times [2022-11-25 17:55:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260742325] [2022-11-25 17:55:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:22,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:22,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260742325] [2022-11-25 17:55:22,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260742325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:22,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:22,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:55:22,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606164703] [2022-11-25 17:55:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:22,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:55:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:55:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:55:22,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 337 [2022-11-25 17:55:22,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 40 transitions, 244 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-11-25 17:55:22,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:22,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 337 [2022-11-25 17:55:22,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:22,915 INFO L130 PetriNetUnfolder]: 93/209 cut-off events. [2022-11-25 17:55:22,915 INFO L131 PetriNetUnfolder]: For 590/612 co-relation queries the response was YES. [2022-11-25 17:55:22,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 209 events. 93/209 cut-off events. For 590/612 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 event pairs, 9 based on Foata normal form. 25/229 useless extension candidates. Maximal degree in co-relation 800. Up to 95 conditions per place. [2022-11-25 17:55:22,917 INFO L137 encePairwiseOnDemand]: 332/337 looper letters, 44 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2022-11-25 17:55:22,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 450 flow [2022-11-25 17:55:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:55:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:55:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2022-11-25 17:55:22,921 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4089020771513353 [2022-11-25 17:55:22,921 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2022-11-25 17:55:22,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2022-11-25 17:55:22,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:22,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2022-11-25 17:55:22,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 337.0) internal successors, (2022), 6 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 337.0) internal successors, (2022), 6 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:22,930 INFO L175 Difference]: Start difference. First operand has 65 places, 40 transitions, 244 flow. Second operand 5 states and 689 transitions. [2022-11-25 17:55:22,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 450 flow [2022-11-25 17:55:22,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 417 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 17:55:22,933 INFO L231 Difference]: Finished difference. Result has 66 places, 40 transitions, 245 flow [2022-11-25 17:55:22,934 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=66, PETRI_TRANSITIONS=40} [2022-11-25 17:55:22,934 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2022-11-25 17:55:22,935 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 40 transitions, 245 flow [2022-11-25 17:55:22,935 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-11-25 17:55:22,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:22,936 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:22,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:55:22,937 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:55:22,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:22,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1977349660, now seen corresponding path program 1 times [2022-11-25 17:55:22,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:22,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494100671] [2022-11-25 17:55:22,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:55:23,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:55:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:55:23,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:55:23,192 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:55:23,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-25 17:55:23,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-25 17:55:23,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-25 17:55:23,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-25 17:55:23,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-25 17:55:23,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-25 17:55:23,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-25 17:55:23,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-25 17:55:23,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-25 17:55:23,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-25 17:55:23,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-25 17:55:23,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-25 17:55:23,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-25 17:55:23,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-25 17:55:23,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-25 17:55:23,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-25 17:55:23,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-25 17:55:23,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-25 17:55:23,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-25 17:55:23,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-25 17:55:23,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-25 17:55:23,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-25 17:55:23,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-25 17:55:23,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-25 17:55:23,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-25 17:55:23,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-25 17:55:23,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-25 17:55:23,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-25 17:55:23,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-25 17:55:23,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-25 17:55:23,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-25 17:55:23,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-25 17:55:23,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-25 17:55:23,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-25 17:55:23,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-25 17:55:23,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-25 17:55:23,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-25 17:55:23,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-25 17:55:23,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-25 17:55:23,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-25 17:55:23,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-25 17:55:23,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-25 17:55:23,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-25 17:55:23,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-25 17:55:23,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-25 17:55:23,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-25 17:55:23,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-25 17:55:23,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-25 17:55:23,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-25 17:55:23,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-25 17:55:23,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-25 17:55:23,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-25 17:55:23,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-25 17:55:23,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-25 17:55:23,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-25 17:55:23,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-25 17:55:23,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-25 17:55:23,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-25 17:55:23,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-25 17:55:23,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-25 17:55:23,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-25 17:55:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:55:23,214 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:23,224 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:55:23,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:55:23,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:55:23 BasicIcfg [2022-11-25 17:55:23,376 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:55:23,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:55:23,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:55:23,377 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:55:23,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:32" (3/4) ... [2022-11-25 17:55:23,380 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:55:23,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:55:23,381 INFO L158 Benchmark]: Toolchain (without parser) took 53168.19ms. Allocated memory was 140.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 94.2MB in the beginning and 1.0GB in the end (delta: -907.8MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,382 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:55:23,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.11ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 67.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.12ms. Allocated memory is still 140.5MB. Free memory was 67.4MB in the beginning and 65.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,386 INFO L158 Benchmark]: Boogie Preprocessor took 65.96ms. Allocated memory is still 140.5MB. Free memory was 65.3MB in the beginning and 63.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,386 INFO L158 Benchmark]: RCFGBuilder took 1797.22ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 63.2MB in the beginning and 99.3MB in the end (delta: -36.1MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,387 INFO L158 Benchmark]: TraceAbstraction took 50402.33ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 987.8MB). Free memory was 99.1MB in the beginning and 1.0GB in the end (delta: -904.0MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. [2022-11-25 17:55:23,387 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:55:23,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 104.9MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.11ms. Allocated memory is still 140.5MB. Free memory was 94.2MB in the beginning and 67.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.12ms. Allocated memory is still 140.5MB. Free memory was 67.4MB in the beginning and 65.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.96ms. Allocated memory is still 140.5MB. Free memory was 65.3MB in the beginning and 63.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1797.22ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 63.2MB in the beginning and 99.3MB in the end (delta: -36.1MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50402.33ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 987.8MB). Free memory was 99.1MB in the beginning and 1.0GB in the end (delta: -904.0MB). Peak memory consumption was 83.8MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. 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: 20.8s, 175 PlacesBefore, 70 PlacesAfterwards, 167 TransitionsBefore, 61 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 17240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8460, independent: 8124, independent conditional: 0, independent unconditional: 8124, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3402, independent: 3336, independent conditional: 0, independent unconditional: 3336, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3402, independent: 3110, independent conditional: 0, independent unconditional: 3110, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 292, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2149, independent: 1381, independent conditional: 0, independent unconditional: 1381, dependent: 709, dependent conditional: 0, dependent unconditional: 709, unknown: 59, unknown conditional: 0, unknown unconditional: 59] ], Cache Queries: [ total: 8460, independent: 4788, independent conditional: 0, independent unconditional: 4788, dependent: 264, dependent conditional: 0, dependent unconditional: 264, unknown: 3408, unknown conditional: 0, unknown unconditional: 3408] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 500, Positive conditional cache size: 0, Positive unconditional cache size: 500, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2 - 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_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=-2, t1937={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=-1, t1937={7:0}, t1938={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1939; 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t1939, ((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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 __unbuffered_p2_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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 z = 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937={7:0}, t1938={8:0}, t1939={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 216 locations, 61 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: 50.0s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2034 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1483 mSDsluCounter, 699 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3879 IncrementalHoareTripleChecker+Invalid, 4183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 180 mSDtfsCounter, 3879 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=14, InterpolantAutomatonStates: 92, 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.8s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 2550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:55:23,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/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 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_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:55:26,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:55:26,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:55:26,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:55:26,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:55:26,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:55:26,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:55:26,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:55:26,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:55:26,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:55:26,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:55:26,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:55:26,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:55:26,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:55:26,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:55:26,335 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:55:26,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:55:26,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:55:26,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:55:26,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:55:26,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:55:26,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:55:26,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:55:26,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:55:26,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:55:26,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:55:26,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:55:26,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:55:26,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:55:26,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:55:26,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:55:26,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:55:26,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:55:26,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:55:26,373 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:55:26,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:55:26,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:55:26,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:55:26,375 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:55:26,376 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:55:26,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:55:26,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:55:26,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:55:26,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:55:26,424 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:55:26,425 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:55:26,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:55:26,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:55:26,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:55:26,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:55:26,428 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:55:26,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:55:26,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:55:26,429 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:55:26,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:55:26,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:55:26,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:55:26,430 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:55:26,431 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:55:26,431 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:55:26,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:55:26,431 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:55:26,432 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:55:26,432 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:55:26,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:55:26,432 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:55:26,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:55:26,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:55:26,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:55:26,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:26,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:55:26,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:55:26,434 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:55:26,434 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:55:26,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:55:26,435 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:55:26,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:55:26,435 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:55:26,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_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51eb1f25b31a14b06f8a94357507f98faff1b5d262be3400ea1666eb362dde3f [2022-11-25 17:55:26,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:55:26,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:55:26,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:55:26,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:55:26,883 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:55:26,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:55:29,920 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:55:30,234 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:55:30,240 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:55:30,266 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/9c90f70ad/d21fd11bd7b64246840514ee97bfd6c5/FLAG47121f024 [2022-11-25 17:55:30,293 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/data/9c90f70ad/d21fd11bd7b64246840514ee97bfd6c5 [2022-11-25 17:55:30,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:55:30,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:55:30,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:30,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:55:30,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:55:30,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:30" (1/1) ... [2022-11-25 17:55:30,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64a057f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:30, skipping insertion in model container [2022-11-25 17:55:30,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:30" (1/1) ... [2022-11-25 17:55:30,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:55:30,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:55:30,676 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_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-11-25 17:55:30,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:30,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:30,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:30,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:30,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:30,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:30,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:30,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,002 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,004 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,010 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:31,062 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:55:31,083 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_0260726a-c566-4a51-8118-43fe99051156/sv-benchmarks/c/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i[1014,1027] [2022-11-25 17:55:31,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:31,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:31,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:31,199 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:55:31,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31 WrapperNode [2022-11-25 17:55:31,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:31,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:31,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:55:31,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:55:31,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,265 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2022-11-25 17:55:31,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:31,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:55:31,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:55:31,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:55:31,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,340 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:55:31,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:55:31,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:55:31,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:55:31,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (1/1) ... [2022-11-25 17:55:31,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:31,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:31,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:55:31,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:55:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:55:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:55:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:55:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:55:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:55:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:55:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:55:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 17:55:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:55:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:55:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:55:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:55:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:55:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:55:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:55:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:55:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:55:31,466 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:55:31,737 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:55:31,739 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:55:32,619 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:55:33,175 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:55:33,175 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:55:33,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:33 BoogieIcfgContainer [2022-11-25 17:55:33,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:55:33,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:55:33,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:55:33,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:55:33,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:55:30" (1/3) ... [2022-11-25 17:55:33,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5c44dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:33, skipping insertion in model container [2022-11-25 17:55:33,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:31" (2/3) ... [2022-11-25 17:55:33,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d5c44dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:33, skipping insertion in model container [2022-11-25 17:55:33,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:33" (3/3) ... [2022-11-25 17:55:33,208 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2022-11-25 17:55:33,230 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:55:33,231 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-11-25 17:55:33,231 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:55:33,396 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:55:33,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 171 transitions, 357 flow [2022-11-25 17:55:33,525 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2022-11-25 17:55:33,525 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:55:33,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 205 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-25 17:55:33,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 171 transitions, 357 flow [2022-11-25 17:55:33,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 168 transitions, 345 flow [2022-11-25 17:55:33,571 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:55:33,589 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 168 transitions, 345 flow [2022-11-25 17:55:33,593 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 168 transitions, 345 flow [2022-11-25 17:55:33,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 345 flow [2022-11-25 17:55:33,662 INFO L130 PetriNetUnfolder]: 2/168 cut-off events. [2022-11-25 17:55:33,662 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:55:33,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 2/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 204 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-25 17:55:33,668 INFO L119 LiptonReduction]: Number of co-enabled transitions 5336 [2022-11-25 17:55:53,768 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 197 DAG size of output: 193 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:55:59,950 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 225 DAG size of output: 221 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:56:18,995 INFO L134 LiptonReduction]: Checked pairs total: 17069 [2022-11-25 17:56:18,995 INFO L136 LiptonReduction]: Total number of compositions: 164 [2022-11-25 17:56:19,013 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:19,018 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;@183af39f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:19,018 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2022-11-25 17:56:19,020 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:56:19,020 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:19,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:19,021 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:56:19,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 952, now seen corresponding path program 1 times [2022-11-25 17:56:19,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093028290] [2022-11-25 17:56:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:19,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:19,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:19,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:19,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:56:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:19,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:56:19,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:19,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:19,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:19,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093028290] [2022-11-25 17:56:19,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093028290] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:19,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:19,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:56:19,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407555468] [2022-11-25 17:56:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:19,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:19,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:19,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 335 [2022-11-25 17:56:19,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:19,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:19,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 335 [2022-11-25 17:56:19,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:21,089 INFO L130 PetriNetUnfolder]: 3634/5311 cut-off events. [2022-11-25 17:56:21,089 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:21,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10628 conditions, 5311 events. 3634/5311 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 30899 event pairs, 3634 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 10617. Up to 5271 conditions per place. [2022-11-25 17:56:21,131 INFO L137 encePairwiseOnDemand]: 312/335 looper letters, 34 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-11-25 17:56:21,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 153 flow [2022-11-25 17:56:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:56:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:56:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions. [2022-11-25 17:56:21,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4880597014925373 [2022-11-25 17:56:21,153 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 327 transitions. [2022-11-25 17:56:21,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions. [2022-11-25 17:56:21,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:21,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions. [2022-11-25 17:56:21,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,174 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,176 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 2 states and 327 transitions. [2022-11-25 17:56:21,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 153 flow [2022-11-25 17:56:21,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:21,182 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2022-11-25 17:56:21,184 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 17:56:21,188 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:56:21,188 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2022-11-25 17:56:21,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:21,189 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:56:21,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:21,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:21,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:21,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 940024, now seen corresponding path program 1 times [2022-11-25 17:56:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:21,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99604114] [2022-11-25 17:56:21,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:21,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:21,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:21,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:56:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:21,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:21,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:21,714 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:56:21,715 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-11-25 17:56:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:21,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:21,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99604114] [2022-11-25 17:56:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99604114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:21,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:21,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:21,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676665271] [2022-11-25 17:56:21,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:21,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:21,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 335 [2022-11-25 17:56:21,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:21,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 335 [2022-11-25 17:56:21,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:22,955 INFO L130 PetriNetUnfolder]: 2262/3352 cut-off events. [2022-11-25 17:56:22,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:22,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6720 conditions, 3352 events. 2262/3352 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17794 event pairs, 1414 based on Foata normal form. 108/2372 useless extension candidates. Maximal degree in co-relation 6717. Up to 1787 conditions per place. [2022-11-25 17:56:22,978 INFO L137 encePairwiseOnDemand]: 327/335 looper letters, 40 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 17:56:22,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 180 flow [2022-11-25 17:56:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-25 17:56:22,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4388059701492537 [2022-11-25 17:56:22,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-25 17:56:22,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-25 17:56:22,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:22,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-25 17:56:22,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,990 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 441 transitions. [2022-11-25 17:56:22,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 180 flow [2022-11-25 17:56:22,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:22,993 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 92 flow [2022-11-25 17:56:22,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-25 17:56:22,994 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-11-25 17:56:22,994 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 92 flow [2022-11-25 17:56:22,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,996 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:22,996 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:56:23,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:23,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:23,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 940025, now seen corresponding path program 1 times [2022-11-25 17:56:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:23,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973080445] [2022-11-25 17:56:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:23,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:23,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:56:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:23,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:56:23,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:23,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:56:23,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 17:56:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:23,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:23,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973080445] [2022-11-25 17:56:23,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973080445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:23,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:23,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736722249] [2022-11-25 17:56:23,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:23,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:23,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:23,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 335 [2022-11-25 17:56:23,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:23,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:23,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 335 [2022-11-25 17:56:23,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:24,106 INFO L130 PetriNetUnfolder]: 1154/1768 cut-off events. [2022-11-25 17:56:24,107 INFO L131 PetriNetUnfolder]: For 102/126 co-relation queries the response was YES. [2022-11-25 17:56:24,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 1768 events. 1154/1768 cut-off events. For 102/126 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 8972 event pairs, 1154 based on Foata normal form. 0/1518 useless extension candidates. Maximal degree in co-relation 3799. Up to 1737 conditions per place. [2022-11-25 17:56:24,118 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 27 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2022-11-25 17:56:24,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 140 flow [2022-11-25 17:56:24,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-11-25 17:56:24,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4318407960199005 [2022-11-25 17:56:24,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-11-25 17:56:24,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-11-25 17:56:24,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:24,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-11-25 17:56:24,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,125 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 92 flow. Second operand 3 states and 434 transitions. [2022-11-25 17:56:24,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 140 flow [2022-11-25 17:56:24,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:24,128 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 82 flow [2022-11-25 17:56:24,129 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-11-25 17:56:24,130 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -27 predicate places. [2022-11-25 17:56:24,130 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 82 flow [2022-11-25 17:56:24,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:24,131 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:24,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:24,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:24,342 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:24,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1903980285, now seen corresponding path program 1 times [2022-11-25 17:56:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:24,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796299917] [2022-11-25 17:56:24,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:24,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:24,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:24,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:24,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:56:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:24,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:24,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:24,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:24,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:24,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796299917] [2022-11-25 17:56:24,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796299917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:24,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:24,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:56:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090602309] [2022-11-25 17:56:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:24,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:24,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:24,653 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 335 [2022-11-25 17:56:24,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:24,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 335 [2022-11-25 17:56:24,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:25,057 INFO L130 PetriNetUnfolder]: 588/991 cut-off events. [2022-11-25 17:56:25,058 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2022-11-25 17:56:25,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2113 conditions, 991 events. 588/991 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4880 event pairs, 191 based on Foata normal form. 12/859 useless extension candidates. Maximal degree in co-relation 2108. Up to 921 conditions per place. [2022-11-25 17:56:25,065 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-11-25 17:56:25,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 194 flow [2022-11-25 17:56:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2022-11-25 17:56:25,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43283582089552236 [2022-11-25 17:56:25,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2022-11-25 17:56:25,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2022-11-25 17:56:25,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:25,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2022-11-25 17:56:25,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,074 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,074 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 82 flow. Second operand 3 states and 435 transitions. [2022-11-25 17:56:25,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 194 flow [2022-11-25 17:56:25,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:56:25,076 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2022-11-25 17:56:25,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=81, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-11-25 17:56:25,077 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -25 predicate places. [2022-11-25 17:56:25,077 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2022-11-25 17:56:25,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,078 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:25,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:25,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:25,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:25,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -519109348, now seen corresponding path program 1 times [2022-11-25 17:56:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:25,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328979903] [2022-11-25 17:56:25,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:25,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:25,293 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:25,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:25,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:56:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:25,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:56:25,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:25,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:25,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:25,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328979903] [2022-11-25 17:56:25,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328979903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:25,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:25,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843026443] [2022-11-25 17:56:25,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:25,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:56:25,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:56:25,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:56:25,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 335 [2022-11-25 17:56:25,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 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-11-25 17:56:25,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:25,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 335 [2022-11-25 17:56:25,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:26,021 INFO L130 PetriNetUnfolder]: 161/336 cut-off events. [2022-11-25 17:56:26,021 INFO L131 PetriNetUnfolder]: For 60/62 co-relation queries the response was YES. [2022-11-25 17:56:26,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 336 events. 161/336 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1308 event pairs, 43 based on Foata normal form. 16/310 useless extension candidates. Maximal degree in co-relation 834. Up to 202 conditions per place. [2022-11-25 17:56:26,024 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-11-25 17:56:26,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 261 flow [2022-11-25 17:56:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:56:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:56:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2022-11-25 17:56:26,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4298507462686567 [2022-11-25 17:56:26,027 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2022-11-25 17:56:26,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2022-11-25 17:56:26,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:26,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2022-11-25 17:56:26,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,034 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 576 transitions. [2022-11-25 17:56:26,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 261 flow [2022-11-25 17:56:26,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:56:26,037 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2022-11-25 17:56:26,037 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-11-25 17:56:26,038 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -22 predicate places. [2022-11-25 17:56:26,038 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2022-11-25 17:56:26,039 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-11-25 17:56:26,039 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:26,039 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:26,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:26,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:26,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1899672846, now seen corresponding path program 1 times [2022-11-25 17:56:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:26,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131365665] [2022-11-25 17:56:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:26,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:26,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:26,256 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:26,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:56:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:26,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:56:26,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:26,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:26,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:26,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131365665] [2022-11-25 17:56:26,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131365665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:26,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:26,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:56:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578592206] [2022-11-25 17:56:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:26,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:26,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:26,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 335 [2022-11-25 17:56:26,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:26,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 335 [2022-11-25 17:56:26,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:26,991 INFO L130 PetriNetUnfolder]: 82/174 cut-off events. [2022-11-25 17:56:26,992 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-11-25 17:56:26,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 174 events. 82/174 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 529 event pairs, 24 based on Foata normal form. 7/174 useless extension candidates. Maximal degree in co-relation 499. Up to 70 conditions per place. [2022-11-25 17:56:26,993 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 37 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2022-11-25 17:56:26,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 263 flow [2022-11-25 17:56:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:56:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:56:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2022-11-25 17:56:26,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42029850746268654 [2022-11-25 17:56:26,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2022-11-25 17:56:26,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2022-11-25 17:56:26,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:26,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2022-11-25 17:56:27,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,005 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 704 transitions. [2022-11-25 17:56:27,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 263 flow [2022-11-25 17:56:27,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:27,008 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-11-25 17:56:27,008 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-25 17:56:27,009 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -24 predicate places. [2022-11-25 17:56:27,009 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-11-25 17:56:27,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:27,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:27,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:27,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:27,223 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash -645194148, now seen corresponding path program 1 times [2022-11-25 17:56:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:27,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710677818] [2022-11-25 17:56:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:27,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:27,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:56:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:27,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:56:27,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:27,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:27,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:27,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710677818] [2022-11-25 17:56:27,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710677818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:27,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:27,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440528113] [2022-11-25 17:56:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:27,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:56:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:27,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:56:27,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:56:27,709 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 335 [2022-11-25 17:56:27,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:27,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 335 [2022-11-25 17:56:27,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:27,958 INFO L130 PetriNetUnfolder]: 94/212 cut-off events. [2022-11-25 17:56:27,958 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2022-11-25 17:56:27,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 212 events. 94/212 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 809 event pairs, 13 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 589. Up to 139 conditions per place. [2022-11-25 17:56:27,960 INFO L137 encePairwiseOnDemand]: 332/335 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2022-11-25 17:56:27,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2022-11-25 17:56:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:56:27,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:56:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2022-11-25 17:56:27,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4126865671641791 [2022-11-25 17:56:27,963 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2022-11-25 17:56:27,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2022-11-25 17:56:27,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:27,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2022-11-25 17:56:27,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,968 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 553 transitions. [2022-11-25 17:56:27,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2022-11-25 17:56:27,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:27,971 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2022-11-25 17:56:27,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-11-25 17:56:27,972 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2022-11-25 17:56:27,973 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2022-11-25 17:56:27,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:27,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:27,973 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:27,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-25 17:56:28,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:28,187 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:28,188 INFO L85 PathProgramCache]: Analyzing trace with hash -782032035, now seen corresponding path program 1 times [2022-11-25 17:56:28,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:28,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809605029] [2022-11-25 17:56:28,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:28,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:28,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:28,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:28,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:56:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:28,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:28,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:28,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:28,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809605029] [2022-11-25 17:56:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809605029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:28,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:28,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:28,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822097322] [2022-11-25 17:56:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:28,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:28,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:28,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:28,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 335 [2022-11-25 17:56:28,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:28,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:28,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 335 [2022-11-25 17:56:28,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:29,114 INFO L130 PetriNetUnfolder]: 94/211 cut-off events. [2022-11-25 17:56:29,115 INFO L131 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-11-25 17:56:29,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 211 events. 94/211 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 801 event pairs, 13 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 570. Up to 141 conditions per place. [2022-11-25 17:56:29,123 INFO L137 encePairwiseOnDemand]: 332/335 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 17:56:29,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 245 flow [2022-11-25 17:56:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:56:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:56:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-25 17:56:29,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.417910447761194 [2022-11-25 17:56:29,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-25 17:56:29,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-25 17:56:29,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:29,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-25 17:56:29,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,133 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 560 transitions. [2022-11-25 17:56:29,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 245 flow [2022-11-25 17:56:29,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:29,137 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2022-11-25 17:56:29,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-11-25 17:56:29,140 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2022-11-25 17:56:29,140 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2022-11-25 17:56:29,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,141 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:29,141 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:29,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:29,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:29,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 758019744, now seen corresponding path program 1 times [2022-11-25 17:56:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:29,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54924240] [2022-11-25 17:56:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:29,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:29,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:29,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:29,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:56:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:29,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:56:29,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:29,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:29,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54924240] [2022-11-25 17:56:29,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54924240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:29,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:29,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559736430] [2022-11-25 17:56:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:29,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:29,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:29,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2022-11-25 17:56:29,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:29,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2022-11-25 17:56:29,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:30,062 INFO L130 PetriNetUnfolder]: 141/298 cut-off events. [2022-11-25 17:56:30,062 INFO L131 PetriNetUnfolder]: For 208/208 co-relation queries the response was YES. [2022-11-25 17:56:30,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 298 events. 141/298 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1258 event pairs, 12 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 840. Up to 110 conditions per place. [2022-11-25 17:56:30,064 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2022-11-25 17:56:30,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 433 flow [2022-11-25 17:56:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:56:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:56:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2022-11-25 17:56:30,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42388059701492536 [2022-11-25 17:56:30,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2022-11-25 17:56:30,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2022-11-25 17:56:30,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:30,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2022-11-25 17:56:30,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,074 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,074 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 710 transitions. [2022-11-25 17:56:30,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 433 flow [2022-11-25 17:56:30,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:30,077 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 125 flow [2022-11-25 17:56:30,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-11-25 17:56:30,078 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-11-25 17:56:30,078 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 125 flow [2022-11-25 17:56:30,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,079 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:30,079 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:30,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:30,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:30,294 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 860677044, now seen corresponding path program 2 times [2022-11-25 17:56:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:30,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185450143] [2022-11-25 17:56:30,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:56:30,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:30,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:30,297 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:30,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 17:56:30,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:56:30,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:56:30,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:56:30,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:30,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:30,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185450143] [2022-11-25 17:56:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185450143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:30,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:30,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735562817] [2022-11-25 17:56:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:30,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2022-11-25 17:56:30,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:30,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2022-11-25 17:56:30,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:31,062 INFO L130 PetriNetUnfolder]: 187/407 cut-off events. [2022-11-25 17:56:31,062 INFO L131 PetriNetUnfolder]: For 335/335 co-relation queries the response was YES. [2022-11-25 17:56:31,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 407 events. 187/407 cut-off events. For 335/335 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1829 event pairs, 13 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 1254. Up to 150 conditions per place. [2022-11-25 17:56:31,065 INFO L137 encePairwiseOnDemand]: 330/335 looper letters, 70 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2022-11-25 17:56:31,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 462 flow [2022-11-25 17:56:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:56:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:56:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2022-11-25 17:56:31,069 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.418407960199005 [2022-11-25 17:56:31,069 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2022-11-25 17:56:31,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2022-11-25 17:56:31,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:31,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2022-11-25 17:56:31,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,076 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 125 flow. Second operand 6 states and 841 transitions. [2022-11-25 17:56:31,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 462 flow [2022-11-25 17:56:31,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 452 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:31,081 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 159 flow [2022-11-25 17:56:31,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-11-25 17:56:31,083 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-11-25 17:56:31,084 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 159 flow [2022-11-25 17:56:31,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:31,085 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:31,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:31,299 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2022-11-25 17:56:31,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash 186841472, now seen corresponding path program 3 times [2022-11-25 17:56:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:31,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955808739] [2022-11-25 17:56:31,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:56:31,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:31,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:31,302 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:31,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:56:31,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:56:31,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:56:31,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:56:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:31,902 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:56:31,902 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:56:31,903 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2022-11-25 17:56:31,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2022-11-25 17:56:31,905 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2022-11-25 17:56:31,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2022-11-25 17:56:31,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2022-11-25 17:56:31,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2022-11-25 17:56:31,906 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2022-11-25 17:56:31,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2022-11-25 17:56:31,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2022-11-25 17:56:31,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2022-11-25 17:56:31,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2022-11-25 17:56:31,907 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2022-11-25 17:56:31,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2022-11-25 17:56:31,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2022-11-25 17:56:31,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2022-11-25 17:56:31,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2022-11-25 17:56:31,908 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2022-11-25 17:56:31,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2022-11-25 17:56:31,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2022-11-25 17:56:31,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2022-11-25 17:56:31,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2022-11-25 17:56:31,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2022-11-25 17:56:31,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2022-11-25 17:56:31,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2022-11-25 17:56:31,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2022-11-25 17:56:31,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2022-11-25 17:56:31,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2022-11-25 17:56:31,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2022-11-25 17:56:31,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2022-11-25 17:56:31,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2022-11-25 17:56:31,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2022-11-25 17:56:31,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2022-11-25 17:56:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2022-11-25 17:56:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2022-11-25 17:56:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2022-11-25 17:56:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2022-11-25 17:56:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2022-11-25 17:56:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2022-11-25 17:56:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2022-11-25 17:56:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2022-11-25 17:56:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2022-11-25 17:56:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2022-11-25 17:56:31,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2022-11-25 17:56:31,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2022-11-25 17:56:31,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2022-11-25 17:56:31,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2022-11-25 17:56:31,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2022-11-25 17:56:31,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2022-11-25 17:56:31,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2022-11-25 17:56:31,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2022-11-25 17:56:31,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2022-11-25 17:56:31,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2022-11-25 17:56:31,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2022-11-25 17:56:31,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2022-11-25 17:56:31,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2022-11-25 17:56:31,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2022-11-25 17:56:31,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2022-11-25 17:56:31,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2022-11-25 17:56:31,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2022-11-25 17:56:31,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2022-11-25 17:56:31,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2022-11-25 17:56:31,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:32,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:32,132 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:32,137 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:56:32,138 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:56:32,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:56:32 BasicIcfg [2022-11-25 17:56:32,224 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:56:32,225 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:56:32,225 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:56:32,225 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:56:32,226 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:33" (3/4) ... [2022-11-25 17:56:32,229 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:56:32,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:56:32,229 INFO L158 Benchmark]: Toolchain (without parser) took 61931.21ms. Allocated memory was 81.8MB in the beginning and 310.4MB in the end (delta: 228.6MB). Free memory was 37.2MB in the beginning and 155.6MB in the end (delta: -118.4MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,230 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 81.8MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:56:32,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 898.35ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.3MB in the end (delta: 676.2kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.74ms. Allocated memory is still 81.8MB. Free memory was 36.3MB in the beginning and 33.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,231 INFO L158 Benchmark]: Boogie Preprocessor took 82.46ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 33.6MB in the beginning and 92.5MB in the end (delta: -58.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,231 INFO L158 Benchmark]: RCFGBuilder took 1829.15ms. Allocated memory is still 115.3MB. Free memory was 92.5MB in the beginning and 42.4MB in the end (delta: 50.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,232 INFO L158 Benchmark]: TraceAbstraction took 59024.45ms. Allocated memory was 115.3MB in the beginning and 310.4MB in the end (delta: 195.0MB). Free memory was 88.0MB in the beginning and 156.7MB in the end (delta: -68.6MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2022-11-25 17:56:32,232 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 310.4MB. Free memory was 156.7MB in the beginning and 155.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:56:32,234 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.37ms. Allocated memory is still 81.8MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 898.35ms. Allocated memory is still 81.8MB. Free memory was 36.9MB in the beginning and 36.3MB in the end (delta: 676.2kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.74ms. Allocated memory is still 81.8MB. Free memory was 36.3MB in the beginning and 33.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.46ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 33.6MB in the beginning and 92.5MB in the end (delta: -58.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1829.15ms. Allocated memory is still 115.3MB. Free memory was 92.5MB in the beginning and 42.4MB in the end (delta: 50.0MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 59024.45ms. Allocated memory was 115.3MB in the beginning and 310.4MB in the end (delta: 195.0MB). Free memory was 88.0MB in the beginning and 156.7MB in the end (delta: -68.6MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 310.4MB. Free memory was 156.7MB in the beginning and 155.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.4s, 176 PlacesBefore, 70 PlacesAfterwards, 168 TransitionsBefore, 61 TransitionsAfterwards, 5336 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 164 TotalNumberOfCompositions, 17069 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7649, independent: 7320, independent conditional: 0, independent unconditional: 7320, dependent: 318, dependent conditional: 0, dependent unconditional: 318, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3354, independent: 3284, independent conditional: 0, independent unconditional: 3284, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3354, independent: 3061, independent conditional: 0, independent unconditional: 3061, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 293, independent: 223, independent conditional: 0, independent unconditional: 223, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4317, independent: 1788, independent conditional: 0, independent unconditional: 1788, dependent: 2313, dependent conditional: 0, dependent unconditional: 2313, unknown: 217, unknown conditional: 0, unknown unconditional: 217] ], Cache Queries: [ total: 7649, independent: 4036, independent conditional: 0, independent unconditional: 4036, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 3361, unknown conditional: 0, unknown unconditional: 3361] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3 - 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_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t1937; [L838] FCALL, FORK 0 pthread_create(&t1937, ((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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1937, ((void *)0), P0, ((void *)0))=0, t1937={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1938; [L840] FCALL, FORK 0 pthread_create(&t1938, ((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=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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1938, ((void *)0), P1, ((void *)0))=1, t1937={-2147483642:0}, t1938={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 pthread_t t1939; 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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1937={-2147483642:0}, t1938={6:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t1939, ((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=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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1939, ((void *)0), P2, ((void *)0))=2, t1937={-2147483642:0}, t1938={6:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$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_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 __unbuffered_p1_EAX = x 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 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_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = y 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 z = 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1937={-2147483642:0}, t1938={6:0}, t1939={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L859] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 217 locations, 61 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: 58.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 12 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=10, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 554 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1374 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:56:32,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0260726a-c566-4a51-8118-43fe99051156/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample