./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:10:44,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:10:44,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:10:44,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:10:44,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:10:44,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:10:44,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:10:44,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:10:44,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:10:44,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:10:44,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:10:44,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:10:44,850 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:10:44,851 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:10:44,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:10:44,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:10:44,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:10:44,855 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:10:44,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:10:44,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:10:44,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:10:44,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:10:44,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:10:44,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:10:44,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:10:44,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:10:44,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:10:44,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:10:44,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:10:44,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:10:44,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:10:44,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:10:44,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:10:44,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:10:44,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:10:44,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:10:44,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:10:44,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:10:44,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:10:44,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:10:44,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:10:44,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:10:44,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:10:44,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:10:44,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:10:44,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:10:44,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:10:44,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:10:44,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:10:44,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:10:44,895 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:10:44,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:10:44,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:10:44,896 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:10:44,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:10:44,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:10:44,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:10:44,897 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:10:44,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:10:44,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:10:44,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:10:44,898 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:10:44,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:10:44,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:10:44,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:10:44,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:10:44,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:10:44,899 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:10:44,899 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:10:44,900 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:10:44,900 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:10:44,900 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_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 [2022-12-13 16:10:45,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:10:45,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:10:45,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:10:45,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:10:45,112 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:10:45,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 16:10:47,657 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:10:47,846 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:10:47,847 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 16:10:47,856 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/ca21f3c96/80ff53ea8c7d44d0b6a052ef392ceef2/FLAGde2f963f2 [2022-12-13 16:10:48,215 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/ca21f3c96/80ff53ea8c7d44d0b6a052ef392ceef2 [2022-12-13 16:10:48,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:10:48,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:10:48,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:10:48,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:10:48,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:10:48,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba6d18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48, skipping insertion in model container [2022-12-13 16:10:48,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:10:48,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:10:48,394 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_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 16:10:48,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,558 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:10:48,592 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:10:48,604 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_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 16:10:48,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,636 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:10:48,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:10:48,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:10:48,661 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:10:48,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48 WrapperNode [2022-12-13 16:10:48,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:10:48,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:10:48,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:10:48,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:10:48,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,696 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2022-12-13 16:10:48,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:10:48,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:10:48,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:10:48,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:10:48,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:10:48,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:10:48,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:10:48,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:10:48,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (1/1) ... [2022-12-13 16:10:48,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:10:48,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:10:48,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:10:48,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:10:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:10:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:10:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:10:48,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:10:48,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:10:48,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:10:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:10:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:10:48,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:10:48,790 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:10:48,903 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:10:48,905 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:10:49,201 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:10:49,296 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:10:49,296 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:10:49,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:49 BoogieIcfgContainer [2022-12-13 16:10:49,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:10:49,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:10:49,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:10:49,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:10:49,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:10:48" (1/3) ... [2022-12-13 16:10:49,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e7aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:10:49, skipping insertion in model container [2022-12-13 16:10:49,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:10:48" (2/3) ... [2022-12-13 16:10:49,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29e7aa27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:10:49, skipping insertion in model container [2022-12-13 16:10:49,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:49" (3/3) ... [2022-12-13 16:10:49,306 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-12-13 16:10:49,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:10:49,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:10:49,321 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:10:49,361 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:10:49,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 16:10:49,423 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 16:10:49,423 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:49,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 16:10:49,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 16:10:49,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-12-13 16:10:49,434 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:10:49,442 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 16:10:49,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 16:10:49,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-12-13 16:10:49,464 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 16:10:49,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:49,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 16:10:49,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2124 [2022-12-13 16:10:52,729 INFO L134 LiptonReduction]: Checked pairs total: 4820 [2022-12-13 16:10:52,730 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-12-13 16:10:52,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:10:52,750 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;@718abc4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:10:52,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:10:52,751 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:10:52,751 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:52,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:52,752 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:10:52,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times [2022-12-13 16:10:52,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:52,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623753002] [2022-12-13 16:10:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:52,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623753002] [2022-12-13 16:10:52,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623753002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:52,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:52,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:10:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769094968] [2022-12-13 16:10:52,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:52,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:10:52,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:10:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:10:52,864 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 16:10:52,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:52,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:52,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 16:10:52,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:53,107 INFO L130 PetriNetUnfolder]: 1263/1907 cut-off events. [2022-12-13 16:10:53,107 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 16:10:53,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 1907 events. 1263/1907 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9051 event pairs, 1263 based on Foata normal form. 72/1654 useless extension candidates. Maximal degree in co-relation 3803. Up to 1871 conditions per place. [2022-12-13 16:10:53,117 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-12-13 16:10:53,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2022-12-13 16:10:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:10:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:10:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2022-12-13 16:10:53,127 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.516 [2022-12-13 16:10:53,127 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2022-12-13 16:10:53,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2022-12-13 16:10:53,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:53,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2022-12-13 16:10:53,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,136 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,137 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 258 transitions. [2022-12-13 16:10:53,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2022-12-13 16:10:53,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:10:53,140 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-12-13 16:10:53,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-12-13 16:10:53,144 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-12-13 16:10:53,145 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-12-13 16:10:53,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:53,145 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:53,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:10:53,145 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:53,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1362690841, now seen corresponding path program 1 times [2022-12-13 16:10:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:53,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406531199] [2022-12-13 16:10:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:53,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:53,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406531199] [2022-12-13 16:10:53,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406531199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:53,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:53,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:10:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105066811] [2022-12-13 16:10:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:10:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:10:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:10:53,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 250 [2022-12-13 16:10:53,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:53,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 250 [2022-12-13 16:10:53,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:53,575 INFO L130 PetriNetUnfolder]: 1043/1651 cut-off events. [2022-12-13 16:10:53,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:10:53,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 1651 events. 1043/1651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8373 event pairs, 163 based on Foata normal form. 0/1470 useless extension candidates. Maximal degree in co-relation 3237. Up to 1265 conditions per place. [2022-12-13 16:10:53,580 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2022-12-13 16:10:53,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 146 flow [2022-12-13 16:10:53,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:10:53,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:10:53,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2022-12-13 16:10:53,583 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49866666666666665 [2022-12-13 16:10:53,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2022-12-13 16:10:53,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2022-12-13 16:10:53,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:53,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2022-12-13 16:10:53,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,586 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 374 transitions. [2022-12-13 16:10:53,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 146 flow [2022-12-13 16:10:53,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:10:53,587 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2022-12-13 16:10:53,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-13 16:10:53,587 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:10:53,587 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2022-12-13 16:10:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:53,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:53,588 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:53,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:10:53,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:53,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash 110250398, now seen corresponding path program 1 times [2022-12-13 16:10:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:53,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254106753] [2022-12-13 16:10:53,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:53,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254106753] [2022-12-13 16:10:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254106753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:53,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:53,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877464025] [2022-12-13 16:10:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:10:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:53,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:10:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:10:54,033 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 250 [2022-12-13 16:10:54,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:54,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 250 [2022-12-13 16:10:54,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:54,240 INFO L130 PetriNetUnfolder]: 644/1036 cut-off events. [2022-12-13 16:10:54,241 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 16:10:54,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 1036 events. 644/1036 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4704 event pairs, 48 based on Foata normal form. 0/1036 useless extension candidates. Maximal degree in co-relation 2104. Up to 579 conditions per place. [2022-12-13 16:10:54,244 INFO L137 encePairwiseOnDemand]: 245/250 looper letters, 31 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2022-12-13 16:10:54,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 154 flow [2022-12-13 16:10:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:10:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:10:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2022-12-13 16:10:54,246 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4246666666666667 [2022-12-13 16:10:54,246 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 637 transitions. [2022-12-13 16:10:54,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions. [2022-12-13 16:10:54,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:54,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions. [2022-12-13 16:10:54,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,251 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,251 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 6 states and 637 transitions. [2022-12-13 16:10:54,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 154 flow [2022-12-13 16:10:54,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:54,252 INFO L231 Difference]: Finished difference. Result has 34 places, 21 transitions, 56 flow [2022-12-13 16:10:54,253 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2022-12-13 16:10:54,253 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-12-13 16:10:54,253 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 56 flow [2022-12-13 16:10:54,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:54,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:54,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:10:54,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:54,254 INFO L85 PathProgramCache]: Analyzing trace with hash 110250359, now seen corresponding path program 1 times [2022-12-13 16:10:54,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:54,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927922561] [2022-12-13 16:10:54,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:54,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:54,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927922561] [2022-12-13 16:10:54,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927922561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:54,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:54,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:10:54,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89902880] [2022-12-13 16:10:54,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:54,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:54,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:54,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 16:10:54,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:54,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 16:10:54,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:54,621 INFO L130 PetriNetUnfolder]: 1167/1768 cut-off events. [2022-12-13 16:10:54,621 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2022-12-13 16:10:54,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 1768 events. 1167/1768 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7474 event pairs, 459 based on Foata normal form. 96/1864 useless extension candidates. Maximal degree in co-relation 3687. Up to 1461 conditions per place. [2022-12-13 16:10:54,626 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 29 selfloop transitions, 4 changer transitions 18/51 dead transitions. [2022-12-13 16:10:54,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 232 flow [2022-12-13 16:10:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2022-12-13 16:10:54,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4704 [2022-12-13 16:10:54,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2022-12-13 16:10:54,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2022-12-13 16:10:54,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:54,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2022-12-13 16:10:54,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,631 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,631 INFO L175 Difference]: Start difference. First operand has 34 places, 21 transitions, 56 flow. Second operand 5 states and 588 transitions. [2022-12-13 16:10:54,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 232 flow [2022-12-13 16:10:54,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 16:10:54,632 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 86 flow [2022-12-13 16:10:54,632 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-13 16:10:54,633 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2022-12-13 16:10:54,633 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 86 flow [2022-12-13 16:10:54,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:54,633 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:54,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:10:54,633 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1442819352, now seen corresponding path program 1 times [2022-12-13 16:10:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:54,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799988889] [2022-12-13 16:10:54,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:54,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:54,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:54,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799988889] [2022-12-13 16:10:54,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799988889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:54,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:54,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252166853] [2022-12-13 16:10:54,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:54,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:54,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:54,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 16:10:54,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:54,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:54,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 16:10:54,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:54,992 INFO L130 PetriNetUnfolder]: 1027/1556 cut-off events. [2022-12-13 16:10:54,992 INFO L131 PetriNetUnfolder]: For 859/859 co-relation queries the response was YES. [2022-12-13 16:10:54,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 1556 events. 1027/1556 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6205 event pairs, 295 based on Foata normal form. 72/1628 useless extension candidates. Maximal degree in co-relation 4051. Up to 1025 conditions per place. [2022-12-13 16:10:54,998 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 29 selfloop transitions, 3 changer transitions 18/50 dead transitions. [2022-12-13 16:10:54,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 269 flow [2022-12-13 16:10:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:55,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2022-12-13 16:10:55,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4672 [2022-12-13 16:10:55,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2022-12-13 16:10:55,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2022-12-13 16:10:55,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:55,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2022-12-13 16:10:55,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,006 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,006 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 86 flow. Second operand 5 states and 584 transitions. [2022-12-13 16:10:55,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 269 flow [2022-12-13 16:10:55,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:55,011 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 95 flow [2022-12-13 16:10:55,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2022-12-13 16:10:55,012 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-12-13 16:10:55,012 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 95 flow [2022-12-13 16:10:55,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,012 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:55,012 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:10:55,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:55,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1247458646, now seen corresponding path program 1 times [2022-12-13 16:10:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:55,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663254584] [2022-12-13 16:10:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:55,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663254584] [2022-12-13 16:10:55,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663254584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:55,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:55,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:10:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489275174] [2022-12-13 16:10:55,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:55,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:10:55,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:55,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:10:55,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:10:55,223 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2022-12-13 16:10:55,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:55,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2022-12-13 16:10:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:55,422 INFO L130 PetriNetUnfolder]: 484/829 cut-off events. [2022-12-13 16:10:55,423 INFO L131 PetriNetUnfolder]: For 548/548 co-relation queries the response was YES. [2022-12-13 16:10:55,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2225 conditions, 829 events. 484/829 cut-off events. For 548/548 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3653 event pairs, 88 based on Foata normal form. 76/903 useless extension candidates. Maximal degree in co-relation 2216. Up to 514 conditions per place. [2022-12-13 16:10:55,428 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 46 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2022-12-13 16:10:55,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 321 flow [2022-12-13 16:10:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2022-12-13 16:10:55,430 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4664 [2022-12-13 16:10:55,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2022-12-13 16:10:55,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2022-12-13 16:10:55,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:55,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2022-12-13 16:10:55,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,435 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 95 flow. Second operand 5 states and 583 transitions. [2022-12-13 16:10:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 321 flow [2022-12-13 16:10:55,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 58 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 16:10:55,439 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 139 flow [2022-12-13 16:10:55,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 16:10:55,439 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-13 16:10:55,439 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 139 flow [2022-12-13 16:10:55,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:55,440 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:55,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:10:55,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1981424978, now seen corresponding path program 1 times [2022-12-13 16:10:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:55,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275203339] [2022-12-13 16:10:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275203339] [2022-12-13 16:10:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275203339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:55,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13431977] [2022-12-13 16:10:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:55,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:55,628 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2022-12-13 16:10:55,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:55,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2022-12-13 16:10:55,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:55,817 INFO L130 PetriNetUnfolder]: 315/584 cut-off events. [2022-12-13 16:10:55,817 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-13 16:10:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 584 events. 315/584 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2594 event pairs, 46 based on Foata normal form. 44/626 useless extension candidates. Maximal degree in co-relation 1897. Up to 202 conditions per place. [2022-12-13 16:10:55,820 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 53 selfloop transitions, 13 changer transitions 9/78 dead transitions. [2022-12-13 16:10:55,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 485 flow [2022-12-13 16:10:55,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:10:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:10:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2022-12-13 16:10:55,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2022-12-13 16:10:55,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2022-12-13 16:10:55,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2022-12-13 16:10:55,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:55,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2022-12-13 16:10:55,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,825 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,825 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 139 flow. Second operand 7 states and 815 transitions. [2022-12-13 16:10:55,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 485 flow [2022-12-13 16:10:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:10:55,827 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 223 flow [2022-12-13 16:10:55,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 16:10:55,828 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-12-13 16:10:55,828 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 223 flow [2022-12-13 16:10:55,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:55,828 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:10:55,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 955082375, now seen corresponding path program 1 times [2022-12-13 16:10:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:55,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151008835] [2022-12-13 16:10:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151008835] [2022-12-13 16:10:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151008835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:55,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:55,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236473089] [2022-12-13 16:10:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:55,986 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-12-13 16:10:55,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:55,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:55,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-12-13 16:10:55,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:56,211 INFO L130 PetriNetUnfolder]: 456/849 cut-off events. [2022-12-13 16:10:56,211 INFO L131 PetriNetUnfolder]: For 1838/1838 co-relation queries the response was YES. [2022-12-13 16:10:56,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 849 events. 456/849 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4194 event pairs, 66 based on Foata normal form. 6/855 useless extension candidates. Maximal degree in co-relation 3239. Up to 467 conditions per place. [2022-12-13 16:10:56,215 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 45 selfloop transitions, 2 changer transitions 39/87 dead transitions. [2022-12-13 16:10:56,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 736 flow [2022-12-13 16:10:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:10:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:10:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2022-12-13 16:10:56,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4776 [2022-12-13 16:10:56,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2022-12-13 16:10:56,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2022-12-13 16:10:56,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:56,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2022-12-13 16:10:56,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,223 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 223 flow. Second operand 5 states and 597 transitions. [2022-12-13 16:10:56,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 736 flow [2022-12-13 16:10:56,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 658 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-12-13 16:10:56,231 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 174 flow [2022-12-13 16:10:56,231 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2022-12-13 16:10:56,232 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-12-13 16:10:56,232 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 174 flow [2022-12-13 16:10:56,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,232 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:56,232 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:10:56,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 551865371, now seen corresponding path program 2 times [2022-12-13 16:10:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960334238] [2022-12-13 16:10:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:56,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:56,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960334238] [2022-12-13 16:10:56,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960334238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:56,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:56,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:10:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249895667] [2022-12-13 16:10:56,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:56,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:10:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:56,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:10:56,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:10:56,550 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 250 [2022-12-13 16:10:56,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 31 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:56,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 250 [2022-12-13 16:10:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:56,702 INFO L130 PetriNetUnfolder]: 180/357 cut-off events. [2022-12-13 16:10:56,702 INFO L131 PetriNetUnfolder]: For 587/609 co-relation queries the response was YES. [2022-12-13 16:10:56,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 357 events. 180/357 cut-off events. For 587/609 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1456 event pairs, 46 based on Foata normal form. 31/377 useless extension candidates. Maximal degree in co-relation 1245. Up to 128 conditions per place. [2022-12-13 16:10:56,703 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 33 selfloop transitions, 10 changer transitions 13/59 dead transitions. [2022-12-13 16:10:56,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 409 flow [2022-12-13 16:10:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:10:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:10:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 797 transitions. [2022-12-13 16:10:56,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4554285714285714 [2022-12-13 16:10:56,705 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 797 transitions. [2022-12-13 16:10:56,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 797 transitions. [2022-12-13 16:10:56,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:56,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 797 transitions. [2022-12-13 16:10:56,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,709 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,709 INFO L175 Difference]: Start difference. First operand has 54 places, 31 transitions, 174 flow. Second operand 7 states and 797 transitions. [2022-12-13 16:10:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 409 flow [2022-12-13 16:10:56,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 369 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 16:10:56,711 INFO L231 Difference]: Finished difference. Result has 52 places, 29 transitions, 166 flow [2022-12-13 16:10:56,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2022-12-13 16:10:56,711 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-13 16:10:56,712 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 29 transitions, 166 flow [2022-12-13 16:10:56,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:56,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:56,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:10:56,712 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash 781991937, now seen corresponding path program 1 times [2022-12-13 16:10:56,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:56,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507349845] [2022-12-13 16:10:56,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507349845] [2022-12-13 16:10:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507349845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:56,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:56,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:10:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479003603] [2022-12-13 16:10:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:56,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:10:56,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:56,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:10:56,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:10:56,899 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2022-12-13 16:10:56,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 29 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:56,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:56,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2022-12-13 16:10:56,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:57,032 INFO L130 PetriNetUnfolder]: 165/329 cut-off events. [2022-12-13 16:10:57,032 INFO L131 PetriNetUnfolder]: For 564/564 co-relation queries the response was YES. [2022-12-13 16:10:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 329 events. 165/329 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1266 event pairs, 34 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 1208. Up to 198 conditions per place. [2022-12-13 16:10:57,034 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 43 selfloop transitions, 9 changer transitions 14/66 dead transitions. [2022-12-13 16:10:57,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 498 flow [2022-12-13 16:10:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:10:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:10:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2022-12-13 16:10:57,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45466666666666666 [2022-12-13 16:10:57,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2022-12-13 16:10:57,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2022-12-13 16:10:57,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:57,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2022-12-13 16:10:57,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 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-12-13 16:10:57,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,038 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,039 INFO L175 Difference]: Start difference. First operand has 52 places, 29 transitions, 166 flow. Second operand 6 states and 682 transitions. [2022-12-13 16:10:57,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 498 flow [2022-12-13 16:10:57,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 405 flow, removed 26 selfloop flow, removed 9 redundant places. [2022-12-13 16:10:57,041 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 181 flow [2022-12-13 16:10:57,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2022-12-13 16:10:57,041 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 16:10:57,041 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 181 flow [2022-12-13 16:10:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:57,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:57,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:10:57,042 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 596594293, now seen corresponding path program 2 times [2022-12-13 16:10:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:57,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157889675] [2022-12-13 16:10:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:57,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:57,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157889675] [2022-12-13 16:10:57,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157889675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:57,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:57,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:10:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802749231] [2022-12-13 16:10:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:57,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:10:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:57,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:10:57,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:10:57,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2022-12-13 16:10:57,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:57,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2022-12-13 16:10:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:57,370 INFO L130 PetriNetUnfolder]: 188/384 cut-off events. [2022-12-13 16:10:57,370 INFO L131 PetriNetUnfolder]: For 516/516 co-relation queries the response was YES. [2022-12-13 16:10:57,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 384 events. 188/384 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1579 event pairs, 49 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1350. Up to 186 conditions per place. [2022-12-13 16:10:57,371 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 26 selfloop transitions, 3 changer transitions 39/68 dead transitions. [2022-12-13 16:10:57,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 463 flow [2022-12-13 16:10:57,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:10:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:10:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2022-12-13 16:10:57,373 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45085714285714285 [2022-12-13 16:10:57,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2022-12-13 16:10:57,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2022-12-13 16:10:57,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:57,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2022-12-13 16:10:57,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,376 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,376 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 181 flow. Second operand 7 states and 789 transitions. [2022-12-13 16:10:57,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 463 flow [2022-12-13 16:10:57,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 461 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 16:10:57,378 INFO L231 Difference]: Finished difference. Result has 54 places, 27 transitions, 136 flow [2022-12-13 16:10:57,378 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=27} [2022-12-13 16:10:57,379 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-12-13 16:10:57,379 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 27 transitions, 136 flow [2022-12-13 16:10:57,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:57,379 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:57,379 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:10:57,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:57,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1005965559, now seen corresponding path program 3 times [2022-12-13 16:10:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:57,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091519127] [2022-12-13 16:10:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:10:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:10:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:10:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091519127] [2022-12-13 16:10:58,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091519127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:10:58,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:10:58,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:10:58,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678606764] [2022-12-13 16:10:58,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:10:58,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:10:58,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:10:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:10:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:10:58,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 16:10:58,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 27 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:58,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:10:58,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 16:10:58,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:10:58,285 INFO L130 PetriNetUnfolder]: 64/158 cut-off events. [2022-12-13 16:10:58,285 INFO L131 PetriNetUnfolder]: For 285/285 co-relation queries the response was YES. [2022-12-13 16:10:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 158 events. 64/158 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 536 event pairs, 8 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 566. Up to 59 conditions per place. [2022-12-13 16:10:58,286 INFO L137 encePairwiseOnDemand]: 242/250 looper letters, 22 selfloop transitions, 4 changer transitions 24/52 dead transitions. [2022-12-13 16:10:58,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 371 flow [2022-12-13 16:10:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:10:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:10:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1000 transitions. [2022-12-13 16:10:58,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 16:10:58,288 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1000 transitions. [2022-12-13 16:10:58,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1000 transitions. [2022-12-13 16:10:58,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:10:58,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1000 transitions. [2022-12-13 16:10:58,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:58,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:58,292 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:58,292 INFO L175 Difference]: Start difference. First operand has 54 places, 27 transitions, 136 flow. Second operand 9 states and 1000 transitions. [2022-12-13 16:10:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 371 flow [2022-12-13 16:10:58,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 343 flow, removed 8 selfloop flow, removed 7 redundant places. [2022-12-13 16:10:58,293 INFO L231 Difference]: Finished difference. Result has 55 places, 27 transitions, 135 flow [2022-12-13 16:10:58,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=135, PETRI_PLACES=55, PETRI_TRANSITIONS=27} [2022-12-13 16:10:58,294 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-13 16:10:58,294 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 135 flow [2022-12-13 16:10:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:10:58,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:10:58,294 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:58,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:10:58,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:10:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:10:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash 994274145, now seen corresponding path program 4 times [2022-12-13 16:10:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:10:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890588212] [2022-12-13 16:10:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:10:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:10:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:10:58,327 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:10:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:10:58,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:10:58,367 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:10:58,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:10:58,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:10:58,369 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:10:58,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:10:58,370 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:10:58,374 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:10:58,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:10:58,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:10:58 BasicIcfg [2022-12-13 16:10:58,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:10:58,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:10:58,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:10:58,420 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:10:58,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:10:49" (3/4) ... [2022-12-13 16:10:58,423 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:10:58,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:10:58,423 INFO L158 Benchmark]: Toolchain (without parser) took 10204.31ms. Allocated memory was 136.3MB in the beginning and 237.0MB in the end (delta: 100.7MB). Free memory was 103.7MB in the beginning and 200.0MB in the end (delta: -96.3MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-12-13 16:10:58,423 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.00ms. Allocated memory is still 136.3MB. Free memory was 103.2MB in the beginning and 76.3MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 73.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: Boogie Preprocessor took 21.73ms. Allocated memory is still 136.3MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: RCFGBuilder took 579.56ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 71.8MB in the beginning and 117.1MB in the end (delta: -45.3MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: TraceAbstraction took 9118.40ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 116.0MB in the beginning and 201.1MB in the end (delta: -85.0MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2022-12-13 16:10:58,424 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 237.0MB. Free memory is still 200.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:10:58,425 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 61.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.00ms. Allocated memory is still 136.3MB. Free memory was 103.2MB in the beginning and 76.3MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 136.3MB. Free memory was 76.3MB in the beginning and 73.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.73ms. Allocated memory is still 136.3MB. Free memory was 73.3MB in the beginning and 71.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 579.56ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 71.8MB in the beginning and 117.1MB in the end (delta: -45.3MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9118.40ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 116.0MB in the beginning and 201.1MB in the end (delta: -85.0MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 237.0MB. Free memory is still 200.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 131 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 4820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2304, independent: 2155, independent conditional: 0, independent unconditional: 2155, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1127, independent: 1103, independent conditional: 0, independent unconditional: 1103, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2304, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1127, unknown conditional: 0, unknown unconditional: 1127] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=-1, t418={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=0, t418={5:0}, t419={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=1, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={5:0}, t419={6:0}, t420={3:0}, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 848]: 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, 152 locations, 13 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: 9.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 506 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 46 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=7, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:10:58,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:11:00,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:11:00,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:11:00,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:11:00,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:11:00,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:11:00,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:11:00,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:11:00,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:11:00,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:11:00,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:11:00,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:11:00,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:11:00,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:11:00,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:11:00,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:11:00,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:11:00,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:11:00,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:11:00,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:11:00,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:11:00,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:11:00,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:11:00,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:11:00,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:11:00,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:11:00,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:11:00,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:11:00,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:11:00,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:11:00,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:11:00,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:11:00,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:11:00,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:11:00,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:11:00,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:11:00,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:11:00,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:11:00,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:11:00,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:11:00,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:11:00,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 16:11:00,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:11:00,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:11:00,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:11:00,223 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:11:00,224 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:11:00,224 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:11:00,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:11:00,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:11:00,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:11:00,226 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:11:00,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:11:00,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:11:00,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:11:00,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:11:00,229 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:11:00,229 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:11:00,229 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_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2135a1882b0d27098e68a161f8694a670a72069d61776627736073247b8e4e23 [2022-12-13 16:11:00,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:11:00,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:11:00,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:11:00,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:11:00,446 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:11:00,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 16:11:03,082 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:11:03,272 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:11:03,272 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i [2022-12-13 16:11:03,285 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/6da603f44/9d336c6c98b04708bcdfa9fc167ab134/FLAG721451051 [2022-12-13 16:11:03,299 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/data/6da603f44/9d336c6c98b04708bcdfa9fc167ab134 [2022-12-13 16:11:03,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:11:03,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:11:03,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:11:03,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:11:03,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:11:03,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c85a5f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03, skipping insertion in model container [2022-12-13 16:11:03,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:11:03,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:11:03,481 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_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 16:11:03,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:11:03,636 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:11:03,646 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_d3569d8d-7983-4d1d-965f-def18798c7e1/sv-benchmarks/c/pthread-wmm/mix016_pso.opt_tso.opt.i[956,969] [2022-12-13 16:11:03,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:11:03,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:11:03,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:11:03,724 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:11:03,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03 WrapperNode [2022-12-13 16:11:03,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:11:03,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:11:03,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:11:03,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:11:03,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,759 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-12-13 16:11:03,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:11:03,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:11:03,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:11:03,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:11:03,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:11:03,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:11:03,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:11:03,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:11:03,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (1/1) ... [2022-12-13 16:11:03,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:11:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:11:03,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:11:03,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:11:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:11:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:11:03,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:11:03,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:11:03,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:11:03,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:11:03,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:11:03,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:11:03,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:11:03,847 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 16:11:03,958 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:11:03,959 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:11:04,274 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:11:04,360 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:11:04,361 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:11:04,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:11:04 BoogieIcfgContainer [2022-12-13 16:11:04,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:11:04,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:11:04,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:11:04,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:11:04,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:11:03" (1/3) ... [2022-12-13 16:11:04,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd1ab14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:11:04, skipping insertion in model container [2022-12-13 16:11:04,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:03" (2/3) ... [2022-12-13 16:11:04,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd1ab14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:11:04, skipping insertion in model container [2022-12-13 16:11:04,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:11:04" (3/3) ... [2022-12-13 16:11:04,374 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt_tso.opt.i [2022-12-13 16:11:04,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:11:04,393 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 16:11:04,393 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:11:04,447 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:11:04,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:11:04,529 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:11:04,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:11:04,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 16:11:04,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2022-12-13 16:11:04,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2022-12-13 16:11:04,541 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:11:04,552 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:11:04,554 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2022-12-13 16:11:04,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2022-12-13 16:11:04,582 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-13 16:11:04,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:11:04,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-13 16:11:04,585 INFO L119 LiptonReduction]: Number of co-enabled transitions 2124 [2022-12-13 16:11:11,758 INFO L134 LiptonReduction]: Checked pairs total: 5160 [2022-12-13 16:11:11,758 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-13 16:11:11,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:11:11,773 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;@2d455103, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:11:11,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 16:11:11,774 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 16:11:11,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:11:11,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:11,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 16:11:11,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:11,778 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-12-13 16:11:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98041820] [2022-12-13 16:11:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:11,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:11,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:11,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 16:11:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:11,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:11:11,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:11,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:11,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:11,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98041820] [2022-12-13 16:11:11,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98041820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:11,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:11,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 16:11:11,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725515208] [2022-12-13 16:11:11,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:11,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:11:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:11,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:11:11,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:11:11,877 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2022-12-13 16:11:11,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:11,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:11,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2022-12-13 16:11:11,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:12,137 INFO L130 PetriNetUnfolder]: 1101/1661 cut-off events. [2022-12-13 16:11:12,137 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 16:11:12,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1661 events. 1101/1661 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7674 event pairs, 1101 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 3323. Up to 1637 conditions per place. [2022-12-13 16:11:12,145 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-12-13 16:11:12,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2022-12-13 16:11:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:11:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 16:11:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 259 transitions. [2022-12-13 16:11:12,155 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5242914979757085 [2022-12-13 16:11:12,155 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 259 transitions. [2022-12-13 16:11:12,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 259 transitions. [2022-12-13 16:11:12,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:12,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 259 transitions. [2022-12-13 16:11:12,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,164 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,165 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 259 transitions. [2022-12-13 16:11:12,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2022-12-13 16:11:12,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:11:12,169 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2022-12-13 16:11:12,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 16:11:12,172 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-13 16:11:12,172 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2022-12-13 16:11:12,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.5) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:12,173 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:12,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:11:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:12,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 319689426, now seen corresponding path program 1 times [2022-12-13 16:11:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415815743] [2022-12-13 16:11:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:12,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:12,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:12,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 16:11:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:12,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:11:12,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:12,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:12,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:12,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415815743] [2022-12-13 16:11:12,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415815743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:12,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:12,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:11:12,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854010713] [2022-12-13 16:11:12,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:12,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:11:12,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:12,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:11:12,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:11:12,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2022-12-13 16:11:12,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:12,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2022-12-13 16:11:12,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:12,670 INFO L130 PetriNetUnfolder]: 910/1446 cut-off events. [2022-12-13 16:11:12,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:11:12,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1446 events. 910/1446 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7126 event pairs, 146 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2839. Up to 1101 conditions per place. [2022-12-13 16:11:12,675 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 28 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2022-12-13 16:11:12,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 138 flow [2022-12-13 16:11:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:11:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:11:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2022-12-13 16:11:12,677 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060728744939271 [2022-12-13 16:11:12,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2022-12-13 16:11:12,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2022-12-13 16:11:12,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:12,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2022-12-13 16:11:12,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,680 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 375 transitions. [2022-12-13 16:11:12,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 138 flow [2022-12-13 16:11:12,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 16:11:12,681 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-13 16:11:12,681 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 16:11:12,681 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-12-13 16:11:12,681 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-12-13 16:11:12,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:12,682 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:12,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 16:11:12,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:12,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:12,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -2016042682, now seen corresponding path program 1 times [2022-12-13 16:11:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:12,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401223671] [2022-12-13 16:11:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:12,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:12,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:12,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:12,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 16:11:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:12,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 16:11:12,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:12,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:12,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:12,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401223671] [2022-12-13 16:11:12,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401223671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:12,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:12,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:11:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230451790] [2022-12-13 16:11:12,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:12,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:11:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:11:12,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:11:12,996 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-12-13 16:11:12,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:12,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:12,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-12-13 16:11:12,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:13,212 INFO L130 PetriNetUnfolder]: 514/852 cut-off events. [2022-12-13 16:11:13,212 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 16:11:13,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1788 conditions, 852 events. 514/852 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3789 event pairs, 96 based on Foata normal form. 60/875 useless extension candidates. Maximal degree in co-relation 1784. Up to 609 conditions per place. [2022-12-13 16:11:13,215 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 29 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2022-12-13 16:11:13,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 232 flow [2022-12-13 16:11:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:11:13,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:11:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-12-13 16:11:13,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48906882591093115 [2022-12-13 16:11:13,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2022-12-13 16:11:13,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2022-12-13 16:11:13,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:13,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2022-12-13 16:11:13,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,224 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 604 transitions. [2022-12-13 16:11:13,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 232 flow [2022-12-13 16:11:13,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:11:13,225 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2022-12-13 16:11:13,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-13 16:11:13,226 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 16:11:13,226 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2022-12-13 16:11:13,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,226 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:13,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:13,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:11:13,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:13,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:13,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1047393365, now seen corresponding path program 1 times [2022-12-13 16:11:13,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:13,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366314541] [2022-12-13 16:11:13,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:13,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:13,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:13,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 16:11:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:13,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:11:13,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:13,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:13,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:13,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366314541] [2022-12-13 16:11:13,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366314541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:13,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:13,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:11:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450641010] [2022-12-13 16:11:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:13,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:11:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:11:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:11:13,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-12-13 16:11:13,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:13,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-12-13 16:11:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:13,766 INFO L130 PetriNetUnfolder]: 208/392 cut-off events. [2022-12-13 16:11:13,766 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 16:11:13,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 392 events. 208/392 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1515 event pairs, 44 based on Foata normal form. 36/417 useless extension candidates. Maximal degree in co-relation 1064. Up to 136 conditions per place. [2022-12-13 16:11:13,767 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 37 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2022-12-13 16:11:13,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 336 flow [2022-12-13 16:11:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:11:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 16:11:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2022-12-13 16:11:13,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4892037786774629 [2022-12-13 16:11:13,770 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2022-12-13 16:11:13,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2022-12-13 16:11:13,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:13,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2022-12-13 16:11:13,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,773 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,773 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 725 transitions. [2022-12-13 16:11:13,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 336 flow [2022-12-13 16:11:13,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 16:11:13,775 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2022-12-13 16:11:13,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 16:11:13,776 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-13 16:11:13,776 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2022-12-13 16:11:13,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:13,776 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:13,776 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:13,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-13 16:11:13,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:13,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:13,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1992049968, now seen corresponding path program 1 times [2022-12-13 16:11:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:13,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385100026] [2022-12-13 16:11:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:13,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:13,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:13,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 16:11:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:14,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 16:11:14,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:14,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:14,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:14,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385100026] [2022-12-13 16:11:14,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385100026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:14,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:14,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:11:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996317908] [2022-12-13 16:11:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:11:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:14,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:11:14,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:11:14,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 247 [2022-12-13 16:11:14,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:14,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 247 [2022-12-13 16:11:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:14,345 INFO L130 PetriNetUnfolder]: 120/233 cut-off events. [2022-12-13 16:11:14,345 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-13 16:11:14,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 233 events. 120/233 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 768 event pairs, 39 based on Foata normal form. 10/241 useless extension candidates. Maximal degree in co-relation 704. Up to 90 conditions per place. [2022-12-13 16:11:14,346 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 34 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2022-12-13 16:11:14,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 334 flow [2022-12-13 16:11:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:11:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:11:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2022-12-13 16:11:14,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4777327935222672 [2022-12-13 16:11:14,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2022-12-13 16:11:14,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2022-12-13 16:11:14,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:14,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2022-12-13 16:11:14,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,352 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,352 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 826 transitions. [2022-12-13 16:11:14,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 334 flow [2022-12-13 16:11:14,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 16:11:14,354 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2022-12-13 16:11:14,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 16:11:14,355 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-12-13 16:11:14,355 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2022-12-13 16:11:14,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:14,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:14,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-12-13 16:11:14,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:14,556 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash -828680001, now seen corresponding path program 1 times [2022-12-13 16:11:14,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:14,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025611647] [2022-12-13 16:11:14,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:11:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:14,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:14,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:14,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 16:11:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:11:14,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:11:14,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:14,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:14,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:14,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025611647] [2022-12-13 16:11:14,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025611647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:14,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:14,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:11:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435063558] [2022-12-13 16:11:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:14,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:11:14,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:11:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:11:14,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-12-13 16:11:14,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:14,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-12-13 16:11:14,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:14,855 INFO L130 PetriNetUnfolder]: 151/320 cut-off events. [2022-12-13 16:11:14,855 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-13 16:11:14,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 320 events. 151/320 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1325 event pairs, 20 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 917. Up to 173 conditions per place. [2022-12-13 16:11:14,858 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 55 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2022-12-13 16:11:14,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 410 flow [2022-12-13 16:11:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:11:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:11:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-12-13 16:11:14,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4939271255060729 [2022-12-13 16:11:14,860 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2022-12-13 16:11:14,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2022-12-13 16:11:14,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:14,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2022-12-13 16:11:14,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,862 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,862 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 488 transitions. [2022-12-13 16:11:14,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 410 flow [2022-12-13 16:11:14,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 330 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 16:11:14,864 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 113 flow [2022-12-13 16:11:14,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-13 16:11:14,864 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-13 16:11:14,864 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 113 flow [2022-12-13 16:11:14,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:14,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:14,865 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:14,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-13 16:11:15,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:15,065 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:15,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash 346432447, now seen corresponding path program 2 times [2022-12-13 16:11:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:15,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226944121] [2022-12-13 16:11:15,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 16:11:15,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:15,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:15,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:15,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 16:11:15,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 16:11:15,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 16:11:15,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 16:11:15,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:11:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:11:15,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:11:15,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:11:15,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226944121] [2022-12-13 16:11:15,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226944121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:11:15,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:11:15,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:11:15,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103599312] [2022-12-13 16:11:15,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:11:15,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:11:15,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:11:15,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:11:15,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:11:15,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 247 [2022-12-13 16:11:15,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:15,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:11:15,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 247 [2022-12-13 16:11:15,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:11:15,338 INFO L130 PetriNetUnfolder]: 260/498 cut-off events. [2022-12-13 16:11:15,338 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-12-13 16:11:15,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 498 events. 260/498 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2136 event pairs, 47 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 1427. Up to 264 conditions per place. [2022-12-13 16:11:15,340 INFO L137 encePairwiseOnDemand]: 244/247 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 16:11:15,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 346 flow [2022-12-13 16:11:15,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:11:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:11:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 488 transitions. [2022-12-13 16:11:15,342 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4939271255060729 [2022-12-13 16:11:15,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 488 transitions. [2022-12-13 16:11:15,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 488 transitions. [2022-12-13 16:11:15,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:11:15,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 488 transitions. [2022-12-13 16:11:15,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:15,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:15,344 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:15,344 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 113 flow. Second operand 4 states and 488 transitions. [2022-12-13 16:11:15,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 346 flow [2022-12-13 16:11:15,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:11:15,346 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 125 flow [2022-12-13 16:11:15,346 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-13 16:11:15,346 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-12-13 16:11:15,346 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 125 flow [2022-12-13 16:11:15,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:11:15,346 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:11:15,346 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:11:15,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 16:11:15,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:15,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 16:11:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:11:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1550927095, now seen corresponding path program 3 times [2022-12-13 16:11:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:11:15,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847251207] [2022-12-13 16:11:15,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 16:11:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:11:15,550 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 16:11:15,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 16:11:15,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 16:11:15,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 16:11:15,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:11:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:11:15,774 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 16:11:15,775 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:11:15,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 16:11:15,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 16:11:15,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 16:11:15,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 16:11:15,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 16:11:15,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 16:11:15,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 16:11:15,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-12-13 16:11:15,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 16:11:15,979 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-13 16:11:15,983 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:11:15,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:11:16,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:11:16 BasicIcfg [2022-12-13 16:11:16,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:11:16,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:11:16,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:11:16,038 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:11:16,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:11:04" (3/4) ... [2022-12-13 16:11:16,041 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:11:16,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:11:16,042 INFO L158 Benchmark]: Toolchain (without parser) took 12739.18ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 64.2MB in the beginning and 25.3MB in the end (delta: 38.9MB). Peak memory consumption was 58.9MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,042 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:11:16,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.08ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 56.8MB in the end (delta: 7.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.96ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 53.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,043 INFO L158 Benchmark]: Boogie Preprocessor took 21.50ms. Allocated memory is still 88.1MB. Free memory was 53.8MB in the beginning and 51.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,044 INFO L158 Benchmark]: RCFGBuilder took 580.88ms. Allocated memory is still 88.1MB. Free memory was 51.7MB in the beginning and 36.6MB in the end (delta: 15.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,044 INFO L158 Benchmark]: TraceAbstraction took 11673.32ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 36.1MB in the beginning and 25.3MB in the end (delta: 10.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2022-12-13 16:11:16,044 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 107.0MB. Free memory is still 25.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:11:16,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.08ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 56.8MB in the end (delta: 7.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.96ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 53.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.50ms. Allocated memory is still 88.1MB. Free memory was 53.8MB in the beginning and 51.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.88ms. Allocated memory is still 88.1MB. Free memory was 51.7MB in the beginning and 36.6MB in the end (delta: 15.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11673.32ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 36.1MB in the beginning and 25.3MB in the end (delta: 10.9MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 107.0MB. Free memory is still 25.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: 7.2s, 132 PlacesBefore, 40 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2124 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 5160 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2362, independent: 2196, independent conditional: 0, independent unconditional: 2196, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1145, independent: 1117, independent conditional: 0, independent unconditional: 1117, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2362, independent: 1079, independent conditional: 0, independent unconditional: 1079, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1145, unknown conditional: 0, unknown unconditional: 1145] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t418; [L844] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t418, ((void *)0), P0, ((void *)0))=0, t418={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t419; [L846] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t419, ((void *)0), P1, ((void *)0))=1, t418={-6:0}, t419={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t420; [L848] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t420, ((void *)0), P2, ((void *)0))=2, t418={-6:0}, t419={-10:0}, t420={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 3 y$flush_delayed = weak$$choice2 [L805] 3 y$mem_tmp = y [L806] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L807] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L808] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L809] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L810] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L812] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 __unbuffered_p2_EAX = y [L814] 3 y = y$flush_delayed ? y$mem_tmp : y [L815] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=128, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice2=128, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t418={-6:0}, t419={-10:0}, t420={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 846]: 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, 153 locations, 13 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: 11.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 8 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 31, 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.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 213 SizeOfPredicates, 14 NumberOfNonLiveVariables, 805 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 16:11:16,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3569d8d-7983-4d1d-965f-def18798c7e1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample