./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/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 d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --- 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:33:47,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:33:47,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:33:47,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:33:47,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:33:48,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:33:48,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:33:48,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:33:48,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:33:48,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:33:48,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:33:48,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:33:48,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:33:48,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:33:48,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:33:48,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:33:48,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:33:48,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:33:48,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:33:48,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:33:48,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:33:48,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:33:48,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:33:48,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:33:48,057 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:33:48,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:33:48,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:33:48,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:33:48,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:33:48,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:33:48,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:33:48,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:33:48,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:33:48,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:33:48,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:33:48,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:33:48,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:33:48,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:33:48,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:33:48,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:33:48,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:33:48,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:33:48,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:33:48,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:33:48,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:33:48,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:33:48,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:33:48,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:33:48,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:33:48,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:33:48,094 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:33:48,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:33:48,095 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:33:48,096 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:33:48,096 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:33:48,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:33:48,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:33:48,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:33:48,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:33:48,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:33:48,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:33:48,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:33:48,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:33:48,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:33:48,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:33:48,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:33:48,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:33:48,098 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:33:48,099 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:33:48,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:33:48,099 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_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 [2022-11-25 17:33:48,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:33:48,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:33:48,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:33:48,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:33:48,467 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:33:48,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:33:51,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:33:52,126 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:33:52,126 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:33:52,142 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/256eb7bde/c1e2c3820b4a411aa14dcbe72aa135a3/FLAG6498dc80b [2022-11-25 17:33:52,158 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/256eb7bde/c1e2c3820b4a411aa14dcbe72aa135a3 [2022-11-25 17:33:52,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:33:52,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:33:52,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:33:52,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:33:52,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:33:52,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:52,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435a9db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52, skipping insertion in model container [2022-11-25 17:33:52,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:52,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:33:52,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:33:52,416 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_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-25 17:33:52,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:33:52,780 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:33:52,800 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_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-25 17:33:52,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:33:52,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:33:52,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:33:52,919 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:33:52,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52 WrapperNode [2022-11-25 17:33:52,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:33:52,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:33:52,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:33:52,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:33:52,930 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:33:52" (1/1) ... [2022-11-25 17:33:52,947 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:33:52" (1/1) ... [2022-11-25 17:33:52,974 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-25 17:33:52,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:33:52,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:33:52,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:33:52,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:33:52,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:52,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:52,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:52,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,025 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:33:53,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:33:53,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:33:53,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:33:53,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (1/1) ... [2022-11-25 17:33:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:33:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:33:53,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:33:53,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:33:53,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:33:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:33:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:33:53,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:33:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:33:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:33:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:33:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:33:53,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:33:53,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:33:53,143 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:33:53,143 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:33:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:33:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:33:53,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:33:53,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:33:53,147 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:33:53,387 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:33:53,389 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:33:54,039 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:33:54,412 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:33:54,412 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:33:54,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:54 BoogieIcfgContainer [2022-11-25 17:33:54,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:33:54,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:33:54,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:33:54,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:33:54,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:33:52" (1/3) ... [2022-11-25 17:33:54,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c43849c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:33:54, skipping insertion in model container [2022-11-25 17:33:54,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:33:52" (2/3) ... [2022-11-25 17:33:54,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c43849c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:33:54, skipping insertion in model container [2022-11-25 17:33:54,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:54" (3/3) ... [2022-11-25 17:33:54,427 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:33:54,456 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:33:54,456 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-25 17:33:54,457 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:33:54,642 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:33:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 347 flow [2022-11-25 17:33:54,792 INFO L130 PetriNetUnfolder]: 2/163 cut-off events. [2022-11-25 17:33:54,792 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:33:54,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 2/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 17:33:54,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 166 transitions, 347 flow [2022-11-25 17:33:54,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 163 transitions, 335 flow [2022-11-25 17:33:54,811 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:33:54,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 163 transitions, 335 flow [2022-11-25 17:33:54,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 163 transitions, 335 flow [2022-11-25 17:33:54,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 335 flow [2022-11-25 17:33:54,889 INFO L130 PetriNetUnfolder]: 2/163 cut-off events. [2022-11-25 17:33:54,890 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:33:54,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 2/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 17:33:54,895 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-11-25 17:34:26,663 INFO L134 LiptonReduction]: Checked pairs total: 16482 [2022-11-25 17:34:26,664 INFO L136 LiptonReduction]: Total number of compositions: 160 [2022-11-25 17:34:26,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:34:26,689 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;@5863637e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:34:26,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-25 17:34:26,691 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:34:26,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:34:26,692 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:26,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:34:26,693 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 835, now seen corresponding path program 1 times [2022-11-25 17:34:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:26,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239373257] [2022-11-25 17:34:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:26,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239373257] [2022-11-25 17:34:26,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239373257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:26,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:26,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:34:26,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320398756] [2022-11-25 17:34:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:26,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:34:26,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:26,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:34:26,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:34:26,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 326 [2022-11-25 17:34:26,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 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:34:26,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:26,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 326 [2022-11-25 17:34:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:28,214 INFO L130 PetriNetUnfolder]: 3608/5430 cut-off events. [2022-11-25 17:34:28,214 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 17:34:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10701 conditions, 5430 events. 3608/5430 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 32869 event pairs, 3608 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 10690. Up to 5225 conditions per place. [2022-11-25 17:34:28,260 INFO L137 encePairwiseOnDemand]: 307/326 looper letters, 32 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-11-25 17:34:28,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 149 flow [2022-11-25 17:34:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:34:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:34:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2022-11-25 17:34:28,277 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4892638036809816 [2022-11-25 17:34:28,278 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2022-11-25 17:34:28,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2022-11-25 17:34:28,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:28,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2022-11-25 17:34:28,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have 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:34:28,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have 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:34:28,292 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have 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:34:28,294 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 319 transitions. [2022-11-25 17:34:28,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 149 flow [2022-11-25 17:34:28,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:34:28,300 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2022-11-25 17:34:28,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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:34:28,306 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2022-11-25 17:34:28,306 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2022-11-25 17:34:28,306 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:34:28,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:28,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:34:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:34:28,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 824023, now seen corresponding path program 1 times [2022-11-25 17:34:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115829566] [2022-11-25 17:34:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:28,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:34:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115829566] [2022-11-25 17:34:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115829566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:28,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:28,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:34:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030205677] [2022-11-25 17:34:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:28,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:28,724 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 326 [2022-11-25 17:34:28,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:28,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:28,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 326 [2022-11-25 17:34:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:29,555 INFO L130 PetriNetUnfolder]: 2242/3364 cut-off events. [2022-11-25 17:34:29,555 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:34:29,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6696 conditions, 3364 events. 2242/3364 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 18270 event pairs, 1394 based on Foata normal form. 108/2388 useless extension candidates. Maximal degree in co-relation 6693. Up to 1751 conditions per place. [2022-11-25 17:34:29,578 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 38 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 17:34:29,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 176 flow [2022-11-25 17:34:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-25 17:34:29,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4458077709611452 [2022-11-25 17:34:29,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-25 17:34:29,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-25 17:34:29,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:29,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-25 17:34:29,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:29,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:29,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:29,591 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 436 transitions. [2022-11-25 17:34:29,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 176 flow [2022-11-25 17:34:29,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:34:29,593 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 92 flow [2022-11-25 17:34:29,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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:34:29,594 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-11-25 17:34:29,594 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 92 flow [2022-11-25 17:34:29,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:29,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:29,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:34:29,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:34:29,596 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:29,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 824024, now seen corresponding path program 1 times [2022-11-25 17:34:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:29,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668986084] [2022-11-25 17:34:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:29,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:29,859 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:34:29,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:29,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668986084] [2022-11-25 17:34:29,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668986084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:29,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:29,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:34:29,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421908435] [2022-11-25 17:34:29,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:29,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:29,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:29,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:29,949 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 326 [2022-11-25 17:34:29,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 92 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:34:29,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:29,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 326 [2022-11-25 17:34:29,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:30,413 INFO L130 PetriNetUnfolder]: 1140/1760 cut-off events. [2022-11-25 17:34:30,414 INFO L131 PetriNetUnfolder]: For 105/129 co-relation queries the response was YES. [2022-11-25 17:34:30,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1760 events. 1140/1760 cut-off events. For 105/129 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9019 event pairs, 1140 based on Foata normal form. 0/1492 useless extension candidates. Maximal degree in co-relation 3765. Up to 1711 conditions per place. [2022-11-25 17:34:30,427 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 25 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2022-11-25 17:34:30,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 136 flow [2022-11-25 17:34:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-11-25 17:34:30,435 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43558282208588955 [2022-11-25 17:34:30,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-11-25 17:34:30,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-11-25 17:34:30,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:30,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-11-25 17:34:30,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:30,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:30,443 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:30,443 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 92 flow. Second operand 3 states and 426 transitions. [2022-11-25 17:34:30,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 136 flow [2022-11-25 17:34:30,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:30,448 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 82 flow [2022-11-25 17:34:30,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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:34:30,450 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -23 predicate places. [2022-11-25 17:34:30,450 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 82 flow [2022-11-25 17:34:30,451 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:34:30,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:30,451 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:30,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:34:30,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 58056163, now seen corresponding path program 1 times [2022-11-25 17:34:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:30,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122544697] [2022-11-25 17:34:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:30,633 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:34:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:30,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122544697] [2022-11-25 17:34:30,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122544697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:30,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:30,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:34:30,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050426397] [2022-11-25 17:34:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:30,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:30,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:30,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:30,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 326 [2022-11-25 17:34:30,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:30,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:30,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 326 [2022-11-25 17:34:30,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:31,103 INFO L130 PetriNetUnfolder]: 1082/1677 cut-off events. [2022-11-25 17:34:31,103 INFO L131 PetriNetUnfolder]: For 96/120 co-relation queries the response was YES. [2022-11-25 17:34:31,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3569 conditions, 1677 events. 1082/1677 cut-off events. For 96/120 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 8564 event pairs, 942 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 3564. Up to 1059 conditions per place. [2022-11-25 17:34:31,117 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 43 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-11-25 17:34:31,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 219 flow [2022-11-25 17:34:31,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-11-25 17:34:31,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4560327198364008 [2022-11-25 17:34:31,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-11-25 17:34:31,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-11-25 17:34:31,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:31,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-11-25 17:34:31,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have 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:34:31,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:31,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:31,129 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 82 flow. Second operand 3 states and 446 transitions. [2022-11-25 17:34:31,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 219 flow [2022-11-25 17:34:31,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:34:31,134 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 91 flow [2022-11-25 17:34:31,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=3, PETRI_FLOW=91, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 17:34:31,137 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2022-11-25 17:34:31,137 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 91 flow [2022-11-25 17:34:31,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:31,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:31,138 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:31,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:34:31,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:31,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 247877001, now seen corresponding path program 1 times [2022-11-25 17:34:31,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:31,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561856501] [2022-11-25 17:34:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:31,473 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:34:31,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:31,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561856501] [2022-11-25 17:34:31,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561856501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:31,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:31,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:31,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041935941] [2022-11-25 17:34:31,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:31,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:31,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 326 [2022-11-25 17:34:31,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:34:31,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:31,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 326 [2022-11-25 17:34:31,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:32,083 INFO L130 PetriNetUnfolder]: 1036/1719 cut-off events. [2022-11-25 17:34:32,084 INFO L131 PetriNetUnfolder]: For 253/289 co-relation queries the response was YES. [2022-11-25 17:34:32,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3841 conditions, 1719 events. 1036/1719 cut-off events. For 253/289 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 10097 event pairs, 364 based on Foata normal form. 3/1553 useless extension candidates. Maximal degree in co-relation 3835. Up to 988 conditions per place. [2022-11-25 17:34:32,097 INFO L137 encePairwiseOnDemand]: 324/326 looper letters, 43 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2022-11-25 17:34:32,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 222 flow [2022-11-25 17:34:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:32,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-11-25 17:34:32,100 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4325153374233129 [2022-11-25 17:34:32,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-11-25 17:34:32,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-11-25 17:34:32,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:32,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-11-25 17:34:32,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have 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:34:32,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:32,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:32,106 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 91 flow. Second operand 3 states and 423 transitions. [2022-11-25 17:34:32,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 222 flow [2022-11-25 17:34:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:32,108 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 85 flow [2022-11-25 17:34:32,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-11-25 17:34:32,109 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2022-11-25 17:34:32,110 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 85 flow [2022-11-25 17:34:32,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:34:32,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:32,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:32,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:34:32,111 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:32,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1799739716, now seen corresponding path program 1 times [2022-11-25 17:34:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:32,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702634883] [2022-11-25 17:34:32,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:32,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:32,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702634883] [2022-11-25 17:34:32,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702634883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:32,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:32,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:34:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497226906] [2022-11-25 17:34:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:32,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:32,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:32,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:32,504 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 326 [2022-11-25 17:34:32,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:32,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:32,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 326 [2022-11-25 17:34:32,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:33,099 INFO L130 PetriNetUnfolder]: 1533/2522 cut-off events. [2022-11-25 17:34:33,099 INFO L131 PetriNetUnfolder]: For 289/337 co-relation queries the response was YES. [2022-11-25 17:34:33,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5512 conditions, 2522 events. 1533/2522 cut-off events. For 289/337 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 15718 event pairs, 746 based on Foata normal form. 27/2288 useless extension candidates. Maximal degree in co-relation 5506. Up to 1424 conditions per place. [2022-11-25 17:34:33,122 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 41 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-25 17:34:33,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 224 flow [2022-11-25 17:34:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:34:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2022-11-25 17:34:33,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4279141104294479 [2022-11-25 17:34:33,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2022-11-25 17:34:33,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2022-11-25 17:34:33,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:33,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2022-11-25 17:34:33,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have 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:34:33,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:33,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:33,133 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 85 flow. Second operand 4 states and 558 transitions. [2022-11-25 17:34:33,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 224 flow [2022-11-25 17:34:33,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:34:33,136 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 105 flow [2022-11-25 17:34:33,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-11-25 17:34:33,139 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-11-25 17:34:33,139 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 105 flow [2022-11-25 17:34:33,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:33,140 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:33,140 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:33,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:34:33,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 716458046, now seen corresponding path program 2 times [2022-11-25 17:34:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:33,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697050870] [2022-11-25 17:34:33,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:33,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:33,433 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:34:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:33,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697050870] [2022-11-25 17:34:33,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697050870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:33,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:33,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:33,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284265551] [2022-11-25 17:34:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:33,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:33,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:33,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:33,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:33,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 326 [2022-11-25 17:34:33,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have 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:34:33,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:33,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 326 [2022-11-25 17:34:33,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:34,106 INFO L130 PetriNetUnfolder]: 1487/2337 cut-off events. [2022-11-25 17:34:34,106 INFO L131 PetriNetUnfolder]: For 599/635 co-relation queries the response was YES. [2022-11-25 17:34:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2337 events. 1487/2337 cut-off events. For 599/635 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13156 event pairs, 1166 based on Foata normal form. 24/2106 useless extension candidates. Maximal degree in co-relation 5400. Up to 1693 conditions per place. [2022-11-25 17:34:34,124 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 42 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-11-25 17:34:34,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 234 flow [2022-11-25 17:34:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:34:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-25 17:34:34,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4294478527607362 [2022-11-25 17:34:34,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-25 17:34:34,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-25 17:34:34,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:34,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-25 17:34:34,130 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:34:34,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:34,134 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:34,134 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 105 flow. Second operand 4 states and 560 transitions. [2022-11-25 17:34:34,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 234 flow [2022-11-25 17:34:34,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:34:34,137 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 96 flow [2022-11-25 17:34:34,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=96, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-11-25 17:34:34,139 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2022-11-25 17:34:34,139 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 96 flow [2022-11-25 17:34:34,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have 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:34:34,140 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:34,140 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:34,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:34:34,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:34,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:34,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1799741809, now seen corresponding path program 1 times [2022-11-25 17:34:34,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:34,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251790391] [2022-11-25 17:34:34,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:34,321 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:34:34,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:34,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251790391] [2022-11-25 17:34:34,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251790391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:34,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:34,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:34:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729569215] [2022-11-25 17:34:34,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:34,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:34,329 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 326 [2022-11-25 17:34:34,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 96 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:34:34,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:34,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 326 [2022-11-25 17:34:34,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:34,881 INFO L130 PetriNetUnfolder]: 1440/2269 cut-off events. [2022-11-25 17:34:34,881 INFO L131 PetriNetUnfolder]: For 528/564 co-relation queries the response was YES. [2022-11-25 17:34:34,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 2269 events. 1440/2269 cut-off events. For 528/564 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12637 event pairs, 926 based on Foata normal form. 0/2033 useless extension candidates. Maximal degree in co-relation 5245. Up to 1651 conditions per place. [2022-11-25 17:34:34,896 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 42 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-11-25 17:34:34,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 238 flow [2022-11-25 17:34:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 17:34:34,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44785276073619634 [2022-11-25 17:34:34,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 17:34:34,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 17:34:34,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:34,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 17:34:34,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:34,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:34,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:34,904 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 96 flow. Second operand 3 states and 438 transitions. [2022-11-25 17:34:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 238 flow [2022-11-25 17:34:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:34,908 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 101 flow [2022-11-25 17:34:34,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=3, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-11-25 17:34:34,911 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-11-25 17:34:34,911 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 101 flow [2022-11-25 17:34:34,912 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:34:34,912 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:34,912 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:34,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:34:34,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:34,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:34,918 INFO L85 PathProgramCache]: Analyzing trace with hash -615558116, now seen corresponding path program 1 times [2022-11-25 17:34:34,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:34,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273041858] [2022-11-25 17:34:34,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:35,151 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:34:35,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273041858] [2022-11-25 17:34:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273041858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:35,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:34:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370021892] [2022-11-25 17:34:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:35,157 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 326 [2022-11-25 17:34:35,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:34:35,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:35,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 326 [2022-11-25 17:34:35,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:35,622 INFO L130 PetriNetUnfolder]: 1421/2392 cut-off events. [2022-11-25 17:34:35,622 INFO L131 PetriNetUnfolder]: For 531/531 co-relation queries the response was YES. [2022-11-25 17:34:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5883 conditions, 2392 events. 1421/2392 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 14813 event pairs, 212 based on Foata normal form. 10/2215 useless extension candidates. Maximal degree in co-relation 5876. Up to 1794 conditions per place. [2022-11-25 17:34:35,639 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2022-11-25 17:34:35,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 211 flow [2022-11-25 17:34:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:34:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-25 17:34:35,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4427402862985685 [2022-11-25 17:34:35,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-25 17:34:35,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-25 17:34:35,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:35,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-25 17:34:35,644 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:34:35,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:35,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:34:35,647 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 101 flow. Second operand 3 states and 433 transitions. [2022-11-25 17:34:35,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 211 flow [2022-11-25 17:34:35,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:35,649 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 105 flow [2022-11-25 17:34:35,649 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=3, PETRI_FLOW=105, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2022-11-25 17:34:35,650 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -18 predicate places. [2022-11-25 17:34:35,650 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 105 flow [2022-11-25 17:34:35,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have 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:34:35,651 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:35,651 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:35,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:34:35,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:35,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1758436058, now seen corresponding path program 1 times [2022-11-25 17:34:35,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694709449] [2022-11-25 17:34:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:35,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:35,804 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:34:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:35,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694709449] [2022-11-25 17:34:35,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694709449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:35,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:34:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025142437] [2022-11-25 17:34:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:35,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:35,815 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 326 [2022-11-25 17:34:35,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:35,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:35,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 326 [2022-11-25 17:34:35,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:36,635 INFO L130 PetriNetUnfolder]: 2587/4117 cut-off events. [2022-11-25 17:34:36,635 INFO L131 PetriNetUnfolder]: For 870/935 co-relation queries the response was YES. [2022-11-25 17:34:36,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10124 conditions, 4117 events. 2587/4117 cut-off events. For 870/935 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 26293 event pairs, 852 based on Foata normal form. 45/3786 useless extension candidates. Maximal degree in co-relation 10116. Up to 1456 conditions per place. [2022-11-25 17:34:36,663 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 57 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2022-11-25 17:34:36,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 322 flow [2022-11-25 17:34:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:34:36,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-11-25 17:34:36,667 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44401840490797545 [2022-11-25 17:34:36,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-11-25 17:34:36,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-11-25 17:34:36,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:36,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-11-25 17:34:36,669 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:34:36,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:36,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:36,673 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 105 flow. Second operand 4 states and 579 transitions. [2022-11-25 17:34:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 322 flow [2022-11-25 17:34:36,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:36,675 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 120 flow [2022-11-25 17:34:36,676 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2022-11-25 17:34:36,677 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -15 predicate places. [2022-11-25 17:34:36,677 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 120 flow [2022-11-25 17:34:36,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:36,678 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:36,678 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:36,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:34:36,678 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:36,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1319947593, now seen corresponding path program 1 times [2022-11-25 17:34:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:36,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403108519] [2022-11-25 17:34:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:36,887 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:34:36,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:36,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403108519] [2022-11-25 17:34:36,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403108519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:36,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:36,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:36,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585064038] [2022-11-25 17:34:36,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:36,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:36,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:36,915 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 326 [2022-11-25 17:34:36,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 120 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:34:36,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:36,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 326 [2022-11-25 17:34:36,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:37,438 INFO L130 PetriNetUnfolder]: 1295/2237 cut-off events. [2022-11-25 17:34:37,438 INFO L131 PetriNetUnfolder]: For 586/631 co-relation queries the response was YES. [2022-11-25 17:34:37,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5771 conditions, 2237 events. 1295/2237 cut-off events. For 586/631 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 14054 event pairs, 451 based on Foata normal form. 99/2142 useless extension candidates. Maximal degree in co-relation 5761. Up to 1920 conditions per place. [2022-11-25 17:34:37,452 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 36 selfloop transitions, 4 changer transitions 17/63 dead transitions. [2022-11-25 17:34:37,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 340 flow [2022-11-25 17:34:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:34:37,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:34:37,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-11-25 17:34:37,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41840490797546015 [2022-11-25 17:34:37,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2022-11-25 17:34:37,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2022-11-25 17:34:37,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:37,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2022-11-25 17:34:37,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have 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:34:37,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have 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:34:37,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have 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:34:37,462 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 120 flow. Second operand 5 states and 682 transitions. [2022-11-25 17:34:37,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 340 flow [2022-11-25 17:34:37,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 326 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 17:34:37,465 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 148 flow [2022-11-25 17:34:37,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2022-11-25 17:34:37,465 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2022-11-25 17:34:37,466 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 148 flow [2022-11-25 17:34:37,466 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:34:37,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:37,466 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:37,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:34:37,467 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1826839067, now seen corresponding path program 1 times [2022-11-25 17:34:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:37,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396155610] [2022-11-25 17:34:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:37,665 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:34:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396155610] [2022-11-25 17:34:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396155610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:37,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:34:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089569356] [2022-11-25 17:34:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:37,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:37,678 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 326 [2022-11-25 17:34:37,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:37,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:37,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 326 [2022-11-25 17:34:37,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:38,443 INFO L130 PetriNetUnfolder]: 2228/3960 cut-off events. [2022-11-25 17:34:38,443 INFO L131 PetriNetUnfolder]: For 3488/3565 co-relation queries the response was YES. [2022-11-25 17:34:38,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12121 conditions, 3960 events. 2228/3960 cut-off events. For 3488/3565 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 28117 event pairs, 867 based on Foata normal form. 43/3647 useless extension candidates. Maximal degree in co-relation 12109. Up to 1580 conditions per place. [2022-11-25 17:34:38,478 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 71 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2022-11-25 17:34:38,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 467 flow [2022-11-25 17:34:38,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:34:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2022-11-25 17:34:38,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4455521472392638 [2022-11-25 17:34:38,481 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2022-11-25 17:34:38,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2022-11-25 17:34:38,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:38,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2022-11-25 17:34:38,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have 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:34:38,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:38,488 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:34:38,488 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 148 flow. Second operand 4 states and 581 transitions. [2022-11-25 17:34:38,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 467 flow [2022-11-25 17:34:38,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 452 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:38,499 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 160 flow [2022-11-25 17:34:38,500 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2022-11-25 17:34:38,501 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2022-11-25 17:34:38,501 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 160 flow [2022-11-25 17:34:38,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:38,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:38,503 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:34:38,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:34:38,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1281050229, now seen corresponding path program 1 times [2022-11-25 17:34:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:38,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936851734] [2022-11-25 17:34:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:38,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:38,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936851734] [2022-11-25 17:34:38,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936851734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:38,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:38,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:34:38,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380233253] [2022-11-25 17:34:38,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:38,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:38,748 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 326 [2022-11-25 17:34:38,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 160 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:34:38,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:38,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 326 [2022-11-25 17:34:38,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:39,234 INFO L130 PetriNetUnfolder]: 673/1453 cut-off events. [2022-11-25 17:34:39,234 INFO L131 PetriNetUnfolder]: For 1065/1098 co-relation queries the response was YES. [2022-11-25 17:34:39,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 1453 events. 673/1453 cut-off events. For 1065/1098 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9986 event pairs, 141 based on Foata normal form. 128/1475 useless extension candidates. Maximal degree in co-relation 4634. Up to 905 conditions per place. [2022-11-25 17:34:39,244 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 45 selfloop transitions, 7 changer transitions 17/75 dead transitions. [2022-11-25 17:34:39,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 478 flow [2022-11-25 17:34:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:34:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2022-11-25 17:34:39,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4176891615541922 [2022-11-25 17:34:39,247 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2022-11-25 17:34:39,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2022-11-25 17:34:39,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:39,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2022-11-25 17:34:39,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have 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:34:39,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have 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:34:39,255 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have 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:34:39,255 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 160 flow. Second operand 6 states and 817 transitions. [2022-11-25 17:34:39,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 478 flow [2022-11-25 17:34:39,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:34:39,258 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 212 flow [2022-11-25 17:34:39,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=6, PETRI_FLOW=212, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2022-11-25 17:34:39,259 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -4 predicate places. [2022-11-25 17:34:39,260 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 212 flow [2022-11-25 17:34:39,260 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:34:39,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:39,260 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:34:39,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:34:39,261 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1636596074, now seen corresponding path program 1 times [2022-11-25 17:34:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152944938] [2022-11-25 17:34:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:39,520 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:34:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:39,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152944938] [2022-11-25 17:34:39,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152944938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:39,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:39,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:34:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900493647] [2022-11-25 17:34:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:39,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:34:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:34:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:34:39,571 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 326 [2022-11-25 17:34:39,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have 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:34:39,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:34:39,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 326 [2022-11-25 17:34:39,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:34:39,906 INFO L130 PetriNetUnfolder]: 237/585 cut-off events. [2022-11-25 17:34:39,907 INFO L131 PetriNetUnfolder]: For 1021/1047 co-relation queries the response was YES. [2022-11-25 17:34:39,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 585 events. 237/585 cut-off events. For 1021/1047 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3377 event pairs, 29 based on Foata normal form. 72/641 useless extension candidates. Maximal degree in co-relation 2350. Up to 282 conditions per place. [2022-11-25 17:34:39,912 INFO L137 encePairwiseOnDemand]: 320/326 looper letters, 38 selfloop transitions, 10 changer transitions 9/62 dead transitions. [2022-11-25 17:34:39,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 62 transitions, 438 flow [2022-11-25 17:34:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:34:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:34:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2022-11-25 17:34:39,916 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40885188431200703 [2022-11-25 17:34:39,916 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2022-11-25 17:34:39,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2022-11-25 17:34:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:34:39,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2022-11-25 17:34:39,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:39,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have 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:34:39,925 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have 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:34:39,925 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 212 flow. Second operand 7 states and 933 transitions. [2022-11-25 17:34:39,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 62 transitions, 438 flow [2022-11-25 17:34:39,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 383 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-11-25 17:34:39,934 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 181 flow [2022-11-25 17:34:39,934 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=181, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2022-11-25 17:34:39,935 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2022-11-25 17:34:39,935 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 181 flow [2022-11-25 17:34:39,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have 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:34:39,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:34:39,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:34:39,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:34:39,936 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:34:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 201058782, now seen corresponding path program 1 times [2022-11-25 17:34:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909720115] [2022-11-25 17:34:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:34:40,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:34:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:34:40,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:34:40,148 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:34:40,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-25 17:34:40,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-25 17:34:40,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-25 17:34:40,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-25 17:34:40,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-25 17:34:40,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-25 17:34:40,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-25 17:34:40,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-25 17:34:40,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-25 17:34:40,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-25 17:34:40,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-25 17:34:40,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-25 17:34:40,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-25 17:34:40,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-25 17:34:40,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-25 17:34:40,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-25 17:34:40,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-25 17:34:40,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-25 17:34:40,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-25 17:34:40,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-25 17:34:40,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-25 17:34:40,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-25 17:34:40,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-25 17:34:40,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-25 17:34:40,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-25 17:34:40,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-25 17:34:40,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-25 17:34:40,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-25 17:34:40,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-25 17:34:40,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-25 17:34:40,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-25 17:34:40,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-25 17:34:40,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-25 17:34:40,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-25 17:34:40,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-25 17:34:40,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-25 17:34:40,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-25 17:34:40,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-25 17:34:40,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-25 17:34:40,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-25 17:34:40,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-25 17:34:40,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-25 17:34:40,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-25 17:34:40,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-25 17:34:40,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-25 17:34:40,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-25 17:34:40,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-25 17:34:40,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-25 17:34:40,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-25 17:34:40,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-25 17:34:40,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-25 17:34:40,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-25 17:34:40,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-25 17:34:40,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:34:40,164 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:40,172 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:34:40,172 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:34:40,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:34:40 BasicIcfg [2022-11-25 17:34:40,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:34:40,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:34:40,271 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:34:40,271 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:34:40,271 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:33:54" (3/4) ... [2022-11-25 17:34:40,274 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:34:40,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:34:40,275 INFO L158 Benchmark]: Toolchain (without parser) took 48112.30ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 122.6MB in the beginning and 166.3MB in the end (delta: -43.7MB). Peak memory consumption was 307.7MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,275 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:34:40,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.14ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 96.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,276 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 93.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,277 INFO L158 Benchmark]: Boogie Preprocessor took 55.63ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,277 INFO L158 Benchmark]: RCFGBuilder took 1383.28ms. Allocated memory is still 155.2MB. Free memory was 91.8MB in the beginning and 63.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,277 INFO L158 Benchmark]: TraceAbstraction took 45852.42ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 62.3MB in the beginning and 166.3MB in the end (delta: -104.0MB). Peak memory consumption was 249.2MB. Max. memory is 16.1GB. [2022-11-25 17:34:40,278 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 507.5MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:34:40,279 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.27ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.14ms. Allocated memory is still 155.2MB. Free memory was 122.0MB in the beginning and 96.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 93.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.63ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 91.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1383.28ms. Allocated memory is still 155.2MB. Free memory was 91.8MB in the beginning and 63.5MB in the end (delta: 28.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 45852.42ms. Allocated memory was 155.2MB in the beginning and 507.5MB in the end (delta: 352.3MB). Free memory was 62.3MB in the beginning and 166.3MB in the end (delta: -104.0MB). Peak memory consumption was 249.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 507.5MB. Free memory is still 166.3MB. 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: 31.8s, 171 PlacesBefore, 66 PlacesAfterwards, 163 TransitionsBefore, 57 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 160 TotalNumberOfCompositions, 16482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7838, independent: 7486, independent conditional: 0, independent unconditional: 7486, dependent: 293, dependent conditional: 0, dependent unconditional: 293, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3321, independent: 3231, independent conditional: 0, independent unconditional: 3231, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3321, independent: 3030, independent conditional: 0, independent unconditional: 3030, dependent: 291, dependent conditional: 0, dependent unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 291, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10071, independent: 953, independent conditional: 0, independent unconditional: 953, dependent: 789, dependent conditional: 0, dependent unconditional: 789, unknown: 8329, unknown conditional: 0, unknown unconditional: 8329] ], Cache Queries: [ total: 7838, independent: 4255, independent conditional: 0, independent unconditional: 4255, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 3370, unknown conditional: 0, unknown unconditional: 3370] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 489, Positive conditional cache size: 0, Positive unconditional cache size: 489, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5 - 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; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((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(&t1949, ((void *)0), P0, ((void *)0))=-1, t1949={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] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((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(&t1950, ((void *)0), P1, ((void *)0))=0, t1949={7:0}, t1950={8: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] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((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(&t1951, ((void *)0), P2, ((void *)0))=1, t1949={7:0}, t1950={8:0}, t1951={5: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] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 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=2, weak$$choice1=0, weak$$choice2=255, 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] [L781] 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=2, weak$$choice1=0, weak$$choice2=255, 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] [L793] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, 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] [L796] 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, 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] [L808] 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=2, weak$$choice1=0, weak$$choice2=255, 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] [L811] 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=2, weak$$choice1=0, weak$$choice2=255, 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] [L814] 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) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] 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) [L814] 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) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 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 [__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=2, weak$$choice1=0, weak$$choice2=255, 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] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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, t1949={7:0}, t1950={8:0}, t1951={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, 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] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] 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=2, weak$$choice1=1, weak$$choice2=255, 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 208 locations, 53 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: 45.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 32.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 758 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1230 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 106 mSDtfsCounter, 1230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=13, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 509 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:34:40,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/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 d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --- 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:34:43,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:34:43,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:34:43,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:34:43,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:34:43,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:34:43,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:34:43,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:34:43,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:34:43,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:34:43,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:34:43,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:34:43,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:34:43,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:34:43,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:34:43,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:34:43,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:34:43,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:34:43,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:34:43,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:34:43,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:34:43,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:34:43,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:34:43,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:34:43,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:34:43,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:34:43,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:34:43,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:34:43,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:34:43,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:34:43,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:34:43,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:34:43,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:34:43,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:34:43,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:34:43,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:34:43,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:34:43,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:34:43,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:34:43,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:34:43,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:34:43,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:34:43,202 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:34:43,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:34:43,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:34:43,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:34:43,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:34:43,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:34:43,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:34:43,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:34:43,207 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:34:43,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:34:43,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:34:43,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:34:43,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:34:43,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:34:43,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:34:43,210 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:34:43,211 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:34:43,211 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:34:43,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:34:43,212 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:34:43,212 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:34:43,212 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:34:43,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:34:43,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:34:43,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:34:43,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:34:43,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:34:43,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:34:43,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:34:43,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:34:43,215 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:34:43,215 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:34:43,216 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:34:43,216 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:34:43,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:34:43,216 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:34:43,217 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_efaf79f9-dae4-470a-b480-ba4edc704b87/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_efaf79f9-dae4-470a-b480-ba4edc704b87/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 -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 [2022-11-25 17:34:43,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:34:43,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:34:43,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:34:43,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:34:43,683 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:34:43,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:34:46,957 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:34:47,273 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:34:47,274 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:34:47,288 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/42130da22/e58ab1d4a9134a28815023f7d85572de/FLAG78cf9bcf8 [2022-11-25 17:34:47,310 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/data/42130da22/e58ab1d4a9134a28815023f7d85572de [2022-11-25 17:34:47,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:34:47,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:34:47,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:34:47,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:34:47,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:34:47,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:47" (1/1) ... [2022-11-25 17:34:47,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2161ea51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:47, skipping insertion in model container [2022-11-25 17:34:47,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:47" (1/1) ... [2022-11-25 17:34:47,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:34:47,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:34:47,553 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_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-25 17:34:47,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:47,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:47,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:34:47,964 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:34:47,982 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_efaf79f9-dae4-470a-b480-ba4edc704b87/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-11-25 17:34:48,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:34:48,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:34:48,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:34:48,185 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:34:48,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48 WrapperNode [2022-11-25 17:34:48,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:34:48,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:34:48,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:34:48,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:34:48,197 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:34:48" (1/1) ... [2022-11-25 17:34:48,231 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:34:48" (1/1) ... [2022-11-25 17:34:48,279 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2022-11-25 17:34:48,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:34:48,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:34:48,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:34:48,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:34:48,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:34:48" (1/1) ... [2022-11-25 17:34:48,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:34:48,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:34:48,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:34:48,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:34:48,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (1/1) ... [2022-11-25 17:34:48,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:34:48,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:48,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:34:48,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:34:48,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:34:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:34:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:34:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:34:48,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:34:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:34:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:34:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 17:34:48,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:34:48,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:34:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:34:48,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:34:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:34:48,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:34:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:34:48,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:34:48,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:34:48,480 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:34:48,740 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:34:48,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:34:49,336 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:34:49,824 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:34:49,825 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:34:49,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:34:49 BoogieIcfgContainer [2022-11-25 17:34:49,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:34:49,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:34:49,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:34:49,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:34:49,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:34:47" (1/3) ... [2022-11-25 17:34:49,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e46dc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:34:49, skipping insertion in model container [2022-11-25 17:34:49,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:48" (2/3) ... [2022-11-25 17:34:49,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e46dc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:34:49, skipping insertion in model container [2022-11-25 17:34:49,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:34:49" (3/3) ... [2022-11-25 17:34:49,842 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-11-25 17:34:49,865 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:34:49,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-25 17:34:49,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:34:50,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:34:50,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 349 flow [2022-11-25 17:34:50,224 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2022-11-25 17:34:50,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:34:50,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 2/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 17:34:50,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 167 transitions, 349 flow [2022-11-25 17:34:50,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 337 flow [2022-11-25 17:34:50,252 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:34:50,287 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 337 flow [2022-11-25 17:34:50,291 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 337 flow [2022-11-25 17:34:50,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 337 flow [2022-11-25 17:34:50,362 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2022-11-25 17:34:50,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:34:50,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 2/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-25 17:34:50,368 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-11-25 17:35:51,862 INFO L134 LiptonReduction]: Checked pairs total: 16482 [2022-11-25 17:35:51,862 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-11-25 17:35:51,881 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:35:51,888 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;@20d4edbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:35:51,889 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-25 17:35:51,891 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:35:51,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:35:51,891 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:51,892 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:35:51,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:35:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 836, now seen corresponding path program 1 times [2022-11-25 17:35:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:35:51,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933174673] [2022-11-25 17:35:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:51,914 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:35:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:35:51,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:51,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:52,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:35:52,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:52,084 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:35:52,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:35:52,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:35:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933174673] [2022-11-25 17:35:52,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933174673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:52,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:52,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:35:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936804552] [2022-11-25 17:35:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:52,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:35:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:35:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:35:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:35:52,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 326 [2022-11-25 17:35:52,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 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:35:52,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:35:52,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 326 [2022-11-25 17:35:52,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:35:53,560 INFO L130 PetriNetUnfolder]: 3608/5430 cut-off events. [2022-11-25 17:35:53,560 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 17:35:53,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10701 conditions, 5430 events. 3608/5430 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 32813 event pairs, 3608 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 10690. Up to 5225 conditions per place. [2022-11-25 17:35:53,609 INFO L137 encePairwiseOnDemand]: 307/326 looper letters, 32 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-11-25 17:35:53,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 149 flow [2022-11-25 17:35:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:35:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:35:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2022-11-25 17:35:53,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49233128834355827 [2022-11-25 17:35:53,633 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 321 transitions. [2022-11-25 17:35:53,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions. [2022-11-25 17:35:53,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:35:53,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions. [2022-11-25 17:35:53,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:35:53,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have 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:35:53,658 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have 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:35:53,661 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 321 transitions. [2022-11-25 17:35:53,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 149 flow [2022-11-25 17:35:53,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:35:53,669 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 82 flow [2022-11-25 17:35:53,671 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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:35:53,677 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -20 predicate places. [2022-11-25 17:35:53,678 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 82 flow [2022-11-25 17:35:53,678 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:35:53,678 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:53,679 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:35:53,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:53,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:35:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash 823127, now seen corresponding path program 1 times [2022-11-25 17:35:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:35:53,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875552920] [2022-11-25 17:35:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:53,896 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:35:53,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:35:53,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:53,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:54,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:35:54,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:54,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:35:54,171 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:35:54,256 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:35:54,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:35:54,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:35:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875552920] [2022-11-25 17:35:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875552920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:35:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539484928] [2022-11-25 17:35:54,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:54,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:35:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:54,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:54,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 326 [2022-11-25 17:35:54,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 82 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:35:54,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:35:54,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 326 [2022-11-25 17:35:54,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:35:55,367 INFO L130 PetriNetUnfolder]: 2075/3161 cut-off events. [2022-11-25 17:35:55,367 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:35:55,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 3161 events. 2075/3161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 17920 event pairs, 2075 based on Foata normal form. 0/2086 useless extension candidates. Maximal degree in co-relation 6239. Up to 3044 conditions per place. [2022-11-25 17:35:55,389 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 27 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2022-11-25 17:35:55,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 130 flow [2022-11-25 17:35:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:35:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-11-25 17:35:55,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4437627811860941 [2022-11-25 17:35:55,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-11-25 17:35:55,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-11-25 17:35:55,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:35:55,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-11-25 17:35:55,395 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:35:55,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:35:55,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:35:55,402 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 82 flow. Second operand 3 states and 434 transitions. [2022-11-25 17:35:55,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 130 flow [2022-11-25 17:35:55,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:35:55,404 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2022-11-25 17:35:55,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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:35:55,406 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2022-11-25 17:35:55,406 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2022-11-25 17:35:55,407 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:35:55,407 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:55,407 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:35:55,428 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:55,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:55,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:35:55,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash 823126, now seen corresponding path program 1 times [2022-11-25 17:35:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:35:55,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676690365] [2022-11-25 17:35:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:55,622 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:35:55,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:35:55,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:55,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:55,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:35:55,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:55,865 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:35:55,865 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:35:55,919 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:35:55,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:35:55,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:35:55,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676690365] [2022-11-25 17:35:55,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676690365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:55,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:55,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:35:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793610799] [2022-11-25 17:35:55,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:55,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:35:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:35:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:35:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:35:56,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 326 [2022-11-25 17:35:56,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 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:35:56,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:35:56,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 326 [2022-11-25 17:35:56,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:35:56,812 INFO L130 PetriNetUnfolder]: 1234/1881 cut-off events. [2022-11-25 17:35:56,812 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:35:56,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 1881 events. 1234/1881 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9545 event pairs, 698 based on Foata normal form. 63/1541 useless extension candidates. Maximal degree in co-relation 3755. Up to 1053 conditions per place. [2022-11-25 17:35:56,827 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 32 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-11-25 17:35:56,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 154 flow [2022-11-25 17:35:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:35:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:35:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-11-25 17:35:56,831 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4427402862985685 [2022-11-25 17:35:56,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-11-25 17:35:56,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-11-25 17:35:56,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:35:56,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-11-25 17:35:56,834 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:35:56,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:35:56,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have 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:35:56,838 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 433 transitions. [2022-11-25 17:35:56,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 154 flow [2022-11-25 17:35:56,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:35:56,840 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2022-11-25 17:35:56,840 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-11-25 17:35:56,842 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -22 predicate places. [2022-11-25 17:35:56,842 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2022-11-25 17:35:56,843 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:35:56,843 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:56,843 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:56,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:57,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:57,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:35:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1891427570, now seen corresponding path program 1 times [2022-11-25 17:35:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:35:57,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220202505] [2022-11-25 17:35:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:57,071 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:35:57,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:35:57,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:57,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:57,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:35:57,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:57,348 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:35:57,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:35:57,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:35:57,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220202505] [2022-11-25 17:35:57,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220202505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:57,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:57,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:35:57,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314905887] [2022-11-25 17:35:57,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:57,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:35:57,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:35:57,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:35:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:35:57,401 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 326 [2022-11-25 17:35:57,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:35:57,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:35:57,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 326 [2022-11-25 17:35:57,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:35:58,111 INFO L130 PetriNetUnfolder]: 625/1058 cut-off events. [2022-11-25 17:35:58,111 INFO L131 PetriNetUnfolder]: For 48/60 co-relation queries the response was YES. [2022-11-25 17:35:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2266 conditions, 1058 events. 625/1058 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5366 event pairs, 187 based on Foata normal form. 36/950 useless extension candidates. Maximal degree in co-relation 2261. Up to 906 conditions per place. [2022-11-25 17:35:58,118 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 33 selfloop transitions, 4 changer transitions 15/58 dead transitions. [2022-11-25 17:35:58,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 245 flow [2022-11-25 17:35:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:35:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:35:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2022-11-25 17:35:58,122 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4251533742331288 [2022-11-25 17:35:58,122 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2022-11-25 17:35:58,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2022-11-25 17:35:58,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:35:58,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2022-11-25 17:35:58,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have 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:35:58,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have 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:35:58,130 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have 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:35:58,130 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 5 states and 693 transitions. [2022-11-25 17:35:58,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 245 flow [2022-11-25 17:35:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:35:58,133 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 125 flow [2022-11-25 17:35:58,134 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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=5, PETRI_FLOW=125, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-25 17:35:58,134 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -17 predicate places. [2022-11-25 17:35:58,135 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 125 flow [2022-11-25 17:35:58,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have 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:35:58,135 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:58,136 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:58,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:58,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:58,359 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:35:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:35:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 413332690, now seen corresponding path program 1 times [2022-11-25 17:35:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:35:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639211774] [2022-11-25 17:35:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:35:58,360 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:35:58,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:35:58,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:58,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:35:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:35:58,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:35:58,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:35:58,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 17:35:58,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 17:35:59,236 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:35:59,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:35:59,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:35:59,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639211774] [2022-11-25 17:35:59,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639211774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:35:59,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:35:59,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:35:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602561619] [2022-11-25 17:35:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:35:59,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:35:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:35:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:35:59,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:35:59,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 326 [2022-11-25 17:35:59,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have 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:35:59,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:35:59,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 326 [2022-11-25 17:35:59,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:35:59,939 INFO L130 PetriNetUnfolder]: 526/933 cut-off events. [2022-11-25 17:35:59,939 INFO L131 PetriNetUnfolder]: For 576/588 co-relation queries the response was YES. [2022-11-25 17:35:59,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2531 conditions, 933 events. 526/933 cut-off events. For 576/588 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4909 event pairs, 204 based on Foata normal form. 0/827 useless extension candidates. Maximal degree in co-relation 2523. Up to 646 conditions per place. [2022-11-25 17:35:59,955 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 48 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2022-11-25 17:35:59,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 296 flow [2022-11-25 17:35:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:35:59,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:35:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-11-25 17:35:59,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44401840490797545 [2022-11-25 17:35:59,959 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-11-25 17:35:59,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-11-25 17:35:59,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:35:59,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-11-25 17:35:59,961 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:35:59,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:35:59,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:35:59,966 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 125 flow. Second operand 4 states and 579 transitions. [2022-11-25 17:35:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 296 flow [2022-11-25 17:35:59,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 282 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 17:35:59,972 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 124 flow [2022-11-25 17:35:59,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-25 17:35:59,976 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -17 predicate places. [2022-11-25 17:35:59,977 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 124 flow [2022-11-25 17:35:59,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have 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:35:59,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:35:59,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:35:59,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:00,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:00,192 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:36:00,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:00,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1771622913, now seen corresponding path program 1 times [2022-11-25 17:36:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:36:00,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364508941] [2022-11-25 17:36:00,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:00,193 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:36:00,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:36:00,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:00,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:00,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:36:00,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:00,505 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:36:00,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:36:00,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:36:00,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364508941] [2022-11-25 17:36:00,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364508941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:00,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:00,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:36:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768905138] [2022-11-25 17:36:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:00,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:36:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:36:00,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:36:00,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:36:00,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 326 [2022-11-25 17:36:00,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:00,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:36:00,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 326 [2022-11-25 17:36:00,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:36:01,330 INFO L130 PetriNetUnfolder]: 164/350 cut-off events. [2022-11-25 17:36:01,331 INFO L131 PetriNetUnfolder]: For 235/237 co-relation queries the response was YES. [2022-11-25 17:36:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 350 events. 164/350 cut-off events. For 235/237 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1451 event pairs, 36 based on Foata normal form. 30/353 useless extension candidates. Maximal degree in co-relation 957. Up to 175 conditions per place. [2022-11-25 17:36:01,334 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 39 selfloop transitions, 7 changer transitions 15/67 dead transitions. [2022-11-25 17:36:01,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 366 flow [2022-11-25 17:36:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:36:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:36:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2022-11-25 17:36:01,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4238241308793456 [2022-11-25 17:36:01,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2022-11-25 17:36:01,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2022-11-25 17:36:01,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:01,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2022-11-25 17:36:01,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have 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:36:01,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have 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:36:01,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have 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:36:01,348 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 124 flow. Second operand 6 states and 829 transitions. [2022-11-25 17:36:01,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 366 flow [2022-11-25 17:36:01,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:36:01,351 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 185 flow [2022-11-25 17:36:01,351 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=6, PETRI_FLOW=185, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2022-11-25 17:36:01,352 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -11 predicate places. [2022-11-25 17:36:01,352 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 185 flow [2022-11-25 17:36:01,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:01,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:36:01,353 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:36:01,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:01,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:01,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:36:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:01,568 INFO L85 PathProgramCache]: Analyzing trace with hash 558761133, now seen corresponding path program 1 times [2022-11-25 17:36:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:36:01,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133726396] [2022-11-25 17:36:01,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:01,569 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:36:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:36:01,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:01,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:01,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:36:01,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:01,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:36:01,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:36:01,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:36:01,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133726396] [2022-11-25 17:36:01,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133726396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:01,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:01,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:36:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687463643] [2022-11-25 17:36:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:01,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:36:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:36:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:36:01,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:36:02,043 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 326 [2022-11-25 17:36:02,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have 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:36:02,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:36:02,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 326 [2022-11-25 17:36:02,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:36:02,801 INFO L130 PetriNetUnfolder]: 74/167 cut-off events. [2022-11-25 17:36:02,801 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-11-25 17:36:02,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 167 events. 74/167 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 535 event pairs, 19 based on Foata normal form. 9/171 useless extension candidates. Maximal degree in co-relation 536. Up to 59 conditions per place. [2022-11-25 17:36:02,803 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 30 selfloop transitions, 10 changer transitions 9/54 dead transitions. [2022-11-25 17:36:02,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 331 flow [2022-11-25 17:36:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:36:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:36:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2022-11-25 17:36:02,808 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4127957931638913 [2022-11-25 17:36:02,808 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2022-11-25 17:36:02,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2022-11-25 17:36:02,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:02,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2022-11-25 17:36:02,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have 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:36:02,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have 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:36:02,817 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have 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:36:02,818 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 185 flow. Second operand 7 states and 942 transitions. [2022-11-25 17:36:02,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 331 flow [2022-11-25 17:36:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 289 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-25 17:36:02,822 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 146 flow [2022-11-25 17:36:02,822 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-11-25 17:36:02,823 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -16 predicate places. [2022-11-25 17:36:02,823 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 146 flow [2022-11-25 17:36:02,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have 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:36:02,824 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:36:02,824 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:36:02,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:36:03,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:36:03,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1994635837, now seen corresponding path program 1 times [2022-11-25 17:36:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:36:03,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236940633] [2022-11-25 17:36:03,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:36:03,041 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:36:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:36:03,050 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:36:03,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:36:03,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:03,399 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:36:03,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:36:03,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:36:03,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236940633] [2022-11-25 17:36:03,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236940633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:03,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:03,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:36:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58587356] [2022-11-25 17:36:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:36:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:36:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:36:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:36:03,414 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 326 [2022-11-25 17:36:03,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:36:03,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:36:03,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 326 [2022-11-25 17:36:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:36:03,708 INFO L130 PetriNetUnfolder]: 117/263 cut-off events. [2022-11-25 17:36:03,708 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2022-11-25 17:36:03,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 263 events. 117/263 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1108 event pairs, 37 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 805. Up to 92 conditions per place. [2022-11-25 17:36:03,711 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 54 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-11-25 17:36:03,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 420 flow [2022-11-25 17:36:03,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:36:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:36:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-11-25 17:36:03,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43558282208588955 [2022-11-25 17:36:03,714 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-11-25 17:36:03,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-11-25 17:36:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-11-25 17:36:03,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:36:03,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:36:03,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:36:03,719 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 146 flow. Second operand 4 states and 568 transitions. [2022-11-25 17:36:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 420 flow [2022-11-25 17:36:03,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 340 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-25 17:36:03,723 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 122 flow [2022-11-25 17:36:03,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 17:36:03,724 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -21 predicate places. [2022-11-25 17:36:03,724 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 122 flow [2022-11-25 17:36:03,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:36:03,724 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:36:03,725 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:36:03,742 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,938 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:36:03,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1189301513, now seen corresponding path program 2 times [2022-11-25 17:36:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:36:03,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819603365] [2022-11-25 17:36:03,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:36:03,940 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:36:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:36:03,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:03,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:04,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:36:04,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:36:04,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:36:04,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:36:04,288 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:36:04,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:36:04,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:36:04,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819603365] [2022-11-25 17:36:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819603365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:36:04,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:36:04,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:36:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305272860] [2022-11-25 17:36:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:36:04,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:36:04,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:36:04,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:36:04,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:36:04,307 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 326 [2022-11-25 17:36:04,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:36:04,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:36:04,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 326 [2022-11-25 17:36:04,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:36:04,637 INFO L130 PetriNetUnfolder]: 160/358 cut-off events. [2022-11-25 17:36:04,637 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-11-25 17:36:04,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 358 events. 160/358 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1601 event pairs, 48 based on Foata normal form. 1/355 useless extension candidates. Maximal degree in co-relation 1066. Up to 148 conditions per place. [2022-11-25 17:36:04,641 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 51 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2022-11-25 17:36:04,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 338 flow [2022-11-25 17:36:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:36:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:36:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2022-11-25 17:36:04,646 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4325153374233129 [2022-11-25 17:36:04,646 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2022-11-25 17:36:04,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2022-11-25 17:36:04,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:36:04,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2022-11-25 17:36:04,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have 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:36:04,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:36:04,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:36:04,652 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 122 flow. Second operand 4 states and 564 transitions. [2022-11-25 17:36:04,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 338 flow [2022-11-25 17:36:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:36:04,656 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 132 flow [2022-11-25 17:36:04,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-11-25 17:36:04,657 INFO L288 CegarLoopForPetriNet]: 66 programPoint places, -19 predicate places. [2022-11-25 17:36:04,657 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 132 flow [2022-11-25 17:36:04,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have 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:36:04,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:36:04,658 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:36:04,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:04,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:04,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-25 17:36:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:36:04,870 INFO L85 PathProgramCache]: Analyzing trace with hash 193082775, now seen corresponding path program 3 times [2022-11-25 17:36:04,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:36:04,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751321587] [2022-11-25 17:36:04,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:36:04,871 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:36:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:36:04,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:04,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:05,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:36:05,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:36:05,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:36:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:36:05,339 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:36:05,339 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:36:05,340 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-25 17:36:05,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-25 17:36:05,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-25 17:36:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-25 17:36:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-25 17:36:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-25 17:36:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-25 17:36:05,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-25 17:36:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-25 17:36:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-25 17:36:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-25 17:36:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-25 17:36:05,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-25 17:36:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-25 17:36:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-25 17:36:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-25 17:36:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-25 17:36:05,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-25 17:36:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-25 17:36:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-25 17:36:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-25 17:36:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-25 17:36:05,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-25 17:36:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-25 17:36:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-25 17:36:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-25 17:36:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-25 17:36:05,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-25 17:36:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-25 17:36:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-25 17:36:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-25 17:36:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-25 17:36:05,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-25 17:36:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-25 17:36:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-25 17:36:05,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-25 17:36:05,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-25 17:36:05,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-25 17:36:05,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-25 17:36:05,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-25 17:36:05,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-25 17:36:05,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-25 17:36:05,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-25 17:36:05,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-25 17:36:05,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-25 17:36:05,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-25 17:36:05,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-25 17:36:05,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-25 17:36:05,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-25 17:36:05,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-25 17:36:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-25 17:36:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-25 17:36:05,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-25 17:36:05,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:05,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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:36:05,588 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:36:05,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:36:05,594 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:36:05,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:36:05 BasicIcfg [2022-11-25 17:36:05,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:36:05,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:36:05,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:36:05,716 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:36:05,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:34:49" (3/4) ... [2022-11-25 17:36:05,719 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:36:05,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:36:05,720 INFO L158 Benchmark]: Toolchain (without parser) took 78402.41ms. Allocated memory was 88.1MB in the beginning and 306.2MB in the end (delta: 218.1MB). Free memory was 65.7MB in the beginning and 227.3MB in the end (delta: -161.6MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,720 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:36:05,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 867.67ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 58.4MB in the end (delta: 7.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.60ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 56.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,722 INFO L158 Benchmark]: Boogie Preprocessor took 81.46ms. Allocated memory is still 88.1MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,722 INFO L158 Benchmark]: RCFGBuilder took 1464.32ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 64.0MB in the end (delta: -10.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,723 INFO L158 Benchmark]: TraceAbstraction took 75883.57ms. Allocated memory was 107.0MB in the beginning and 306.2MB in the end (delta: 199.2MB). Free memory was 63.2MB in the beginning and 228.3MB in the end (delta: -165.1MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,723 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 306.2MB. Free memory was 228.3MB in the beginning and 227.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:36:05,725 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 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 867.67ms. Allocated memory is still 88.1MB. Free memory was 65.4MB in the beginning and 58.4MB in the end (delta: 7.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.60ms. Allocated memory is still 88.1MB. Free memory was 58.4MB in the beginning and 56.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.46ms. Allocated memory is still 88.1MB. Free memory was 56.0MB in the beginning and 53.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1464.32ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 64.0MB in the end (delta: -10.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 75883.57ms. Allocated memory was 107.0MB in the beginning and 306.2MB in the end (delta: 199.2MB). Free memory was 63.2MB in the beginning and 228.3MB in the end (delta: -165.1MB). Peak memory consumption was 211.0MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 306.2MB. Free memory was 228.3MB in the beginning and 227.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.6s, 172 PlacesBefore, 66 PlacesAfterwards, 164 TransitionsBefore, 57 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 16482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8097, independent: 7745, independent conditional: 0, independent unconditional: 7745, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 96, unknown conditional: 0, unknown unconditional: 96] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3362, independent: 3271, independent conditional: 0, independent unconditional: 3271, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3362, independent: 3045, independent conditional: 0, independent unconditional: 3045, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 317, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13060, independent: 1178, independent conditional: 0, independent unconditional: 1178, dependent: 1888, dependent conditional: 0, dependent unconditional: 1888, unknown: 9994, unknown conditional: 0, unknown unconditional: 9994] ], Cache Queries: [ total: 8097, independent: 4474, independent conditional: 0, independent unconditional: 4474, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 3444, unknown conditional: 0, unknown unconditional: 3444] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 501, Positive conditional cache size: 0, Positive unconditional cache size: 501, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [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; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((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(&t1949, ((void *)0), P0, ((void *)0))=-1, t1949={15: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] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 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=3, 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] [L781] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_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(&t1950, ((void *)0), P1, ((void *)0))=0, t1949={15:0}, t1950={7:0}, weak$$choice0=3, 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] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_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, pthread_create(&t1951, ((void *)0), P2, ((void *)0))=1, t1949={15:0}, t1950={7:0}, t1951={5:0}, weak$$choice0=3, 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] [L793] 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=3, 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] [L796] 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=3, 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] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L808] 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=3, 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] [L811] 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=3, 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] [L814] 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) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] 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) [L814] 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) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 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 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 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=3, 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] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 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 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 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, t1949={15:0}, t1950={7:0}, t1951={5:0}, weak$$choice0=3, 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] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] 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=3, 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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 209 locations, 53 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: 75.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 61.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 861 IncrementalHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 62 mSDtfsCounter, 861 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1159 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:36:05,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efaf79f9-dae4-470a-b480-ba4edc704b87/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