./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- 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 22:09:49,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:09:49,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:09:49,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:09:49,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:09:49,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:09:49,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:09:49,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:09:49,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:09:49,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:09:49,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:09:49,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:09:49,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:09:49,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:09:49,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:09:49,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:09:49,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:09:49,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:09:49,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:09:49,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:09:49,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:09:49,842 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:09:49,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:09:49,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:09:49,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:09:49,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:09:49,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:09:49,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:09:49,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:09:49,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:09:49,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:09:49,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:09:49,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:09:49,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:09:49,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:09:49,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:09:49,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:09:49,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:09:49,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:09:49,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:09:49,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:09:49,855 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 22:09:49,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:09:49,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:09:49,875 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:09:49,875 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:09:49,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:09:49,876 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:09:49,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:09:49,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:09:49,876 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:09:49,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:09:49,877 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:09:49,877 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:09:49,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:09:49,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:09:49,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 22:09:49,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:09:49,879 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:09:49,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:09:49,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:09:49,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:09:49,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:49,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:09:49,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:09:49,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:09:49,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:09:49,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:09:49,880 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:09:49,881 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:09:49,881 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:09:49,881 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-12-13 22:09:50,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:09:50,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:09:50,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:09:50,078 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:09:50,078 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:09:50,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:09:52,684 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:09:52,835 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:09:52,836 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:09:52,844 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/0156dde06/6e7918857f7b46e19396b409099a65a6/FLAG53916a84a [2022-12-13 22:09:52,855 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/0156dde06/6e7918857f7b46e19396b409099a65a6 [2022-12-13 22:09:52,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:09:52,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:09:52,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:52,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:09:52,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:09:52,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:52" (1/1) ... [2022-12-13 22:09:52,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bdfb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:52, skipping insertion in model container [2022-12-13 22:09:52,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:09:52" (1/1) ... [2022-12-13 22:09:52,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:09:52,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:09:53,010 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:09:53,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:53,161 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:09:53,170 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:09:53,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:09:53,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:09:53,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:09:53,231 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:09:53,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53 WrapperNode [2022-12-13 22:09:53,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:09:53,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:53,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:09:53,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:09:53,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,266 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 22:09:53,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:09:53,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:09:53,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:09:53,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:09:53,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,285 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:09:53,289 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:09:53,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:09:53,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:09:53,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (1/1) ... [2022-12-13 22:09:53,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:09:53,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:09:53,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:09:53,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:09:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:09:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:09:53,349 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:09:53,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:09:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 22:09:53,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 22:09:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:09:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:09:53,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:09:53,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:09:53,351 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 22:09:53,465 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:09:53,467 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:09:53,769 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:09:53,918 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:09:53,918 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:09:53,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:53 BoogieIcfgContainer [2022-12-13 22:09:53,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:09:53,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:09:53,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:09:53,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:09:53,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:09:52" (1/3) ... [2022-12-13 22:09:53,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421f5374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:53, skipping insertion in model container [2022-12-13 22:09:53,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:09:53" (2/3) ... [2022-12-13 22:09:53,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@421f5374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:09:53, skipping insertion in model container [2022-12-13 22:09:53,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:53" (3/3) ... [2022-12-13 22:09:53,929 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:09:53,946 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:09:53,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 22:09:53,947 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:09:54,008 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:09:54,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-12-13 22:09:54,090 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-12-13 22:09:54,090 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:09:54,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 22:09:54,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 316 flow [2022-12-13 22:09:54,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 144 transitions, 300 flow [2022-12-13 22:09:54,104 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:09:54,114 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 300 flow [2022-12-13 22:09:54,117 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 300 flow [2022-12-13 22:09:54,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 300 flow [2022-12-13 22:09:54,150 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-12-13 22:09:54,150 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:09:54,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 22:09:54,154 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 22:09:57,413 INFO L134 LiptonReduction]: Checked pairs total: 11074 [2022-12-13 22:09:57,413 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-12-13 22:09:57,425 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:09:57,429 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;@34105855, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:09:57,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 22:09:57,430 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 22:09:57,431 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:09:57,431 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:57,431 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 22:09:57,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:09:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2022-12-13 22:09:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:57,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025683085] [2022-12-13 22:09:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:57,541 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 22:09:57,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025683085] [2022-12-13 22:09:57,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025683085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:57,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:57,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 22:09:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792814132] [2022-12-13 22:09:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:57,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:09:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:57,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:09:57,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:09:57,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 284 [2022-12-13 22:09:57,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:57,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:57,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 284 [2022-12-13 22:09:57,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:09:59,035 INFO L130 PetriNetUnfolder]: 9959/13590 cut-off events. [2022-12-13 22:09:59,035 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-13 22:09:59,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27178 conditions, 13590 events. 9959/13590 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 72921 event pairs, 9959 based on Foata normal form. 400/12028 useless extension candidates. Maximal degree in co-relation 27166. Up to 13371 conditions per place. [2022-12-13 22:09:59,117 INFO L137 encePairwiseOnDemand]: 275/284 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-12-13 22:09:59,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 136 flow [2022-12-13 22:09:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:09:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 22:09:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 304 transitions. [2022-12-13 22:09:59,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2022-12-13 22:09:59,129 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 304 transitions. [2022-12-13 22:09:59,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 304 transitions. [2022-12-13 22:09:59,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:09:59,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 304 transitions. [2022-12-13 22:09:59,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.0) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:59,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:59,137 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:59,139 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 304 transitions. [2022-12-13 22:09:59,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 136 flow [2022-12-13 22:09:59,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:09:59,144 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-12-13 22:09:59,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 22:09:59,148 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 22:09:59,148 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-12-13 22:09:59,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:59,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:09:59,149 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 22:09:59,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:09:59,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:09:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:09:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash 607323, now seen corresponding path program 1 times [2022-12-13 22:09:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:09:59,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552054928] [2022-12-13 22:09:59,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:09:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:09:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:09:59,387 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 22:09:59,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:09:59,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552054928] [2022-12-13 22:09:59,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552054928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:09:59,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:09:59,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:09:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465483204] [2022-12-13 22:09:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:09:59,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:09:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:09:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:09:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:09:59,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 284 [2022-12-13 22:09:59,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:09:59,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:09:59,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 284 [2022-12-13 22:09:59,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:00,430 INFO L130 PetriNetUnfolder]: 7831/10682 cut-off events. [2022-12-13 22:10:00,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:10:00,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21415 conditions, 10682 events. 7831/10682 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 54423 event pairs, 4023 based on Foata normal form. 0/9706 useless extension candidates. Maximal degree in co-relation 21412. Up to 8431 conditions per place. [2022-12-13 22:10:00,478 INFO L137 encePairwiseOnDemand]: 281/284 looper letters, 45 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2022-12-13 22:10:00,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 226 flow [2022-12-13 22:10:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:10:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:10:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2022-12-13 22:10:00,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2022-12-13 22:10:00,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2022-12-13 22:10:00,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2022-12-13 22:10:00,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:00,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2022-12-13 22:10:00,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:00,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:00,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:00,487 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 448 transitions. [2022-12-13 22:10:00,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 226 flow [2022-12-13 22:10:00,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:10:00,489 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2022-12-13 22:10:00,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 22:10:00,489 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 22:10:00,489 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2022-12-13 22:10:00,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:00,490 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:00,490 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:00,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:10:00,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash 897396806, now seen corresponding path program 1 times [2022-12-13 22:10:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:00,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008843967] [2022-12-13 22:10:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:00,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:00,704 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 22:10:00,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:00,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008843967] [2022-12-13 22:10:00,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008843967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:00,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:00,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:10:00,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784873364] [2022-12-13 22:10:00,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:00,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:00,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:00,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:00,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:00,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:00,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:00,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:00,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:00,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:04,322 INFO L130 PetriNetUnfolder]: 33375/44747 cut-off events. [2022-12-13 22:10:04,323 INFO L131 PetriNetUnfolder]: For 2158/2158 co-relation queries the response was YES. [2022-12-13 22:10:04,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92054 conditions, 44747 events. 33375/44747 cut-off events. For 2158/2158 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 250130 event pairs, 9725 based on Foata normal form. 0/43378 useless extension candidates. Maximal degree in co-relation 92050. Up to 17644 conditions per place. [2022-12-13 22:10:04,476 INFO L137 encePairwiseOnDemand]: 273/284 looper letters, 74 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2022-12-13 22:10:04,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 390 flow [2022-12-13 22:10:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:10:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:10:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2022-12-13 22:10:04,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4887323943661972 [2022-12-13 22:10:04,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2022-12-13 22:10:04,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2022-12-13 22:10:04,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:04,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2022-12-13 22:10:04,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:04,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:04,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:04,484 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 5 states and 694 transitions. [2022-12-13 22:10:04,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 390 flow [2022-12-13 22:10:04,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 92 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:04,486 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 212 flow [2022-12-13 22:10:04,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2022-12-13 22:10:04,486 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2022-12-13 22:10:04,487 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 212 flow [2022-12-13 22:10:04,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:04,487 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:04,487 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:04,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:10:04,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash 897396866, now seen corresponding path program 1 times [2022-12-13 22:10:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:04,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283396611] [2022-12-13 22:10:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:04,833 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 22:10:04,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:04,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283396611] [2022-12-13 22:10:04,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283396611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:04,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:04,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710185908] [2022-12-13 22:10:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:04,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:10:04,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:10:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:10:04,964 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 284 [2022-12-13 22:10:04,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:04,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:04,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 284 [2022-12-13 22:10:04,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:07,283 INFO L130 PetriNetUnfolder]: 19215/26939 cut-off events. [2022-12-13 22:10:07,283 INFO L131 PetriNetUnfolder]: For 19803/20649 co-relation queries the response was YES. [2022-12-13 22:10:07,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73579 conditions, 26939 events. 19215/26939 cut-off events. For 19803/20649 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 164867 event pairs, 6648 based on Foata normal form. 2321/28105 useless extension candidates. Maximal degree in co-relation 73572. Up to 24229 conditions per place. [2022-12-13 22:10:07,423 INFO L137 encePairwiseOnDemand]: 279/284 looper letters, 50 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-13 22:10:07,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 378 flow [2022-12-13 22:10:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:10:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:10:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2022-12-13 22:10:07,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4272300469483568 [2022-12-13 22:10:07,425 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2022-12-13 22:10:07,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2022-12-13 22:10:07,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:07,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2022-12-13 22:10:07,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:07,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:07,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:07,429 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 212 flow. Second operand 6 states and 728 transitions. [2022-12-13 22:10:07,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 378 flow [2022-12-13 22:10:07,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:10:07,434 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 218 flow [2022-12-13 22:10:07,435 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-13 22:10:07,435 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 22:10:07,435 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 218 flow [2022-12-13 22:10:07,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:07,437 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:07,437 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:07,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:10:07,437 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash 458259802, now seen corresponding path program 1 times [2022-12-13 22:10:07,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:07,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182520106] [2022-12-13 22:10:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:07,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:07,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:07,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182520106] [2022-12-13 22:10:07,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182520106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:07,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:07,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245021214] [2022-12-13 22:10:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:07,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:07,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:07,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:07,565 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:07,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:07,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:07,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:07,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:11,001 INFO L130 PetriNetUnfolder]: 25275/34471 cut-off events. [2022-12-13 22:10:11,001 INFO L131 PetriNetUnfolder]: For 30353/30353 co-relation queries the response was YES. [2022-12-13 22:10:11,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98738 conditions, 34471 events. 25275/34471 cut-off events. For 30353/30353 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 190630 event pairs, 3880 based on Foata normal form. 1369/35840 useless extension candidates. Maximal degree in co-relation 98730. Up to 10527 conditions per place. [2022-12-13 22:10:11,123 INFO L137 encePairwiseOnDemand]: 274/284 looper letters, 59 selfloop transitions, 9 changer transitions 67/135 dead transitions. [2022-12-13 22:10:11,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 135 transitions, 840 flow [2022-12-13 22:10:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:10:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:10:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 950 transitions. [2022-12-13 22:10:11,126 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4778672032193159 [2022-12-13 22:10:11,126 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 950 transitions. [2022-12-13 22:10:11,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 950 transitions. [2022-12-13 22:10:11,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:11,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 950 transitions. [2022-12-13 22:10:11,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.71428571428572) internal successors, (950), 7 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:11,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:11,133 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:11,133 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 218 flow. Second operand 7 states and 950 transitions. [2022-12-13 22:10:11,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 135 transitions, 840 flow [2022-12-13 22:10:11,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 135 transitions, 833 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:11,143 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 251 flow [2022-12-13 22:10:11,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2022-12-13 22:10:11,144 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2022-12-13 22:10:11,144 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 251 flow [2022-12-13 22:10:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:11,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:11,144 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:10:11,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:11,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -779813744, now seen corresponding path program 1 times [2022-12-13 22:10:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473989231] [2022-12-13 22:10:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:11,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:11,241 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 22:10:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:11,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473989231] [2022-12-13 22:10:11,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473989231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:11,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:11,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410333225] [2022-12-13 22:10:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:11,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:11,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:11,264 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:11,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:11,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:11,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:11,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:13,592 INFO L130 PetriNetUnfolder]: 19711/26881 cut-off events. [2022-12-13 22:10:13,592 INFO L131 PetriNetUnfolder]: For 63554/63554 co-relation queries the response was YES. [2022-12-13 22:10:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88187 conditions, 26881 events. 19711/26881 cut-off events. For 63554/63554 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 145745 event pairs, 2055 based on Foata normal form. 893/27774 useless extension candidates. Maximal degree in co-relation 88174. Up to 11748 conditions per place. [2022-12-13 22:10:13,704 INFO L137 encePairwiseOnDemand]: 273/284 looper letters, 65 selfloop transitions, 20 changer transitions 45/130 dead transitions. [2022-12-13 22:10:13,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 130 transitions, 953 flow [2022-12-13 22:10:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:10:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:10:13,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2022-12-13 22:10:13,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47937625754527163 [2022-12-13 22:10:13,707 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2022-12-13 22:10:13,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2022-12-13 22:10:13,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:13,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2022-12-13 22:10:13,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:13,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:13,711 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:13,711 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 251 flow. Second operand 7 states and 953 transitions. [2022-12-13 22:10:13,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 130 transitions, 953 flow [2022-12-13 22:10:13,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 864 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:13,917 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 425 flow [2022-12-13 22:10:13,917 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=425, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2022-12-13 22:10:13,918 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2022-12-13 22:10:13,918 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 425 flow [2022-12-13 22:10:13,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:13,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:13,919 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:13,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:10:13,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1843197546, now seen corresponding path program 1 times [2022-12-13 22:10:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371298386] [2022-12-13 22:10:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:13,998 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 22:10:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:13,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371298386] [2022-12-13 22:10:13,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371298386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:13,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:13,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:10:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558445983] [2022-12-13 22:10:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:14,009 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 284 [2022-12-13 22:10:14,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 425 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:14,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:14,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 284 [2022-12-13 22:10:14,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:16,100 INFO L130 PetriNetUnfolder]: 15640/22296 cut-off events. [2022-12-13 22:10:16,101 INFO L131 PetriNetUnfolder]: For 68587/69582 co-relation queries the response was YES. [2022-12-13 22:10:16,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75885 conditions, 22296 events. 15640/22296 cut-off events. For 68587/69582 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 132567 event pairs, 6688 based on Foata normal form. 1165/23234 useless extension candidates. Maximal degree in co-relation 75868. Up to 18089 conditions per place. [2022-12-13 22:10:16,217 INFO L137 encePairwiseOnDemand]: 279/284 looper letters, 62 selfloop transitions, 10 changer transitions 27/111 dead transitions. [2022-12-13 22:10:16,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 952 flow [2022-12-13 22:10:16,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:10:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:10:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-12-13 22:10:16,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5014084507042254 [2022-12-13 22:10:16,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-12-13 22:10:16,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-12-13 22:10:16,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:16,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-12-13 22:10:16,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:16,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:16,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:16,223 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 425 flow. Second operand 5 states and 712 transitions. [2022-12-13 22:10:16,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 952 flow [2022-12-13 22:10:16,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 920 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:16,558 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 549 flow [2022-12-13 22:10:16,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=549, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2022-12-13 22:10:16,559 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2022-12-13 22:10:16,559 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 549 flow [2022-12-13 22:10:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:16,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:16,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:16,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:10:16,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1501195791, now seen corresponding path program 1 times [2022-12-13 22:10:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:16,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785646972] [2022-12-13 22:10:16,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:16,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:16,680 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 22:10:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:16,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785646972] [2022-12-13 22:10:16,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785646972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:16,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789665487] [2022-12-13 22:10:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:16,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:16,702 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:16,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:16,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:16,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:16,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:20,307 INFO L130 PetriNetUnfolder]: 26100/35784 cut-off events. [2022-12-13 22:10:20,307 INFO L131 PetriNetUnfolder]: For 114204/114204 co-relation queries the response was YES. [2022-12-13 22:10:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124512 conditions, 35784 events. 26100/35784 cut-off events. For 114204/114204 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 205014 event pairs, 4328 based on Foata normal form. 963/36747 useless extension candidates. Maximal degree in co-relation 124493. Up to 13446 conditions per place. [2022-12-13 22:10:20,456 INFO L137 encePairwiseOnDemand]: 273/284 looper letters, 71 selfloop transitions, 34 changer transitions 44/149 dead transitions. [2022-12-13 22:10:20,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 149 transitions, 1263 flow [2022-12-13 22:10:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:10:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:10:20,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2022-12-13 22:10:20,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48088531187122735 [2022-12-13 22:10:20,459 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2022-12-13 22:10:20,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2022-12-13 22:10:20,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:20,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2022-12-13 22:10:20,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:20,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:20,463 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:20,463 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 549 flow. Second operand 7 states and 956 transitions. [2022-12-13 22:10:20,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 149 transitions, 1263 flow [2022-12-13 22:10:20,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 149 transitions, 1233 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:20,796 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 748 flow [2022-12-13 22:10:20,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=748, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2022-12-13 22:10:20,796 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2022-12-13 22:10:20,796 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 748 flow [2022-12-13 22:10:20,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.2) internal successors, (616), 5 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:20,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:20,797 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:20,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:10:20,797 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1526130858, now seen corresponding path program 1 times [2022-12-13 22:10:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:20,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273322354] [2022-12-13 22:10:20,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:20,873 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 22:10:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:20,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273322354] [2022-12-13 22:10:20,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273322354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:20,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:20,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:10:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920752552] [2022-12-13 22:10:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:20,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:10:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:10:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:10:20,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 284 [2022-12-13 22:10:20,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:20,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:20,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 284 [2022-12-13 22:10:20,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:21,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][97], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 97#L874true, 52#L782true, 203#true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 229#true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 141#L838true, 93#L762true]) [2022-12-13 22:10:21,746 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 22:10:21,746 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 22:10:21,746 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 22:10:21,746 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 22:10:21,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][97], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 97#L874true, 52#L782true, 203#true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 229#true, 40#L769true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 141#L838true]) [2022-12-13 22:10:21,926 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,926 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,926 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,926 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([426] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 47#L822true, Black: 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), 138#L789true, Black: 203#true, Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 97#L874true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 229#true, Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), 40#L769true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 169#true, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 22:10:21,927 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][97], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 43#L880true, 52#L782true, 203#true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 229#true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 141#L838true, 93#L762true]) [2022-12-13 22:10:21,927 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,927 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:21,928 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([440] L822-->L838: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse11 (not .cse10)) (.cse4 (and .cse10 (= (mod v_~a$w_buff1_used~0_131 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse9 .cse10))) (let ((.cse1 (or .cse4 .cse12 .cse6)) (.cse2 (and (not .cse12) .cse11))) (let ((.cse3 (ite .cse1 v_~a~0_87 (ite .cse2 v_~a$w_buff0~0_71 v_~a$w_buff1~0_62))) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0))) (.cse8 (= (mod v_~a$w_buff1_used~0_130 256) 0)) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 v_~a$w_buff0_used~0_150 (ite .cse2 0 v_~a$w_buff0_used~0_150))) v_~a$w_buff0_used~0_149) (= v_~a~0_86 (ite .cse0 v_~a$mem_tmp~0_14 .cse3)) (= v_~weak$$choice2~0_34 |v_P3Thread1of1ForFork0_#t~nondet4_1|) (= v_~a$flush_delayed~0_21 0) (= (ite .cse0 v_~a$w_buff1_used~0_131 (ite (or .cse4 .cse5 .cse6) v_~a$w_buff1_used~0_131 0)) v_~a$w_buff1_used~0_130) (= .cse3 v_~__unbuffered_p3_EBX~0_10) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork0_#t~nondet3_1|) (= v_~a$w_buff0~0_71 v_~a$w_buff0~0_70) (= v_~a~0_87 v_~a$mem_tmp~0_14) (= v_~a$w_buff1~0_62 v_~a$w_buff1~0_61) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse7 .cse8) .cse5 (and .cse7 .cse9))) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse10 .cse8) .cse5 .cse6) v_~a$r_buff0_thd4~0_60 (ite (and .cse11 (not .cse5)) 0 v_~a$r_buff0_thd4~0_60))) v_~a$r_buff0_thd4~0_59)))))) InVars {~a~0=v_~a~0_87, ~a$w_buff1~0=v_~a$w_buff1~0_62, ~a$w_buff0~0=v_~a$w_buff0~0_71, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_131, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, ~a~0=v_~a~0_86, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_61, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_70, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_34} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][97], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), Black: 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), Black: 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 43#L880true, 52#L782true, 203#true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), Black: 171#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 229#true, 40#L769true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 141#L838true]) [2022-12-13 22:10:22,189 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([426] L782-->L789: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd2~0_20 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_22 256) 0)))) (let ((.cse3 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_75 256) 0)) .cse0))) (and (= v_~a$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~a$w_buff1_used~0_74 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd2~0_21 256) 0)))) 0 v_~a$r_buff1_thd2~0_20)) (= v_~a$r_buff0_thd2~0_21 (ite .cse2 0 v_~a$r_buff0_thd2~0_22)) (= v_~a$w_buff0_used~0_85 (ite .cse3 0 v_~a$w_buff0_used~0_86)) (= v_~a~0_42 (ite .cse3 v_~a$w_buff0~0_32 (ite .cse4 v_~a$w_buff1~0_27 v_~a~0_43))) (= (ite (or .cse2 .cse4) 0 v_~a$w_buff1_used~0_75) v_~a$w_buff1_used~0_74)))) InVars {~a~0=v_~a~0_43, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_20, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_22, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_75} OutVars{~a~0=v_~a~0_42, ~a$w_buff1~0=v_~a$w_buff1~0_27, ~a$w_buff0~0=v_~a$w_buff0~0_32, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_19, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_21, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_74} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][36], [Black: 189#(<= ~__unbuffered_p3_EAX~0 0), 190#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 47#L822true, Black: 187#true, 54#P2EXITtrue, 185#(and (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t801~0#1.base|)) (not (= |ULTIMATE.start_main_~#t803~0#1.base| |ULTIMATE.start_main_~#t802~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t802~0#1.base| 0) |ULTIMATE.start_main_~#t801~0#1.base| 0) |ULTIMATE.start_main_~#t803~0#1.base| 0) |ULTIMATE.start_main_~#t804~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t801~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|)) (not (= |ULTIMATE.start_main_~#t802~0#1.base| |ULTIMATE.start_main_~#t804~0#1.base|))), 231#(= ~y~0 1), Black: 205#(= ~y~0 0), 138#L789true, Black: 203#true, Black: 209#(and (= ~y~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), P3Thread1of1ForFork0InUse, 245#true, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 224#(and (= ~x~0 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 221#(= ~x~0 0), 162#true, 43#L880true, Black: 235#(and (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (= ~y~0 1)), 40#L769true, Black: 172#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 229#true, Black: 233#(<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|), Black: 169#true, Black: 174#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 237#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)), Black: 232#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 206#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-13 22:10:22,189 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,189 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-13 22:10:22,665 INFO L130 PetriNetUnfolder]: 10955/16338 cut-off events. [2022-12-13 22:10:22,665 INFO L131 PetriNetUnfolder]: For 70959/73209 co-relation queries the response was YES. [2022-12-13 22:10:22,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56729 conditions, 16338 events. 10955/16338 cut-off events. For 70959/73209 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 103877 event pairs, 2438 based on Foata normal form. 892/16947 useless extension candidates. Maximal degree in co-relation 56708. Up to 13805 conditions per place. [2022-12-13 22:10:22,739 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 76 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2022-12-13 22:10:22,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 1235 flow [2022-12-13 22:10:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:10:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:10:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-12-13 22:10:22,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5035211267605634 [2022-12-13 22:10:22,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-12-13 22:10:22,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-12-13 22:10:22,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:22,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-12-13 22:10:22,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:22,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:22,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 284.0) internal successors, (1136), 4 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:22,743 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 748 flow. Second operand 3 states and 429 transitions. [2022-12-13 22:10:22,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 1235 flow [2022-12-13 22:10:22,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 1223 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:22,829 INFO L231 Difference]: Finished difference. Result has 69 places, 73 transitions, 771 flow [2022-12-13 22:10:22,829 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2022-12-13 22:10:22,829 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2022-12-13 22:10:22,829 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 771 flow [2022-12-13 22:10:22,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:22,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:22,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:22,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:10:22,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:22,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:22,830 INFO L85 PathProgramCache]: Analyzing trace with hash 824779777, now seen corresponding path program 1 times [2022-12-13 22:10:22,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:22,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080867904] [2022-12-13 22:10:22,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:22,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:22,937 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 22:10:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:22,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080867904] [2022-12-13 22:10:22,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080867904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:22,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:22,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:22,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605856170] [2022-12-13 22:10:22,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:22,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:22,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:22,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 771 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:22,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:22,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:22,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:26,533 INFO L130 PetriNetUnfolder]: 21432/31053 cut-off events. [2022-12-13 22:10:26,533 INFO L131 PetriNetUnfolder]: For 140913/140913 co-relation queries the response was YES. [2022-12-13 22:10:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123712 conditions, 31053 events. 21432/31053 cut-off events. For 140913/140913 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 196595 event pairs, 5841 based on Foata normal form. 612/31665 useless extension candidates. Maximal degree in co-relation 123691. Up to 12583 conditions per place. [2022-12-13 22:10:26,657 INFO L137 encePairwiseOnDemand]: 273/284 looper letters, 90 selfloop transitions, 33 changer transitions 57/180 dead transitions. [2022-12-13 22:10:26,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 180 transitions, 1898 flow [2022-12-13 22:10:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:10:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 22:10:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 955 transitions. [2022-12-13 22:10:26,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48038229376257546 [2022-12-13 22:10:26,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 955 transitions. [2022-12-13 22:10:26,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 955 transitions. [2022-12-13 22:10:26,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:26,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 955 transitions. [2022-12-13 22:10:26,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.42857142857142) internal successors, (955), 7 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:26,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:26,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 284.0) internal successors, (2272), 8 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:26,663 INFO L175 Difference]: Start difference. First operand has 69 places, 73 transitions, 771 flow. Second operand 7 states and 955 transitions. [2022-12-13 22:10:26,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 180 transitions, 1898 flow [2022-12-13 22:10:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 1877 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 22:10:26,875 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 985 flow [2022-12-13 22:10:26,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=985, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2022-12-13 22:10:26,875 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2022-12-13 22:10:26,875 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 985 flow [2022-12-13 22:10:26,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:26,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:26,876 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:26,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:10:26,876 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2017940950, now seen corresponding path program 1 times [2022-12-13 22:10:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:26,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935580719] [2022-12-13 22:10:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:26,969 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 22:10:26,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:26,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935580719] [2022-12-13 22:10:26,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935580719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:26,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:26,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773088960] [2022-12-13 22:10:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:26,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 284 [2022-12-13 22:10:26,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 985 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:26,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:26,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 284 [2022-12-13 22:10:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:28,413 INFO L130 PetriNetUnfolder]: 7266/11570 cut-off events. [2022-12-13 22:10:28,413 INFO L131 PetriNetUnfolder]: For 56953/57959 co-relation queries the response was YES. [2022-12-13 22:10:28,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43897 conditions, 11570 events. 7266/11570 cut-off events. For 56953/57959 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 77666 event pairs, 1364 based on Foata normal form. 1088/12438 useless extension candidates. Maximal degree in co-relation 43871. Up to 5865 conditions per place. [2022-12-13 22:10:28,459 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 112 selfloop transitions, 9 changer transitions 1/146 dead transitions. [2022-12-13 22:10:28,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 146 transitions, 2001 flow [2022-12-13 22:10:28,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:10:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:10:28,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-12-13 22:10:28,461 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5052816901408451 [2022-12-13 22:10:28,461 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2022-12-13 22:10:28,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2022-12-13 22:10:28,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:28,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2022-12-13 22:10:28,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:28,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:28,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 284.0) internal successors, (1420), 5 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:28,463 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 985 flow. Second operand 4 states and 574 transitions. [2022-12-13 22:10:28,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 146 transitions, 2001 flow [2022-12-13 22:10:28,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 146 transitions, 1973 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 22:10:28,525 INFO L231 Difference]: Finished difference. Result has 80 places, 81 transitions, 1023 flow [2022-12-13 22:10:28,525 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1023, PETRI_PLACES=80, PETRI_TRANSITIONS=81} [2022-12-13 22:10:28,525 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2022-12-13 22:10:28,526 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 1023 flow [2022-12-13 22:10:28,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:28,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:28,526 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:28,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:10:28,526 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:28,526 INFO L85 PathProgramCache]: Analyzing trace with hash -988726503, now seen corresponding path program 1 times [2022-12-13 22:10:28,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:28,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438999023] [2022-12-13 22:10:28,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:28,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:28,628 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 22:10:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:28,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438999023] [2022-12-13 22:10:28,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438999023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:28,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:28,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167306061] [2022-12-13 22:10:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:28,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:28,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:28,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 284 [2022-12-13 22:10:28,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 1023 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:28,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:28,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 284 [2022-12-13 22:10:28,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:31,064 INFO L130 PetriNetUnfolder]: 13091/20222 cut-off events. [2022-12-13 22:10:31,065 INFO L131 PetriNetUnfolder]: For 123116/123116 co-relation queries the response was YES. [2022-12-13 22:10:31,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89381 conditions, 20222 events. 13091/20222 cut-off events. For 123116/123116 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 134831 event pairs, 2493 based on Foata normal form. 150/20372 useless extension candidates. Maximal degree in co-relation 89354. Up to 9959 conditions per place. [2022-12-13 22:10:31,136 INFO L137 encePairwiseOnDemand]: 273/284 looper letters, 88 selfloop transitions, 36 changer transitions 42/166 dead transitions. [2022-12-13 22:10:31,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 166 transitions, 2104 flow [2022-12-13 22:10:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:10:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:10:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2022-12-13 22:10:31,138 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4838028169014085 [2022-12-13 22:10:31,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2022-12-13 22:10:31,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2022-12-13 22:10:31,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:31,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2022-12-13 22:10:31,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:31,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:31,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:31,141 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 1023 flow. Second operand 5 states and 687 transitions. [2022-12-13 22:10:31,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 166 transitions, 2104 flow [2022-12-13 22:10:31,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 166 transitions, 2042 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:31,367 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 1015 flow [2022-12-13 22:10:31,368 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1015, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2022-12-13 22:10:31,368 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2022-12-13 22:10:31,368 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 1015 flow [2022-12-13 22:10:31,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:31,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:31,368 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:31,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:10:31,368 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:31,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:31,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1521479893, now seen corresponding path program 2 times [2022-12-13 22:10:31,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:31,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553130821] [2022-12-13 22:10:31,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:31,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:10:31,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:31,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553130821] [2022-12-13 22:10:31,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553130821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:31,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:31,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476117226] [2022-12-13 22:10:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:31,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:31,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:31,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:31,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 284 [2022-12-13 22:10:31,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 1015 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:31,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:31,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 284 [2022-12-13 22:10:31,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:32,597 INFO L130 PetriNetUnfolder]: 5299/8766 cut-off events. [2022-12-13 22:10:32,597 INFO L131 PetriNetUnfolder]: For 40310/40705 co-relation queries the response was YES. [2022-12-13 22:10:32,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34156 conditions, 8766 events. 5299/8766 cut-off events. For 40310/40705 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 60769 event pairs, 1062 based on Foata normal form. 640/9237 useless extension candidates. Maximal degree in co-relation 34128. Up to 3310 conditions per place. [2022-12-13 22:10:32,630 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 114 selfloop transitions, 13 changer transitions 18/164 dead transitions. [2022-12-13 22:10:32,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 164 transitions, 2335 flow [2022-12-13 22:10:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:10:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:10:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-12-13 22:10:32,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5049295774647887 [2022-12-13 22:10:32,632 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-12-13 22:10:32,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-12-13 22:10:32,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:32,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-12-13 22:10:32,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:32,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:32,635 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:32,635 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 1015 flow. Second operand 5 states and 717 transitions. [2022-12-13 22:10:32,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 164 transitions, 2335 flow [2022-12-13 22:10:32,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 164 transitions, 2255 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:32,678 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 960 flow [2022-12-13 22:10:32,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=972, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=960, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2022-12-13 22:10:32,678 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2022-12-13 22:10:32,678 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 960 flow [2022-12-13 22:10:32,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:32,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:32,679 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:32,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:10:32,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:32,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1449771731, now seen corresponding path program 1 times [2022-12-13 22:10:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:32,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967521660] [2022-12-13 22:10:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:32,845 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 22:10:32,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967521660] [2022-12-13 22:10:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967521660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:32,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:10:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729004125] [2022-12-13 22:10:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:10:32,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:10:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:10:32,858 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 284 [2022-12-13 22:10:32,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 960 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:32,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:32,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 284 [2022-12-13 22:10:32,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:33,837 INFO L130 PetriNetUnfolder]: 4592/7553 cut-off events. [2022-12-13 22:10:33,837 INFO L131 PetriNetUnfolder]: For 34032/34383 co-relation queries the response was YES. [2022-12-13 22:10:33,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32064 conditions, 7553 events. 4592/7553 cut-off events. For 34032/34383 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 52215 event pairs, 943 based on Foata normal form. 211/7602 useless extension candidates. Maximal degree in co-relation 32035. Up to 3035 conditions per place. [2022-12-13 22:10:33,865 INFO L137 encePairwiseOnDemand]: 278/284 looper letters, 53 selfloop transitions, 17 changer transitions 76/150 dead transitions. [2022-12-13 22:10:33,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 150 transitions, 2047 flow [2022-12-13 22:10:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:10:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:10:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2022-12-13 22:10:33,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49589201877934275 [2022-12-13 22:10:33,867 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2022-12-13 22:10:33,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2022-12-13 22:10:33,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:33,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2022-12-13 22:10:33,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:33,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:33,870 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 284.0) internal successors, (1988), 7 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:33,870 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 960 flow. Second operand 6 states and 845 transitions. [2022-12-13 22:10:33,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 150 transitions, 2047 flow [2022-12-13 22:10:34,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 150 transitions, 1972 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-13 22:10:34,199 INFO L231 Difference]: Finished difference. Result has 83 places, 41 transitions, 339 flow [2022-12-13 22:10:34,199 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=83, PETRI_TRANSITIONS=41} [2022-12-13 22:10:34,200 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2022-12-13 22:10:34,200 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 41 transitions, 339 flow [2022-12-13 22:10:34,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:34,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:34,200 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:34,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:10:34,200 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash 146311896, now seen corresponding path program 1 times [2022-12-13 22:10:34,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:34,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384938611] [2022-12-13 22:10:34,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:34,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:34,913 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 22:10:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:10:34,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384938611] [2022-12-13 22:10:34,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384938611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:34,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:34,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:10:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388184975] [2022-12-13 22:10:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:34,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:10:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:10:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:10:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:10:35,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 284 [2022-12-13 22:10:35,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 41 transitions, 339 flow. Second operand has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:35,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:35,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 284 [2022-12-13 22:10:35,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:35,456 INFO L130 PetriNetUnfolder]: 679/1079 cut-off events. [2022-12-13 22:10:35,457 INFO L131 PetriNetUnfolder]: For 3696/3696 co-relation queries the response was YES. [2022-12-13 22:10:35,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4670 conditions, 1079 events. 679/1079 cut-off events. For 3696/3696 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4090 event pairs, 35 based on Foata normal form. 1/1080 useless extension candidates. Maximal degree in co-relation 4645. Up to 444 conditions per place. [2022-12-13 22:10:35,460 INFO L137 encePairwiseOnDemand]: 272/284 looper letters, 60 selfloop transitions, 9 changer transitions 40/109 dead transitions. [2022-12-13 22:10:35,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1008 flow [2022-12-13 22:10:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:10:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 22:10:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2022-12-13 22:10:35,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4354460093896714 [2022-12-13 22:10:35,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2022-12-13 22:10:35,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2022-12-13 22:10:35,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:35,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2022-12-13 22:10:35,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:35,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:35,467 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 284.0) internal successors, (2840), 10 states have internal predecessors, (2840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:35,467 INFO L175 Difference]: Start difference. First operand has 83 places, 41 transitions, 339 flow. Second operand 9 states and 1113 transitions. [2022-12-13 22:10:35,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1008 flow [2022-12-13 22:10:35,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 109 transitions, 662 flow, removed 51 selfloop flow, removed 31 redundant places. [2022-12-13 22:10:35,478 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 191 flow [2022-12-13 22:10:35,479 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=284, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=191, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2022-12-13 22:10:35,479 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2022-12-13 22:10:35,479 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 191 flow [2022-12-13 22:10:35,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:35,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:35,480 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:35,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:10:35,480 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 552281762, now seen corresponding path program 2 times [2022-12-13 22:10:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:10:35,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923847858] [2022-12-13 22:10:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:10:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:10:35,533 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:10:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:10:35,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:10:35,625 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:10:35,626 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 22:10:35,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 22:10:35,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 22:10:35,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 22:10:35,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 22:10:35,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 22:10:35,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 22:10:35,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:10:35,630 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:35,636 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:10:35,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:10:35,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:10:35 BasicIcfg [2022-12-13 22:10:35,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:10:35,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:10:35,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:10:35,695 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:10:35,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:09:53" (3/4) ... [2022-12-13 22:10:35,697 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:10:35,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:10:35,698 INFO L158 Benchmark]: Toolchain (without parser) took 42840.08ms. Allocated memory was 140.5MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 103.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 22:10:35,698 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:10:35,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.16ms. Allocated memory is still 140.5MB. Free memory was 103.7MB in the beginning and 75.3MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 22:10:35,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.27ms. Allocated memory is still 140.5MB. Free memory was 75.3MB in the beginning and 73.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:10:35,699 INFO L158 Benchmark]: Boogie Preprocessor took 21.49ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:10:35,699 INFO L158 Benchmark]: RCFGBuilder took 631.92ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 71.1MB in the beginning and 118.9MB in the end (delta: -47.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-12-13 22:10:35,699 INFO L158 Benchmark]: TraceAbstraction took 41770.63ms. Allocated memory was 169.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 117.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-12-13 22:10:35,700 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 3.5GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:10:35,701 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.14ms. Allocated memory is still 140.5MB. Free memory is still 113.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.16ms. Allocated memory is still 140.5MB. Free memory was 103.7MB in the beginning and 75.3MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.27ms. Allocated memory is still 140.5MB. Free memory was 75.3MB in the beginning and 73.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.49ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.92ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 71.1MB in the beginning and 118.9MB in the end (delta: -47.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41770.63ms. Allocated memory was 169.9MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 117.9MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 3.5GB. Free memory is still 2.1GB. 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, 155 PlacesBefore, 54 PlacesAfterwards, 144 TransitionsBefore, 42 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 11074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4468, independent: 4216, independent conditional: 0, independent unconditional: 4216, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1960, independent: 1911, independent conditional: 0, independent unconditional: 1911, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4468, independent: 2305, independent conditional: 0, independent unconditional: 2305, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 1960, unknown conditional: 0, unknown unconditional: 1960] , Statistics on independence cache: Total cache size (in pairs): 209, Positive cache size: 182, Positive conditional cache size: 0, Positive unconditional cache size: 182, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-4, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-3, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=-2, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=-1, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=2, y=2, z=2] [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=49, weak$$choice2=255, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice2=255, x=2, y=2, z=2] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 865]: 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: 867]: 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: 863]: 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 9 procedures, 185 locations, 16 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: 41.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1102 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 946 mSDsluCounter, 584 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 520 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2326 IncrementalHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 64 mSDtfsCounter, 2326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=11, InterpolantAutomatonStates: 81, 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, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 22:10:35,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --- 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 22:10:37,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:10:37,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:10:37,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:10:37,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:10:37,450 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:10:37,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:10:37,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:10:37,453 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:10:37,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:10:37,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:10:37,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:10:37,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:10:37,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:10:37,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:10:37,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:10:37,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:10:37,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:10:37,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:10:37,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:10:37,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:10:37,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:10:37,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:10:37,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:10:37,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:10:37,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:10:37,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:10:37,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:10:37,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:10:37,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:10:37,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:10:37,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:10:37,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:10:37,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:10:37,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:10:37,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:10:37,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:10:37,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:10:37,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:10:37,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:10:37,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:10:37,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 22:10:37,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:10:37,506 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:10:37,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:10:37,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:10:37,507 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:10:37,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:10:37,508 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:10:37,508 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:10:37,508 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:10:37,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:10:37,508 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:10:37,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:10:37,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:10:37,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:10:37,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:10:37,509 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 22:10:37,510 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 22:10:37,510 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 22:10:37,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:10:37,510 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 22:10:37,510 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 22:10:37,511 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 22:10:37,511 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:10:37,511 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:10:37,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:10:37,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:10:37,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:10:37,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:10:37,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:10:37,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:10:37,512 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 22:10:37,512 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 22:10:37,513 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:10:37,513 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:10:37,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:10:37,513 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 22:10:37,513 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:10:37,514 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e [2022-12-13 22:10:37,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:10:37,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:10:37,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:10:37,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:10:37,766 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:10:37,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:10:40,382 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:10:40,577 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:10:40,578 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:10:40,590 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/eb81bde3f/497b5d3d8d7047e4955fb8d87358e3c4/FLAG741849776 [2022-12-13 22:10:40,602 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/data/eb81bde3f/497b5d3d8d7047e4955fb8d87358e3c4 [2022-12-13 22:10:40,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:10:40,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:10:40,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:10:40,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:10:40,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:10:40,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:10:40" (1/1) ... [2022-12-13 22:10:40,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15816a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:40, skipping insertion in model container [2022-12-13 22:10:40,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:10:40" (1/1) ... [2022-12-13 22:10:40,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:10:40,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:10:40,789 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:10:40,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:40,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:40,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:10:40,996 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:10:41,008 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_9aaa38b9-47b9-4c24-af89-ed996b5376a1/sv-benchmarks/c/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 22:10:41,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,042 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,053 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:10:41,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:10:41,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:10:41,098 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:10:41,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41 WrapperNode [2022-12-13 22:10:41,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:10:41,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:10:41,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:10:41,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:10:41,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,147 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 22:10:41,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:10:41,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:10:41,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:10:41,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:10:41,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,174 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:10:41,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:10:41,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:10:41,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:10:41,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (1/1) ... [2022-12-13 22:10:41,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:10:41,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:10:41,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:10:41,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 22:10:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 22:10:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:10:41,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:10:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:10:41,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:10:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:10:41,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:10:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 22:10:41,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 22:10:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:10:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:10:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:10:41,247 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 22:10:41,374 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:10:41,376 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:10:41,701 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:10:41,773 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:10:41,773 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:10:41,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:10:41 BoogieIcfgContainer [2022-12-13 22:10:41,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:10:41,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:10:41,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:10:41,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:10:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:10:40" (1/3) ... [2022-12-13 22:10:41,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12df8ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:10:41, skipping insertion in model container [2022-12-13 22:10:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:10:41" (2/3) ... [2022-12-13 22:10:41,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12df8ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:10:41, skipping insertion in model container [2022-12-13 22:10:41,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:10:41" (3/3) ... [2022-12-13 22:10:41,781 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 22:10:41,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:10:41,794 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 22:10:41,795 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:10:41,842 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:10:41,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 22:10:41,910 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 22:10:41,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:10:41,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 22:10:41,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-12-13 22:10:41,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-12-13 22:10:41,921 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:10:41,929 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 22:10:41,931 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-12-13 22:10:41,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-12-13 22:10:41,954 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-12-13 22:10:41,954 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:10:41,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 22:10:41,956 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-12-13 22:10:48,008 INFO L134 LiptonReduction]: Checked pairs total: 11023 [2022-12-13 22:10:48,008 INFO L136 LiptonReduction]: Total number of compositions: 141 [2022-12-13 22:10:48,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:10:48,029 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;@1212019a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:10:48,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 22:10:48,030 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 22:10:48,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:10:48,031 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:48,031 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 22:10:48,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times [2022-12-13 22:10:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512148284] [2022-12-13 22:10:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:48,049 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 22:10:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:48,050 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:48,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 22:10:48,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:48,149 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 22:10:48,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:48,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:48,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512148284] [2022-12-13 22:10:48,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512148284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:48,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:48,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 22:10:48,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771226472] [2022-12-13 22:10:48,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:48,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 22:10:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 22:10:48,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 22:10:48,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 290 [2022-12-13 22:10:48,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:48,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:48,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 290 [2022-12-13 22:10:48,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:49,623 INFO L130 PetriNetUnfolder]: 9959/13454 cut-off events. [2022-12-13 22:10:49,623 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 22:10:49,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27042 conditions, 13454 events. 9959/13454 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 70790 event pairs, 9959 based on Foata normal form. 400/11810 useless extension candidates. Maximal degree in co-relation 27030. Up to 13371 conditions per place. [2022-12-13 22:10:49,680 INFO L137 encePairwiseOnDemand]: 281/290 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2022-12-13 22:10:49,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 136 flow [2022-12-13 22:10:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 22:10:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 22:10:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2022-12-13 22:10:49,691 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2022-12-13 22:10:49,691 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2022-12-13 22:10:49,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2022-12-13 22:10:49,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:49,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2022-12-13 22:10:49,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:49,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:49,701 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:49,703 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 306 transitions. [2022-12-13 22:10:49,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 136 flow [2022-12-13 22:10:49,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:49,709 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2022-12-13 22:10:49,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 22:10:49,713 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 22:10:49,714 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2022-12-13 22:10:49,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:49,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:49,714 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 22:10:49,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:49,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 615138, now seen corresponding path program 1 times [2022-12-13 22:10:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994162755] [2022-12-13 22:10:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:49,917 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 22:10:49,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:49,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:49,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:49,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:10:49,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:50,000 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 22:10:50,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:50,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:50,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994162755] [2022-12-13 22:10:50,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994162755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:50,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:50,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:10:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612095128] [2022-12-13 22:10:50,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:50,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:10:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:10:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:10:50,007 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 290 [2022-12-13 22:10:50,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:50,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:50,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 290 [2022-12-13 22:10:50,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:51,122 INFO L130 PetriNetUnfolder]: 7831/11259 cut-off events. [2022-12-13 22:10:51,122 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:10:51,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21992 conditions, 11259 events. 7831/11259 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 69678 event pairs, 1447 based on Foata normal form. 0/10267 useless extension candidates. Maximal degree in co-relation 21989. Up to 8431 conditions per place. [2022-12-13 22:10:51,154 INFO L137 encePairwiseOnDemand]: 287/290 looper letters, 45 selfloop transitions, 2 changer transitions 4/55 dead transitions. [2022-12-13 22:10:51,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 226 flow [2022-12-13 22:10:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:10:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:10:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-12-13 22:10:51,156 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5183908045977011 [2022-12-13 22:10:51,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2022-12-13 22:10:51,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2022-12-13 22:10:51,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:51,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2022-12-13 22:10:51,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:51,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:51,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:51,160 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 451 transitions. [2022-12-13 22:10:51,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 226 flow [2022-12-13 22:10:51,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:10:51,161 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2022-12-13 22:10:51,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 22:10:51,161 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2022-12-13 22:10:51,161 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2022-12-13 22:10:51,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:51,162 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:51,162 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:51,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:51,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:51,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1920395130, now seen corresponding path program 1 times [2022-12-13 22:10:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:51,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627459666] [2022-12-13 22:10:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:51,371 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 22:10:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:51,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:10:51,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:51,526 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 22:10:51,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:51,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:51,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627459666] [2022-12-13 22:10:51,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627459666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:51,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:51,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:10:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562540025] [2022-12-13 22:10:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:51,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:10:51,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:51,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:10:51,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:10:51,540 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2022-12-13 22:10:51,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:51,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:51,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2022-12-13 22:10:51,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:52,013 INFO L130 PetriNetUnfolder]: 3719/5311 cut-off events. [2022-12-13 22:10:52,013 INFO L131 PetriNetUnfolder]: For 341/341 co-relation queries the response was YES. [2022-12-13 22:10:52,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11096 conditions, 5311 events. 3719/5311 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 27383 event pairs, 803 based on Foata normal form. 108/5186 useless extension candidates. Maximal degree in co-relation 11092. Up to 4756 conditions per place. [2022-12-13 22:10:52,028 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 40 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2022-12-13 22:10:52,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 208 flow [2022-12-13 22:10:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:10:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:10:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-12-13 22:10:52,031 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49770114942528737 [2022-12-13 22:10:52,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-12-13 22:10:52,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-12-13 22:10:52,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:52,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-12-13 22:10:52,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,039 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 3 states and 433 transitions. [2022-12-13 22:10:52,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 208 flow [2022-12-13 22:10:52,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:52,041 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2022-12-13 22:10:52,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2022-12-13 22:10:52,042 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2022-12-13 22:10:52,042 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2022-12-13 22:10:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,043 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:52,043 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:52,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:52,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2053026619, now seen corresponding path program 1 times [2022-12-13 22:10:52,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:52,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798246268] [2022-12-13 22:10:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:52,248 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 22:10:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:52,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:52,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 22:10:52,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:52,406 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 22:10:52,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:52,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:52,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798246268] [2022-12-13 22:10:52,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798246268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:52,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:52,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325386983] [2022-12-13 22:10:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:52,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:52,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:52,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2022-12-13 22:10:52,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:52,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2022-12-13 22:10:52,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:52,761 INFO L130 PetriNetUnfolder]: 1694/2611 cut-off events. [2022-12-13 22:10:52,761 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-13 22:10:52,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6268 conditions, 2611 events. 1694/2611 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13251 event pairs, 402 based on Foata normal form. 135/2648 useless extension candidates. Maximal degree in co-relation 6263. Up to 1426 conditions per place. [2022-12-13 22:10:52,768 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 53 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2022-12-13 22:10:52,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 307 flow [2022-12-13 22:10:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:10:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:10:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-12-13 22:10:52,770 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4991379310344828 [2022-12-13 22:10:52,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-12-13 22:10:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-12-13 22:10:52,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:52,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-12-13 22:10:52,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,773 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 579 transitions. [2022-12-13 22:10:52,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 307 flow [2022-12-13 22:10:52,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:10:52,775 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2022-12-13 22:10:52,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 22:10:52,776 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2022-12-13 22:10:52,776 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2022-12-13 22:10:52,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:52,776 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:52,776 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 22:10:52,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 22:10:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1569889696, now seen corresponding path program 1 times [2022-12-13 22:10:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:52,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290416476] [2022-12-13 22:10:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:52,978 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 22:10:52,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:52,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:52,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 22:10:53,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:53,118 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 22:10:53,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:53,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:53,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290416476] [2022-12-13 22:10:53,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290416476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:53,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:53,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742462995] [2022-12-13 22:10:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:53,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:10:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:53,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:10:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:10:53,142 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2022-12-13 22:10:53,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:53,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2022-12-13 22:10:53,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:53,580 INFO L130 PetriNetUnfolder]: 1064/1666 cut-off events. [2022-12-13 22:10:53,580 INFO L131 PetriNetUnfolder]: For 1137/1137 co-relation queries the response was YES. [2022-12-13 22:10:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1666 events. 1064/1666 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7944 event pairs, 331 based on Foata normal form. 63/1694 useless extension candidates. Maximal degree in co-relation 4531. Up to 630 conditions per place. [2022-12-13 22:10:53,586 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 64 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2022-12-13 22:10:53,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 416 flow [2022-12-13 22:10:53,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:10:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:10:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2022-12-13 22:10:53,589 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986206896551724 [2022-12-13 22:10:53,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2022-12-13 22:10:53,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2022-12-13 22:10:53,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:53,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2022-12-13 22:10:53,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,593 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,593 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 723 transitions. [2022-12-13 22:10:53,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 416 flow [2022-12-13 22:10:53,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 398 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 22:10:53,597 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2022-12-13 22:10:53,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 22:10:53,597 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2022-12-13 22:10:53,597 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2022-12-13 22:10:53,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:53,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:53,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 22:10:53,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:53,798 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:53,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1907601694, now seen corresponding path program 1 times [2022-12-13 22:10:53,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:53,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945885909] [2022-12-13 22:10:53,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:53,800 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 22:10:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:53,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:53,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:53,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 22:10:53,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:53,944 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 22:10:53,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:53,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:53,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945885909] [2022-12-13 22:10:53,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945885909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:53,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:53,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:10:53,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030068721] [2022-12-13 22:10:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:53,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:10:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:53,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:10:53,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:10:53,968 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2022-12-13 22:10:53,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:53,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:53,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2022-12-13 22:10:53,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:54,421 INFO L130 PetriNetUnfolder]: 999/1536 cut-off events. [2022-12-13 22:10:54,421 INFO L131 PetriNetUnfolder]: For 1300/1300 co-relation queries the response was YES. [2022-12-13 22:10:54,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 1536 events. 999/1536 cut-off events. For 1300/1300 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7332 event pairs, 326 based on Foata normal form. 13/1527 useless extension candidates. Maximal degree in co-relation 4337. Up to 630 conditions per place. [2022-12-13 22:10:54,426 INFO L137 encePairwiseOnDemand]: 284/290 looper letters, 60 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-12-13 22:10:54,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 442 flow [2022-12-13 22:10:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:10:54,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:10:54,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2022-12-13 22:10:54,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2022-12-13 22:10:54,429 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2022-12-13 22:10:54,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2022-12-13 22:10:54,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:54,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2022-12-13 22:10:54,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:54,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:54,433 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:54,433 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 852 transitions. [2022-12-13 22:10:54,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 442 flow [2022-12-13 22:10:54,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 408 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 22:10:54,443 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2022-12-13 22:10:54,443 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2022-12-13 22:10:54,444 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 22:10:54,444 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2022-12-13 22:10:54,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:54,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:54,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:54,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 22:10:54,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:54,646 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:54,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1118679391, now seen corresponding path program 1 times [2022-12-13 22:10:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:54,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583174251] [2022-12-13 22:10:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:54,650 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 22:10:54,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:54,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:54,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:54,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 22:10:54,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:55,446 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 22:10:55,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:55,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583174251] [2022-12-13 22:10:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583174251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:55,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:55,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:10:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094163646] [2022-12-13 22:10:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:55,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:10:55,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:55,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:10:55,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:10:56,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 290 [2022-12-13 22:10:56,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:56,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 290 [2022-12-13 22:10:56,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:56,677 INFO L130 PetriNetUnfolder]: 999/1576 cut-off events. [2022-12-13 22:10:56,677 INFO L131 PetriNetUnfolder]: For 1969/1969 co-relation queries the response was YES. [2022-12-13 22:10:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1576 events. 999/1576 cut-off events. For 1969/1969 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7743 event pairs, 7 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 4461. Up to 1252 conditions per place. [2022-12-13 22:10:56,682 INFO L137 encePairwiseOnDemand]: 285/290 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-12-13 22:10:56,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 465 flow [2022-12-13 22:10:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:10:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:10:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2022-12-13 22:10:56,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4149425287356322 [2022-12-13 22:10:56,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2022-12-13 22:10:56,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2022-12-13 22:10:56,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:56,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2022-12-13 22:10:56,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,686 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,686 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 6 states and 722 transitions. [2022-12-13 22:10:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 465 flow [2022-12-13 22:10:56,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 390 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:56,691 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2022-12-13 22:10:56,691 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2022-12-13 22:10:56,691 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2022-12-13 22:10:56,691 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2022-12-13 22:10:56,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:56,692 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:56,692 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:56,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:56,893 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1387160835, now seen corresponding path program 1 times [2022-12-13 22:10:56,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:56,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153902191] [2022-12-13 22:10:56,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:10:56,897 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 22:10:56,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:56,900 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:56,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:10:57,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 22:10:57,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:57,333 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 22:10:57,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:57,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:57,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153902191] [2022-12-13 22:10:57,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153902191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:57,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:57,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:10:57,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276770061] [2022-12-13 22:10:57,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:57,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 22:10:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:57,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 22:10:57,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:10:57,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2022-12-13 22:10:57,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 129.77777777777777) internal successors, (1168), 9 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:57,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2022-12-13 22:10:57,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:57,943 INFO L130 PetriNetUnfolder]: 1159/1789 cut-off events. [2022-12-13 22:10:57,944 INFO L131 PetriNetUnfolder]: For 1017/1017 co-relation queries the response was YES. [2022-12-13 22:10:57,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 1789 events. 1159/1789 cut-off events. For 1017/1017 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8478 event pairs, 195 based on Foata normal form. 1/1782 useless extension candidates. Maximal degree in co-relation 4888. Up to 773 conditions per place. [2022-12-13 22:10:57,947 INFO L137 encePairwiseOnDemand]: 283/290 looper letters, 69 selfloop transitions, 4 changer transitions 32/109 dead transitions. [2022-12-13 22:10:57,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 670 flow [2022-12-13 22:10:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 22:10:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 22:10:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1086 transitions. [2022-12-13 22:10:57,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4681034482758621 [2022-12-13 22:10:57,949 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1086 transitions. [2022-12-13 22:10:57,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1086 transitions. [2022-12-13 22:10:57,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:57,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1086 transitions. [2022-12-13 22:10:57,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.75) internal successors, (1086), 8 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,954 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,954 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 8 states and 1086 transitions. [2022-12-13 22:10:57,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 670 flow [2022-12-13 22:10:57,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 109 transitions, 653 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 22:10:57,967 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 173 flow [2022-12-13 22:10:57,967 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2022-12-13 22:10:57,968 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2022-12-13 22:10:57,968 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 173 flow [2022-12-13 22:10:57,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 129.77777777777777) internal successors, (1168), 9 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:57,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:57,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:57,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 22:10:58,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:58,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:58,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1068120533, now seen corresponding path program 2 times [2022-12-13 22:10:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:58,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667826763] [2022-12-13 22:10:58,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 22:10:58,172 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 22:10:58,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:58,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:58,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 22:10:58,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 22:10:58,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:10:58,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:10:58,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:58,312 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 22:10:58,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:58,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:58,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667826763] [2022-12-13 22:10:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667826763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:58,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:58,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202849364] [2022-12-13 22:10:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:58,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:58,321 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 22:10:58,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:58,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:58,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 22:10:58,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:58,640 INFO L130 PetriNetUnfolder]: 1708/2646 cut-off events. [2022-12-13 22:10:58,640 INFO L131 PetriNetUnfolder]: For 2372/2372 co-relation queries the response was YES. [2022-12-13 22:10:58,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7646 conditions, 2646 events. 1708/2646 cut-off events. For 2372/2372 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14089 event pairs, 731 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 7635. Up to 1488 conditions per place. [2022-12-13 22:10:58,647 INFO L137 encePairwiseOnDemand]: 286/290 looper letters, 55 selfloop transitions, 2 changer transitions 12/72 dead transitions. [2022-12-13 22:10:58,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 454 flow [2022-12-13 22:10:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:10:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:10:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2022-12-13 22:10:58,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879310344827586 [2022-12-13 22:10:58,649 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2022-12-13 22:10:58,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2022-12-13 22:10:58,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:58,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2022-12-13 22:10:58,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:58,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:58,653 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:58,654 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 173 flow. Second operand 4 states and 566 transitions. [2022-12-13 22:10:58,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 454 flow [2022-12-13 22:10:58,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 434 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 22:10:58,674 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 171 flow [2022-12-13 22:10:58,674 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2022-12-13 22:10:58,674 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2022-12-13 22:10:58,675 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 171 flow [2022-12-13 22:10:58,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:58,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:58,675 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:58,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 22:10:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:58,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash -689400369, now seen corresponding path program 3 times [2022-12-13 22:10:58,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865918775] [2022-12-13 22:10:58,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 22:10:58,880 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 22:10:58,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:58,883 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:58,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 22:10:58,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 22:10:58,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:10:58,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:10:58,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:59,008 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 22:10:59,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:59,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:59,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865918775] [2022-12-13 22:10:59,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865918775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:59,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:59,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989085259] [2022-12-13 22:10:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:59,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:59,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:59,022 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 22:10:59,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:59,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 22:10:59,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:59,313 INFO L130 PetriNetUnfolder]: 1185/1892 cut-off events. [2022-12-13 22:10:59,313 INFO L131 PetriNetUnfolder]: For 1439/1443 co-relation queries the response was YES. [2022-12-13 22:10:59,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1892 events. 1185/1892 cut-off events. For 1439/1443 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9269 event pairs, 499 based on Foata normal form. 1/1887 useless extension candidates. Maximal degree in co-relation 5353. Up to 1052 conditions per place. [2022-12-13 22:10:59,317 INFO L137 encePairwiseOnDemand]: 286/290 looper letters, 45 selfloop transitions, 2 changer transitions 19/69 dead transitions. [2022-12-13 22:10:59,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 432 flow [2022-12-13 22:10:59,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:10:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:10:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2022-12-13 22:10:59,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4853448275862069 [2022-12-13 22:10:59,319 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2022-12-13 22:10:59,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2022-12-13 22:10:59,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:59,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2022-12-13 22:10:59,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 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 22:10:59,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,321 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,321 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 171 flow. Second operand 4 states and 563 transitions. [2022-12-13 22:10:59,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 432 flow [2022-12-13 22:10:59,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 422 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 22:10:59,328 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 173 flow [2022-12-13 22:10:59,328 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-13 22:10:59,329 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2022-12-13 22:10:59,329 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 173 flow [2022-12-13 22:10:59,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,329 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:59,329 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:59,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 22:10:59,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:59,531 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:10:59,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:10:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1469968737, now seen corresponding path program 4 times [2022-12-13 22:10:59,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:10:59,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965489401] [2022-12-13 22:10:59,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 22:10:59,534 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 22:10:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:10:59,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:10:59,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 22:10:59,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 22:10:59,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 22:10:59,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:10:59,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:10:59,695 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 22:10:59,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:10:59,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 22:10:59,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965489401] [2022-12-13 22:10:59,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965489401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:10:59,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:10:59,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:10:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020181971] [2022-12-13 22:10:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:10:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:10:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 22:10:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:10:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:10:59,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 290 [2022-12-13 22:10:59,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:10:59,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 290 [2022-12-13 22:10:59,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:10:59,959 INFO L130 PetriNetUnfolder]: 1209/1933 cut-off events. [2022-12-13 22:10:59,959 INFO L131 PetriNetUnfolder]: For 1433/1452 co-relation queries the response was YES. [2022-12-13 22:10:59,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5628 conditions, 1933 events. 1209/1933 cut-off events. For 1433/1452 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9330 event pairs, 521 based on Foata normal form. 4/1908 useless extension candidates. Maximal degree in co-relation 5617. Up to 1112 conditions per place. [2022-12-13 22:10:59,963 INFO L137 encePairwiseOnDemand]: 286/290 looper letters, 42 selfloop transitions, 2 changer transitions 27/74 dead transitions. [2022-12-13 22:10:59,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 462 flow [2022-12-13 22:10:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:10:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:10:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-12-13 22:10:59,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2022-12-13 22:10:59,964 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-12-13 22:10:59,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-12-13 22:10:59,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:10:59,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-12-13 22:10:59,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,966 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,966 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 173 flow. Second operand 4 states and 568 transitions. [2022-12-13 22:10:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 462 flow [2022-12-13 22:10:59,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 450 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 22:10:59,977 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 175 flow [2022-12-13 22:10:59,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-12-13 22:10:59,978 INFO L288 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2022-12-13 22:10:59,978 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 175 flow [2022-12-13 22:10:59,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:10:59,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:10:59,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:10:59,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 22:11:00,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:11:00,180 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 22:11:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:11:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1628997543, now seen corresponding path program 5 times [2022-12-13 22:11:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 22:11:00,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139509700] [2022-12-13 22:11:00,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 22:11:00,183 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 22:11:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 22:11:00,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:11:00,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 22:11:00,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 22:11:00,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 22:11:00,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:11:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:11:00,444 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 22:11:00,444 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:11:00,445 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 22:11:00,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 22:11:00,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 22:11:00,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 22:11:00,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 22:11:00,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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 22:11:00,648 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:11:00,652 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:11:00,652 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:11:00,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:11:00 BasicIcfg [2022-12-13 22:11:00,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:11:00,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:11:00,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:11:00,698 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:11:00,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:10:41" (3/4) ... [2022-12-13 22:11:00,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 22:11:00,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:11:00,701 INFO L158 Benchmark]: Toolchain (without parser) took 20095.40ms. Allocated memory was 60.8MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 27.8MB in the beginning and 348.5MB in the end (delta: -320.8MB). Peak memory consumption was 700.0MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,701 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:11:00,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.46ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 27.6MB in the beginning and 55.4MB in the end (delta: -27.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.94ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 52.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,702 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 50.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,702 INFO L158 Benchmark]: RCFGBuilder took 594.70ms. Allocated memory is still 79.7MB. Free memory was 50.6MB in the beginning and 53.5MB in the end (delta: -2.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,702 INFO L158 Benchmark]: TraceAbstraction took 18921.50ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 52.8MB in the beginning and 349.6MB in the end (delta: -296.8MB). Peak memory consumption was 706.7MB. Max. memory is 16.1GB. [2022-12-13 22:11:00,702 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 1.1GB. Free memory was 349.6MB in the beginning and 348.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:11:00,704 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.46ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 27.6MB in the beginning and 55.4MB in the end (delta: -27.8MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.94ms. Allocated memory is still 79.7MB. Free memory was 55.4MB in the beginning and 52.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 50.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 594.70ms. Allocated memory is still 79.7MB. Free memory was 50.6MB in the beginning and 53.5MB in the end (delta: -2.9MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18921.50ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 52.8MB in the beginning and 349.6MB in the end (delta: -296.8MB). Peak memory consumption was 706.7MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 1.1GB. Free memory was 349.6MB in the beginning and 348.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 156 PlacesBefore, 54 PlacesAfterwards, 145 TransitionsBefore, 42 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 141 TotalNumberOfCompositions, 11023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4052, independent: 3798, independent conditional: 0, independent unconditional: 3798, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1930, independent: 1882, independent conditional: 0, independent unconditional: 1882, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4052, independent: 1916, independent conditional: 0, independent unconditional: 1916, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 1930, unknown conditional: 0, unknown unconditional: 1930] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 161, Positive conditional cache size: 0, Positive unconditional cache size: 161, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=0, t801={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L864] 0 pthread_t t802; [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=1, t801={11:0}, t802={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=2, t801={11:0}, t802={15:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t804; [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=3, t801={11:0}, t802={15:0}, t803={7:0}, t804={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={11:0}, t802={15:0}, t803={7:0}, t804={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=2, weak$$choice2=0, x=2, y=2, z=2] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 863]: 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 9 procedures, 186 locations, 16 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: 18.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 350 mSDsluCounter, 244 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2126 IncrementalHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 21 mSDtfsCounter, 2126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 21 QuantifiedInterpolants, 1912 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1727 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 22:11:00,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9aaa38b9-47b9-4c24-af89-ed996b5376a1/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