./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/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_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b --- 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 14:35:04,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:35:04,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:35:04,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:35:04,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:35:04,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:35:04,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:35:04,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:35:04,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:35:04,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:35:04,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:35:04,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:35:04,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:35:04,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:35:04,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:35:04,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:35:04,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:35:04,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:35:04,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:35:04,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:35:04,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:35:04,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:35:04,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:35:04,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:35:04,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:35:04,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:35:04,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:35:04,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:35:04,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:35:04,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:35:04,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:35:04,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:35:04,865 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:35:04,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:35:04,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:35:04,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:35:04,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:35:04,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:35:04,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:35:04,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:35:04,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:35:04,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 14:35:04,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:35:04,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:35:04,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:35:04,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:35:04,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:35:04,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:35:04,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:35:04,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:35:04,893 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:35:04,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:35:04,893 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:35:04,893 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:35:04,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:35:04,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:35:04,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:35:04,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:35:04,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:35:04,895 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:35:04,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:35:04,895 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:35:04,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:35:04,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:35:04,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:35:04,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:35:04,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:35:04,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:35:04,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:35:04,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:35:04,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:35:04,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:35:04,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:35:04,897 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:35:04,897 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:35:04,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:35:04,898 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:35:04,898 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_d5df1859-53e0-45a5-abab-678215c04dfb/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_d5df1859-53e0-45a5-abab-678215c04dfb/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 ! call(reach_error())) ) 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 -> 833fe1bfba6e9465d0762b8b4b281d00d9e54d53b8918b133a54714c1d863b1b [2022-12-13 14:35:05,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:35:05,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:35:05,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:35:05,088 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:35:05,088 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:35:05,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 14:35:07,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:35:07,919 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:35:07,920 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 14:35:07,933 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/data/1b481279f/7aae28a9bf5943eaa1c04bceca1e745d/FLAG39a1eaf66 [2022-12-13 14:35:07,946 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/data/1b481279f/7aae28a9bf5943eaa1c04bceca1e745d [2022-12-13 14:35:07,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:35:07,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:35:07,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:35:07,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:35:07,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:35:07,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:35:07" (1/1) ... [2022-12-13 14:35:07,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2df1059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:07, skipping insertion in model container [2022-12-13 14:35:07,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:35:07" (1/1) ... [2022-12-13 14:35:07,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:35:07,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:35:08,131 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_d5df1859-53e0-45a5-abab-678215c04dfb/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 14:35:08,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:35:08,321 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:35:08,331 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_d5df1859-53e0-45a5-abab-678215c04dfb/sv-benchmarks/c/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 14:35:08,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:35:08,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:35:08,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:35:08,415 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:35:08,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08 WrapperNode [2022-12-13 14:35:08,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:35:08,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:35:08,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:35:08,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:35:08,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,459 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-13 14:35:08,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:35:08,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:35:08,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:35:08,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:35:08,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:35:08,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:35:08,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:35:08,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:35:08,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (1/1) ... [2022-12-13 14:35:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:35:08,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:35:08,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:35:08,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:35:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:35:08,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:35:08,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:35:08,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:35:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:35:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:35:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:35:08,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:35:08,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:35:08,552 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 14:35:08,681 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:35:08,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:35:08,906 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:35:08,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:35:08,991 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:35:08,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:35:08 BoogieIcfgContainer [2022-12-13 14:35:08,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:35:08,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:35:08,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:35:08,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:35:08,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:35:07" (1/3) ... [2022-12-13 14:35:08,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e980fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:35:08, skipping insertion in model container [2022-12-13 14:35:08,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:35:08" (2/3) ... [2022-12-13 14:35:08,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e980fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:35:08, skipping insertion in model container [2022-12-13 14:35:08,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:35:08" (3/3) ... [2022-12-13 14:35:09,000 INFO L112 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 14:35:09,006 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 14:35:09,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:35:09,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 14:35:09,013 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:35:09,047 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:35:09,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-12-13 14:35:09,103 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-12-13 14:35:09,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:35:09,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 14:35:09,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-12-13 14:35:09,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-12-13 14:35:09,114 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:35:09,122 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2022-12-13 14:35:09,124 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2022-12-13 14:35:09,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2022-12-13 14:35:09,142 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-12-13 14:35:09,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:35:09,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 14:35:09,144 INFO L119 LiptonReduction]: Number of co-enabled transitions 2416 [2022-12-13 14:35:11,903 INFO L134 LiptonReduction]: Checked pairs total: 6883 [2022-12-13 14:35:11,903 INFO L136 LiptonReduction]: Total number of compositions: 106 [2022-12-13 14:35:11,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:35:11,918 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7c1a7167, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:35:11,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 14:35:11,920 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 14:35:11,920 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:35:11,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:11,921 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 14:35:11,921 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:11,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 512011, now seen corresponding path program 1 times [2022-12-13 14:35:11,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:11,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293816159] [2022-12-13 14:35:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:35:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:12,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293816159] [2022-12-13 14:35:12,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293816159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:12,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:12,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:35:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296941325] [2022-12-13 14:35:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:35:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:35:12,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:35:12,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 227 [2022-12-13 14:35:12,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:12,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 227 [2022-12-13 14:35:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:12,531 INFO L130 PetriNetUnfolder]: 1144/1742 cut-off events. [2022-12-13 14:35:12,531 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 14:35:12,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 1742 events. 1144/1742 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8002 event pairs, 472 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 3479. Up to 1372 conditions per place. [2022-12-13 14:35:12,540 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2022-12-13 14:35:12,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2022-12-13 14:35:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:35:12,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:35:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2022-12-13 14:35:12,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5301027900146843 [2022-12-13 14:35:12,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2022-12-13 14:35:12,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2022-12-13 14:35:12,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:12,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2022-12-13 14:35:12,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,571 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 361 transitions. [2022-12-13 14:35:12,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2022-12-13 14:35:12,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:35:12,576 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2022-12-13 14:35:12,577 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2022-12-13 14:35:12,581 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2022-12-13 14:35:12,581 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2022-12-13 14:35:12,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:12,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:12,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:35:12,582 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1419649558, now seen corresponding path program 1 times [2022-12-13 14:35:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583288754] [2022-12-13 14:35:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:12,747 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 14:35:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:12,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583288754] [2022-12-13 14:35:12,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583288754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:12,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:12,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:35:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304068879] [2022-12-13 14:35:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:12,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:35:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:35:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:35:12,765 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 14:35:12,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:12,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:12,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 14:35:12,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:13,260 INFO L130 PetriNetUnfolder]: 2459/3678 cut-off events. [2022-12-13 14:35:13,260 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-13 14:35:13,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 18058 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7608. Up to 2550 conditions per place. [2022-12-13 14:35:13,277 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2022-12-13 14:35:13,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 178 flow [2022-12-13 14:35:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:35:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:35:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-12-13 14:35:13,279 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4933920704845815 [2022-12-13 14:35:13,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-12-13 14:35:13,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-12-13 14:35:13,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:13,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-12-13 14:35:13,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,284 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 3 states and 336 transitions. [2022-12-13 14:35:13,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 178 flow [2022-12-13 14:35:13,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:35:13,285 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 106 flow [2022-12-13 14:35:13,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-12-13 14:35:13,286 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-13 14:35:13,286 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 106 flow [2022-12-13 14:35:13,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:13,287 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:13,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:35:13,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:13,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1059462112, now seen corresponding path program 1 times [2022-12-13 14:35:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:13,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767411437] [2022-12-13 14:35:13,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:35:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:13,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767411437] [2022-12-13 14:35:13,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767411437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:13,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:13,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:35:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050149156] [2022-12-13 14:35:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:13,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:35:13,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:35:13,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:35:13,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 14:35:13,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 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 14:35:13,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:13,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 14:35:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:13,840 INFO L130 PetriNetUnfolder]: 2285/3424 cut-off events. [2022-12-13 14:35:13,841 INFO L131 PetriNetUnfolder]: For 1315/1315 co-relation queries the response was YES. [2022-12-13 14:35:13,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8557 conditions, 3424 events. 2285/3424 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16673 event pairs, 468 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8545. Up to 1837 conditions per place. [2022-12-13 14:35:13,852 INFO L137 encePairwiseOnDemand]: 220/227 looper letters, 48 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2022-12-13 14:35:13,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 288 flow [2022-12-13 14:35:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:35:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:35:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2022-12-13 14:35:13,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4878854625550661 [2022-12-13 14:35:13,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2022-12-13 14:35:13,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2022-12-13 14:35:13,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:13,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2022-12-13 14:35:13,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,857 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,857 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 106 flow. Second operand 4 states and 443 transitions. [2022-12-13 14:35:13,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 288 flow [2022-12-13 14:35:13,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:35:13,864 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 140 flow [2022-12-13 14:35:13,864 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-13 14:35:13,864 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-13 14:35:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 140 flow [2022-12-13 14:35:13,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 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 14:35:13,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:13,865 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:35:13,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -369384052, now seen corresponding path program 1 times [2022-12-13 14:35:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:13,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485902905] [2022-12-13 14:35:13,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:13,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:13,966 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 14:35:13,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:13,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485902905] [2022-12-13 14:35:13,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485902905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:13,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:13,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:35:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537079857] [2022-12-13 14:35:13,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:13,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:35:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:13,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:35:13,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:35:13,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 14:35:13,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:13,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:13,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 14:35:13,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:14,335 INFO L130 PetriNetUnfolder]: 2149/3224 cut-off events. [2022-12-13 14:35:14,335 INFO L131 PetriNetUnfolder]: For 2490/2490 co-relation queries the response was YES. [2022-12-13 14:35:14,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8554 conditions, 3224 events. 2149/3224 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14790 event pairs, 634 based on Foata normal form. 40/3264 useless extension candidates. Maximal degree in co-relation 8539. Up to 1596 conditions per place. [2022-12-13 14:35:14,346 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2022-12-13 14:35:14,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 324 flow [2022-12-13 14:35:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:35:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:35:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2022-12-13 14:35:14,348 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4834801762114537 [2022-12-13 14:35:14,348 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2022-12-13 14:35:14,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2022-12-13 14:35:14,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:14,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2022-12-13 14:35:14,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,350 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 140 flow. Second operand 4 states and 439 transitions. [2022-12-13 14:35:14,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 324 flow [2022-12-13 14:35:14,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:35:14,370 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 226 flow [2022-12-13 14:35:14,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-13 14:35:14,371 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-13 14:35:14,371 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 226 flow [2022-12-13 14:35:14,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,371 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:14,371 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:14,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:35:14,371 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:14,372 INFO L85 PathProgramCache]: Analyzing trace with hash -203491652, now seen corresponding path program 1 times [2022-12-13 14:35:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:14,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894831672] [2022-12-13 14:35:14,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:14,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:14,496 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 14:35:14,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:14,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894831672] [2022-12-13 14:35:14,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894831672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:14,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:14,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:35:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537650962] [2022-12-13 14:35:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:14,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:35:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:35:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:35:14,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 14:35:14,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:14,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 14:35:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:14,855 INFO L130 PetriNetUnfolder]: 1301/2184 cut-off events. [2022-12-13 14:35:14,856 INFO L131 PetriNetUnfolder]: For 2235/2288 co-relation queries the response was YES. [2022-12-13 14:35:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 2184 events. 1301/2184 cut-off events. For 2235/2288 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12032 event pairs, 236 based on Foata normal form. 244/2395 useless extension candidates. Maximal degree in co-relation 5950. Up to 1136 conditions per place. [2022-12-13 14:35:14,863 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 74 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2022-12-13 14:35:14,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 665 flow [2022-12-13 14:35:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:35:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:35:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-12-13 14:35:14,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2022-12-13 14:35:14,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2022-12-13 14:35:14,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2022-12-13 14:35:14,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:14,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2022-12-13 14:35:14,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,868 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,868 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 226 flow. Second operand 5 states and 575 transitions. [2022-12-13 14:35:14,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 665 flow [2022-12-13 14:35:14,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 93 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:35:14,872 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 282 flow [2022-12-13 14:35:14,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-13 14:35:14,873 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2022-12-13 14:35:14,873 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 282 flow [2022-12-13 14:35:14,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,873 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:14,873 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:14,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:35:14,874 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -8413648, now seen corresponding path program 1 times [2022-12-13 14:35:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:14,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426845225] [2022-12-13 14:35:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:14,985 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 14:35:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:14,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426845225] [2022-12-13 14:35:14,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426845225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:14,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:14,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:35:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953454963] [2022-12-13 14:35:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:14,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:35:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:35:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:35:14,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 227 [2022-12-13 14:35:14,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:14,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:14,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 227 [2022-12-13 14:35:14,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:15,395 INFO L130 PetriNetUnfolder]: 1897/3213 cut-off events. [2022-12-13 14:35:15,395 INFO L131 PetriNetUnfolder]: For 5501/5572 co-relation queries the response was YES. [2022-12-13 14:35:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11223 conditions, 3213 events. 1897/3213 cut-off events. For 5501/5572 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19052 event pairs, 376 based on Foata normal form. 63/3239 useless extension candidates. Maximal degree in co-relation 11200. Up to 1630 conditions per place. [2022-12-13 14:35:15,408 INFO L137 encePairwiseOnDemand]: 224/227 looper letters, 52 selfloop transitions, 3 changer transitions 16/79 dead transitions. [2022-12-13 14:35:15,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 607 flow [2022-12-13 14:35:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:35:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:35:15,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2022-12-13 14:35:15,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044052863436124 [2022-12-13 14:35:15,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2022-12-13 14:35:15,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2022-12-13 14:35:15,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:15,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2022-12-13 14:35:15,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,413 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,413 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 282 flow. Second operand 4 states and 458 transitions. [2022-12-13 14:35:15,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 607 flow [2022-12-13 14:35:15,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:35:15,425 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 281 flow [2022-12-13 14:35:15,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-13 14:35:15,426 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-13 14:35:15,426 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 281 flow [2022-12-13 14:35:15,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:15,427 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:15,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:35:15,427 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 957142202, now seen corresponding path program 1 times [2022-12-13 14:35:15,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:15,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125624817] [2022-12-13 14:35:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:15,566 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 14:35:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:15,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125624817] [2022-12-13 14:35:15,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125624817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:15,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:15,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:35:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975032978] [2022-12-13 14:35:15,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:15,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:35:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:15,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:35:15,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:35:15,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 14:35:15,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 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 14:35:15,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:15,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 14:35:15,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:15,955 INFO L130 PetriNetUnfolder]: 1148/2010 cut-off events. [2022-12-13 14:35:15,955 INFO L131 PetriNetUnfolder]: For 2889/2954 co-relation queries the response was YES. [2022-12-13 14:35:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 2010 events. 1148/2010 cut-off events. For 2889/2954 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11829 event pairs, 175 based on Foata normal form. 187/2163 useless extension candidates. Maximal degree in co-relation 6579. Up to 674 conditions per place. [2022-12-13 14:35:15,962 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 76 selfloop transitions, 12 changer transitions 22/122 dead transitions. [2022-12-13 14:35:15,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 122 transitions, 947 flow [2022-12-13 14:35:15,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:35:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:35:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2022-12-13 14:35:15,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5053492762743864 [2022-12-13 14:35:15,964 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2022-12-13 14:35:15,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2022-12-13 14:35:15,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:15,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2022-12-13 14:35:15,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:15,967 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 281 flow. Second operand 7 states and 803 transitions. [2022-12-13 14:35:15,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 122 transitions, 947 flow [2022-12-13 14:35:15,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 122 transitions, 939 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 14:35:15,974 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 368 flow [2022-12-13 14:35:15,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-13 14:35:15,975 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2022-12-13 14:35:15,975 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 368 flow [2022-12-13 14:35:15,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 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 14:35:15,975 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:15,975 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:15,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:35:15,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1228421427, now seen corresponding path program 1 times [2022-12-13 14:35:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541166026] [2022-12-13 14:35:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:15,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:16,138 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 14:35:16,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:16,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541166026] [2022-12-13 14:35:16,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541166026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:16,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:16,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:35:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814561980] [2022-12-13 14:35:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:35:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:35:16,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:35:16,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 14:35:16,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:16,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 14:35:16,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:16,487 INFO L130 PetriNetUnfolder]: 1091/1896 cut-off events. [2022-12-13 14:35:16,487 INFO L131 PetriNetUnfolder]: For 3783/3845 co-relation queries the response was YES. [2022-12-13 14:35:16,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 1896 events. 1091/1896 cut-off events. For 3783/3845 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11082 event pairs, 166 based on Foata normal form. 57/1919 useless extension candidates. Maximal degree in co-relation 7086. Up to 645 conditions per place. [2022-12-13 14:35:16,493 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 51 selfloop transitions, 15 changer transitions 49/123 dead transitions. [2022-12-13 14:35:16,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 123 transitions, 1003 flow [2022-12-13 14:35:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:35:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:35:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1010 transitions. [2022-12-13 14:35:16,495 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4943710230053842 [2022-12-13 14:35:16,495 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1010 transitions. [2022-12-13 14:35:16,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1010 transitions. [2022-12-13 14:35:16,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:16,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1010 transitions. [2022-12-13 14:35:16,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,500 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,500 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 368 flow. Second operand 9 states and 1010 transitions. [2022-12-13 14:35:16,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 123 transitions, 1003 flow [2022-12-13 14:35:16,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 947 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-13 14:35:16,523 INFO L231 Difference]: Finished difference. Result has 67 places, 41 transitions, 297 flow [2022-12-13 14:35:16,524 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=297, PETRI_PLACES=67, PETRI_TRANSITIONS=41} [2022-12-13 14:35:16,524 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2022-12-13 14:35:16,524 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 41 transitions, 297 flow [2022-12-13 14:35:16,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:16,525 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] [2022-12-13 14:35:16,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:35:16,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1582759688, now seen corresponding path program 1 times [2022-12-13 14:35:16,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:16,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155707236] [2022-12-13 14:35:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:16,818 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 14:35:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:16,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155707236] [2022-12-13 14:35:16,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155707236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:16,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:16,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:35:16,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266707889] [2022-12-13 14:35:16,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:16,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:35:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:35:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:35:16,833 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 14:35:16,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 41 transitions, 297 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:16,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:16,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 14:35:16,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:17,173 INFO L130 PetriNetUnfolder]: 833/1611 cut-off events. [2022-12-13 14:35:17,173 INFO L131 PetriNetUnfolder]: For 3833/3875 co-relation queries the response was YES. [2022-12-13 14:35:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 1611 events. 833/1611 cut-off events. For 3833/3875 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9986 event pairs, 217 based on Foata normal form. 1/1595 useless extension candidates. Maximal degree in co-relation 6202. Up to 781 conditions per place. [2022-12-13 14:35:17,178 INFO L137 encePairwiseOnDemand]: 220/227 looper letters, 52 selfloop transitions, 6 changer transitions 54/120 dead transitions. [2022-12-13 14:35:17,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 1084 flow [2022-12-13 14:35:17,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:35:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:35:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2022-12-13 14:35:17,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5007342143906021 [2022-12-13 14:35:17,179 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2022-12-13 14:35:17,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2022-12-13 14:35:17,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:17,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2022-12-13 14:35:17,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:17,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:17,182 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:17,182 INFO L175 Difference]: Start difference. First operand has 67 places, 41 transitions, 297 flow. Second operand 6 states and 682 transitions. [2022-12-13 14:35:17,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 1084 flow [2022-12-13 14:35:17,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 120 transitions, 882 flow, removed 49 selfloop flow, removed 9 redundant places. [2022-12-13 14:35:17,194 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 297 flow [2022-12-13 14:35:17,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2022-12-13 14:35:17,195 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-13 14:35:17,195 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 297 flow [2022-12-13 14:35:17,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:17,195 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:17,195 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] [2022-12-13 14:35:17,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:35:17,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1191762514, now seen corresponding path program 2 times [2022-12-13 14:35:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206090395] [2022-12-13 14:35:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:35:17,609 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 14:35:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:35:17,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206090395] [2022-12-13 14:35:17,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206090395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:35:17,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:35:17,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:35:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231470312] [2022-12-13 14:35:17,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:35:17,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:35:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:35:17,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:35:17,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:35:17,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2022-12-13 14:35:17,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:17,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:35:17,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2022-12-13 14:35:17,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:35:18,016 INFO L130 PetriNetUnfolder]: 719/1443 cut-off events. [2022-12-13 14:35:18,016 INFO L131 PetriNetUnfolder]: For 2980/3107 co-relation queries the response was YES. [2022-12-13 14:35:18,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5927 conditions, 1443 events. 719/1443 cut-off events. For 2980/3107 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9017 event pairs, 92 based on Foata normal form. 46/1472 useless extension candidates. Maximal degree in co-relation 5905. Up to 786 conditions per place. [2022-12-13 14:35:18,020 INFO L137 encePairwiseOnDemand]: 221/227 looper letters, 54 selfloop transitions, 5 changer transitions 34/101 dead transitions. [2022-12-13 14:35:18,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 806 flow [2022-12-13 14:35:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:35:18,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:35:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 767 transitions. [2022-12-13 14:35:18,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48269351793580867 [2022-12-13 14:35:18,024 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 767 transitions. [2022-12-13 14:35:18,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 767 transitions. [2022-12-13 14:35:18,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:35:18,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 767 transitions. [2022-12-13 14:35:18,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.57142857142857) internal successors, (767), 7 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:18,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:18,031 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:18,031 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 297 flow. Second operand 7 states and 767 transitions. [2022-12-13 14:35:18,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 806 flow [2022-12-13 14:35:18,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 790 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 14:35:18,043 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 307 flow [2022-12-13 14:35:18,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2022-12-13 14:35:18,043 INFO L288 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2022-12-13 14:35:18,043 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 307 flow [2022-12-13 14:35:18,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:35:18,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:35:18,044 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] [2022-12-13 14:35:18,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:35:18,044 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 14:35:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:35:18,044 INFO L85 PathProgramCache]: Analyzing trace with hash 753177506, now seen corresponding path program 3 times [2022-12-13 14:35:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:35:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121875247] [2022-12-13 14:35:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:35:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:35:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:35:18,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:35:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:35:18,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:35:18,144 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:35:18,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 14:35:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 14:35:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 14:35:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 14:35:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 14:35:18,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 14:35:18,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:35:18,147 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:35:18,151 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:35:18,151 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:35:18,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:35:18 BasicIcfg [2022-12-13 14:35:18,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:35:18,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:35:18,190 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:35:18,191 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:35:18,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:35:08" (3/4) ... [2022-12-13 14:35:18,192 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 14:35:18,241 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:35:18,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:35:18,241 INFO L158 Benchmark]: Toolchain (without parser) took 10292.02ms. Allocated memory was 125.8MB in the beginning and 440.4MB in the end (delta: 314.6MB). Free memory was 89.6MB in the beginning and 280.2MB in the end (delta: -190.5MB). Peak memory consumption was 124.9MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,241 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 125.8MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:35:18,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 465.36ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 62.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.86ms. Allocated memory is still 125.8MB. Free memory was 62.4MB in the beginning and 59.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,242 INFO L158 Benchmark]: Boogie Preprocessor took 28.35ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,243 INFO L158 Benchmark]: RCFGBuilder took 503.30ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 93.4MB in the end (delta: -35.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,243 INFO L158 Benchmark]: TraceAbstraction took 9194.73ms. Allocated memory was 151.0MB in the beginning and 440.4MB in the end (delta: 289.4MB). Free memory was 93.4MB in the beginning and 291.7MB in the end (delta: -198.3MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,243 INFO L158 Benchmark]: Witness Printer took 50.45ms. Allocated memory is still 440.4MB. Free memory was 291.7MB in the beginning and 280.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 14:35:18,245 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.20ms. Allocated memory is still 125.8MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 465.36ms. Allocated memory is still 125.8MB. Free memory was 89.6MB in the beginning and 62.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.86ms. Allocated memory is still 125.8MB. Free memory was 62.4MB in the beginning and 59.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.35ms. Allocated memory is still 125.8MB. Free memory was 59.8MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.30ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 93.4MB in the end (delta: -35.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9194.73ms. Allocated memory was 151.0MB in the beginning and 440.4MB in the end (delta: 289.4MB). Free memory was 93.4MB in the beginning and 291.7MB in the end (delta: -198.3MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Witness Printer took 50.45ms. Allocated memory is still 440.4MB. Free memory was 291.7MB in the beginning and 280.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 126 PlacesBefore, 35 PlacesAfterwards, 118 TransitionsBefore, 26 TransitionsAfterwards, 2416 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6883 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3451, independent: 3232, independent conditional: 0, independent unconditional: 3232, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1336, independent: 1289, independent conditional: 0, independent unconditional: 1289, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3451, independent: 1943, independent conditional: 0, independent unconditional: 1943, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1336, unknown conditional: 0, unknown unconditional: 1336] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t281, ((void *)0), P0, ((void *)0))=-2, t281={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t282, ((void *)0), P1, ((void *)0))=-1, t281={5:0}, t282={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t283, ((void *)0), P2, ((void *)0))=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L790] 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) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 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 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, weak$$choice2=1, x=2, y=1, z=1] [L826] 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) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 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 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, weak$$choice2=1, x=2, y=1, z=1] [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_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=2, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 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 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t281={5:0}, t282={6:0}, t283={3:0}, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 490 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 401 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 37 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=368occurred in iteration=7, InterpolantAutomatonStates: 52, 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.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 14:35:18,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5df1859-53e0-45a5-abab-678215c04dfb/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE