./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/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_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/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_465a0664-e625-4cd8-89bb-2157f8cf7d18/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 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --- 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 20:01:19,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:01:19,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:01:20,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:01:20,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:01:20,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:01:20,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:01:20,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:01:20,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:01:20,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:01:20,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:01:20,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:01:20,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:01:20,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:01:20,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:01:20,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:01:20,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:01:20,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:01:20,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:01:20,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:01:20,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:01:20,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:01:20,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:01:20,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:01:20,019 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:01:20,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:01:20,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:01:20,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:01:20,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:01:20,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:01:20,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:01:20,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:01:20,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:01:20,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:01:20,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:01:20,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:01:20,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:01:20,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:01:20,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:01:20,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:01:20,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:01:20,025 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:01:20,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:01:20,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:01:20,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:01:20,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:01:20,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:01:20,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:01:20,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:01:20,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:01:20,041 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:01:20,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:01:20,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:01:20,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:01:20,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:01:20,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:01:20,043 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:01:20,043 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:01:20,044 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:01:20,044 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_465a0664-e625-4cd8-89bb-2157f8cf7d18/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_465a0664-e625-4cd8-89bb-2157f8cf7d18/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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b [2022-12-13 20:01:20,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:01:20,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:01:20,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:01:20,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:01:20,236 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:01:20,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2022-12-13 20:01:22,801 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:01:23,023 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:01:23,023 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2022-12-13 20:01:23,035 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/data/d84e5fcbe/7b3e2242bb3046709497e0a92b2aaf6d/FLAG915367e74 [2022-12-13 20:01:23,374 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/data/d84e5fcbe/7b3e2242bb3046709497e0a92b2aaf6d [2022-12-13 20:01:23,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:01:23,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:01:23,379 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:01:23,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:01:23,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:01:23,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10939417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23, skipping insertion in model container [2022-12-13 20:01:23,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:01:23,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:01:23,550 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_465a0664-e625-4cd8-89bb-2157f8cf7d18/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2022-12-13 20:01:23,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:01:23,700 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:01:23,708 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_465a0664-e625-4cd8-89bb-2157f8cf7d18/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2022-12-13 20:01:23,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 20:01:23,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 20:01:23,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:01:23,761 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:01:23,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23 WrapperNode [2022-12-13 20:01:23,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:01:23,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:01:23,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:01:23,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:01:23,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,792 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-13 20:01:23,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:01:23,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:01:23,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:01:23,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:01:23,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,809 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:01:23,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:01:23,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:01:23,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:01:23,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (1/1) ... [2022-12-13 20:01:23,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:01:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:01:23,838 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:01:23,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:01:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:01:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 20:01:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:01:23,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 20:01:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 20:01:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 20:01:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 20:01:23,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:01:23,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:01:23,867 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 20:01:23,972 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:01:23,974 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:01:24,228 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:01:24,354 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:01:24,354 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:01:24,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:01:24 BoogieIcfgContainer [2022-12-13 20:01:24,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:01:24,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:01:24,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:01:24,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:01:24,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:01:23" (1/3) ... [2022-12-13 20:01:24,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d935b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:01:24, skipping insertion in model container [2022-12-13 20:01:24,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:01:23" (2/3) ... [2022-12-13 20:01:24,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d935b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:01:24, skipping insertion in model container [2022-12-13 20:01:24,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:01:24" (3/3) ... [2022-12-13 20:01:24,362 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2022-12-13 20:01:24,369 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 20:01:24,377 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:01:24,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 20:01:24,377 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 20:01:24,419 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 20:01:24,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-12-13 20:01:24,483 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-12-13 20:01:24,483 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:01:24,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 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/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 20:01:24,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-12-13 20:01:24,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-12-13 20:01:24,494 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 20:01:24,502 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2022-12-13 20:01:24,505 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2022-12-13 20:01:24,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2022-12-13 20:01:24,527 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-12-13 20:01:24,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:01:24,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 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/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 20:01:24,529 INFO L119 LiptonReduction]: Number of co-enabled transitions 2416 [2022-12-13 20:01:27,190 INFO L134 LiptonReduction]: Checked pairs total: 6951 [2022-12-13 20:01:27,191 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-12-13 20:01:27,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:01:27,207 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;@63b8e669, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:01:27,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 20:01:27,209 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 20:01:27,210 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 20:01:27,210 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:27,210 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 20:01:27,210 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 20:01:27,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:27,214 INFO L85 PathProgramCache]: Analyzing trace with hash 513033, now seen corresponding path program 1 times [2022-12-13 20:01:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766426202] [2022-12-13 20:01:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:27,462 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 20:01:27,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766426202] [2022-12-13 20:01:27,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766426202] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:27,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:27,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 20:01:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350321285] [2022-12-13 20:01:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:01:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:27,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:01:27,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:01:27,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 227 [2022-12-13 20:01:27,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:27,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:27,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 227 [2022-12-13 20:01:27,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:27,766 INFO L130 PetriNetUnfolder]: 1263/2021 cut-off events. [2022-12-13 20:01:27,766 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 20:01:27,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 2021 events. 1263/2021 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11534 event pairs, 204 based on Foata normal form. 80/1930 useless extension candidates. Maximal degree in co-relation 3921. Up to 1510 conditions per place. [2022-12-13 20:01:27,785 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 33 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2022-12-13 20:01:27,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 179 flow [2022-12-13 20:01:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:01:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:01:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-12-13 20:01:27,796 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5374449339207048 [2022-12-13 20:01:27,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-12-13 20:01:27,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-12-13 20:01:27,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:27,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-12-13 20:01:27,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:27,805 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 20:01:27,805 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 20:01:27,807 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 366 transitions. [2022-12-13 20:01:27,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 179 flow [2022-12-13 20:01:27,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 20:01:27,810 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-12-13 20:01:27,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 20:01:27,814 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-12-13 20:01:27,814 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-12-13 20:01:27,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:27,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:27,815 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:27,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:01:27,815 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 20:01:27,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -869996700, now seen corresponding path program 1 times [2022-12-13 20:01:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:27,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964641977] [2022-12-13 20:01:27,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:27,992 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 20:01:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:27,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964641977] [2022-12-13 20:01:27,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964641977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:27,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:27,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:01:27,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883618946] [2022-12-13 20:01:27,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:27,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:01:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:01:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:01:28,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 20:01:28,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:28,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 20:01:28,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:28,248 INFO L130 PetriNetUnfolder]: 1079/1646 cut-off events. [2022-12-13 20:01:28,248 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 20:01:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1646 events. 1079/1646 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7869 event pairs, 311 based on Foata normal form. 96/1729 useless extension candidates. Maximal degree in co-relation 3452. Up to 1025 conditions per place. [2022-12-13 20:01:28,253 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 27 selfloop transitions, 2 changer transitions 18/50 dead transitions. [2022-12-13 20:01:28,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 210 flow [2022-12-13 20:01:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:01:28,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:01:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-12-13 20:01:28,256 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.505726872246696 [2022-12-13 20:01:28,256 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2022-12-13 20:01:28,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2022-12-13 20:01:28,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:28,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2022-12-13 20:01:28,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,259 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 20:01:28,260 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 20:01:28,260 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 574 transitions. [2022-12-13 20:01:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 210 flow [2022-12-13 20:01:28,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 20:01:28,261 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2022-12-13 20:01:28,261 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=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-13 20:01:28,261 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-13 20:01:28,262 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2022-12-13 20:01:28,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:28,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:28,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:01:28,262 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 20:01:28,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash -244644767, now seen corresponding path program 1 times [2022-12-13 20:01:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:28,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733693594] [2022-12-13 20:01:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:28,388 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 20:01:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733693594] [2022-12-13 20:01:28,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733693594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:28,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:28,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:01:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48547620] [2022-12-13 20:01:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:01:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:01:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:01:28,416 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 20:01:28,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:28,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 20:01:28,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:28,762 INFO L130 PetriNetUnfolder]: 1833/2724 cut-off events. [2022-12-13 20:01:28,762 INFO L131 PetriNetUnfolder]: For 550/550 co-relation queries the response was YES. [2022-12-13 20:01:28,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5987 conditions, 2724 events. 1833/2724 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 12067 event pairs, 479 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 5974. Up to 1829 conditions per place. [2022-12-13 20:01:28,771 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 35 selfloop transitions, 2 changer transitions 20/57 dead transitions. [2022-12-13 20:01:28,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 253 flow [2022-12-13 20:01:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:01:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:01:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-12-13 20:01:28,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48370044052863437 [2022-12-13 20:01:28,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-12-13 20:01:28,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-12-13 20:01:28,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:28,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-12-13 20:01:28,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,775 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 20:01:28,776 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 20:01:28,776 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 549 transitions. [2022-12-13 20:01:28,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 253 flow [2022-12-13 20:01:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 243 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 20:01:28,787 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2022-12-13 20:01:28,787 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-13 20:01:28,788 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-13 20:01:28,788 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2022-12-13 20:01:28,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,788 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:28,788 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:01:28,789 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 20:01:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash 53103850, now seen corresponding path program 1 times [2022-12-13 20:01:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:28,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755281988] [2022-12-13 20:01:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:28,883 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 20:01:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755281988] [2022-12-13 20:01:28,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755281988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:28,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:28,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:01:28,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804421995] [2022-12-13 20:01:28,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:28,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:01:28,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:28,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:01:28,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:01:28,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 20:01:28,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:28,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:28,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 20:01:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:29,023 INFO L130 PetriNetUnfolder]: 411/703 cut-off events. [2022-12-13 20:01:29,023 INFO L131 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-12-13 20:01:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 703 events. 411/703 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3102 event pairs, 113 based on Foata normal form. 36/731 useless extension candidates. Maximal degree in co-relation 1560. Up to 552 conditions per place. [2022-12-13 20:01:29,027 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 30 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2022-12-13 20:01:29,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 170 flow [2022-12-13 20:01:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:01:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 20:01:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-12-13 20:01:29,029 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5139500734214391 [2022-12-13 20:01:29,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2022-12-13 20:01:29,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2022-12-13 20:01:29,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:29,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2022-12-13 20:01:29,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,032 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 20:01:29,032 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 20:01:29,032 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 3 states and 350 transitions. [2022-12-13 20:01:29,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 170 flow [2022-12-13 20:01:29,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 162 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 20:01:29,034 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 88 flow [2022-12-13 20:01:29,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-13 20:01:29,035 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-13 20:01:29,035 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 88 flow [2022-12-13 20:01:29,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:29,036 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:29,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:01:29,036 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 20:01:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -9692309, now seen corresponding path program 1 times [2022-12-13 20:01:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:29,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2309204] [2022-12-13 20:01:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:29,163 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 20:01:29,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:29,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2309204] [2022-12-13 20:01:29,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2309204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:29,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:29,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:01:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41115195] [2022-12-13 20:01:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:29,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:01:29,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:01:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:01:29,172 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 20:01:29,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:29,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 20:01:29,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:29,298 INFO L130 PetriNetUnfolder]: 195/379 cut-off events. [2022-12-13 20:01:29,298 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-13 20:01:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 379 events. 195/379 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1563 event pairs, 72 based on Foata normal form. 33/404 useless extension candidates. Maximal degree in co-relation 948. Up to 129 conditions per place. [2022-12-13 20:01:29,301 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 39 selfloop transitions, 7 changer transitions 0/50 dead transitions. [2022-12-13 20:01:29,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 238 flow [2022-12-13 20:01:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:01:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 20:01:29,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-12-13 20:01:29,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.51431718061674 [2022-12-13 20:01:29,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2022-12-13 20:01:29,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2022-12-13 20:01:29,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:29,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2022-12-13 20:01:29,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,305 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 20:01:29,306 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 20:01:29,306 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 88 flow. Second operand 4 states and 467 transitions. [2022-12-13 20:01:29,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 238 flow [2022-12-13 20:01:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 20:01:29,307 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2022-12-13 20:01:29,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-13 20:01:29,308 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-13 20:01:29,308 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2022-12-13 20:01:29,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:29,308 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:29,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:01:29,308 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 20:01:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:29,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1797088068, now seen corresponding path program 1 times [2022-12-13 20:01:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:29,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241884572] [2022-12-13 20:01:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:29,551 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 20:01:29,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:29,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241884572] [2022-12-13 20:01:29,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241884572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:29,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:29,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:01:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788498627] [2022-12-13 20:01:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:29,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:01:29,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:29,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:01:29,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:01:29,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 20:01:29,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:29,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 20:01:29,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:29,683 INFO L130 PetriNetUnfolder]: 159/307 cut-off events. [2022-12-13 20:01:29,684 INFO L131 PetriNetUnfolder]: For 232/232 co-relation queries the response was YES. [2022-12-13 20:01:29,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 307 events. 159/307 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1271 event pairs, 68 based on Foata normal form. 10/309 useless extension candidates. Maximal degree in co-relation 818. Up to 129 conditions per place. [2022-12-13 20:01:29,686 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 36 selfloop transitions, 10 changer transitions 0/50 dead transitions. [2022-12-13 20:01:29,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 262 flow [2022-12-13 20:01:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:01:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:01:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-12-13 20:01:29,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5039647577092511 [2022-12-13 20:01:29,688 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2022-12-13 20:01:29,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2022-12-13 20:01:29,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:29,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2022-12-13 20:01:29,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,690 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 20:01:29,691 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 20:01:29,691 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 5 states and 572 transitions. [2022-12-13 20:01:29,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 262 flow [2022-12-13 20:01:29,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 240 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 20:01:29,692 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 130 flow [2022-12-13 20:01:29,692 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 20:01:29,693 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2022-12-13 20:01:29,693 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 130 flow [2022-12-13 20:01:29,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:29,693 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:29,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:29,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:01:29,693 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 20:01:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:29,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1832378737, now seen corresponding path program 1 times [2022-12-13 20:01:29,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:29,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165954362] [2022-12-13 20:01:29,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:29,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:30,698 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 20:01:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:30,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165954362] [2022-12-13 20:01:30,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165954362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:30,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:30,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:01:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002859844] [2022-12-13 20:01:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:30,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:01:30,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:01:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:01:30,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 227 [2022-12-13 20:01:30,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:30,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:30,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 227 [2022-12-13 20:01:30,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:31,034 INFO L130 PetriNetUnfolder]: 221/433 cut-off events. [2022-12-13 20:01:31,035 INFO L131 PetriNetUnfolder]: For 453/453 co-relation queries the response was YES. [2022-12-13 20:01:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 433 events. 221/433 cut-off events. For 453/453 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1931 event pairs, 28 based on Foata normal form. 1/431 useless extension candidates. Maximal degree in co-relation 1246. Up to 145 conditions per place. [2022-12-13 20:01:31,036 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 47 selfloop transitions, 7 changer transitions 27/85 dead transitions. [2022-12-13 20:01:31,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 85 transitions, 574 flow [2022-12-13 20:01:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 20:01:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 20:01:31,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 836 transitions. [2022-12-13 20:01:31,038 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.460352422907489 [2022-12-13 20:01:31,038 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 836 transitions. [2022-12-13 20:01:31,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 836 transitions. [2022-12-13 20:01:31,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:31,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 836 transitions. [2022-12-13 20:01:31,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,042 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,042 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 130 flow. Second operand 8 states and 836 transitions. [2022-12-13 20:01:31,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 85 transitions, 574 flow [2022-12-13 20:01:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 85 transitions, 488 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 20:01:31,044 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 149 flow [2022-12-13 20:01:31,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 20:01:31,045 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2022-12-13 20:01:31,045 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 149 flow [2022-12-13 20:01:31,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:31,045 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:31,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:01:31,045 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 20:01:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1289796087, now seen corresponding path program 2 times [2022-12-13 20:01:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:31,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001096468] [2022-12-13 20:01:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:31,186 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 20:01:31,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:31,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001096468] [2022-12-13 20:01:31,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001096468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:31,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:01:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781477454] [2022-12-13 20:01:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:31,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:01:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:01:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:01:31,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 20:01:31,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:31,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 20:01:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:31,394 INFO L130 PetriNetUnfolder]: 352/737 cut-off events. [2022-12-13 20:01:31,394 INFO L131 PetriNetUnfolder]: For 604/604 co-relation queries the response was YES. [2022-12-13 20:01:31,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 737 events. 352/737 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3960 event pairs, 41 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 2133. Up to 336 conditions per place. [2022-12-13 20:01:31,397 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 44 selfloop transitions, 1 changer transitions 26/74 dead transitions. [2022-12-13 20:01:31,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 473 flow [2022-12-13 20:01:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:01:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:01:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-12-13 20:01:31,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4933920704845815 [2022-12-13 20:01:31,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 560 transitions. [2022-12-13 20:01:31,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 560 transitions. [2022-12-13 20:01:31,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:31,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 560 transitions. [2022-12-13 20:01:31,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,403 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 20:01:31,404 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 20:01:31,404 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 149 flow. Second operand 5 states and 560 transitions. [2022-12-13 20:01:31,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 473 flow [2022-12-13 20:01:31,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 466 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 20:01:31,408 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 153 flow [2022-12-13 20:01:31,408 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-12-13 20:01:31,409 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-13 20:01:31,409 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 153 flow [2022-12-13 20:01:31,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:31,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:31,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:01:31,410 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 20:01:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1971539337, now seen corresponding path program 3 times [2022-12-13 20:01:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:31,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424381563] [2022-12-13 20:01:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:31,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:01:31,596 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 20:01:31,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:01:31,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424381563] [2022-12-13 20:01:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424381563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:01:31,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:01:31,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:01:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788459150] [2022-12-13 20:01:31,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:01:31,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:01:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:01:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:01:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:01:31,612 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 20:01:31,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 20:01:31,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 20:01:31,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 20:01:31,792 INFO L130 PetriNetUnfolder]: 336/680 cut-off events. [2022-12-13 20:01:31,792 INFO L131 PetriNetUnfolder]: For 820/820 co-relation queries the response was YES. [2022-12-13 20:01:31,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 680 events. 336/680 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3380 event pairs, 114 based on Foata normal form. 1/667 useless extension candidates. Maximal degree in co-relation 2113. Up to 260 conditions per place. [2022-12-13 20:01:31,794 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 28 selfloop transitions, 1 changer transitions 33/65 dead transitions. [2022-12-13 20:01:31,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 427 flow [2022-12-13 20:01:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:01:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 20:01:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2022-12-13 20:01:31,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4889867841409692 [2022-12-13 20:01:31,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2022-12-13 20:01:31,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2022-12-13 20:01:31,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 20:01:31,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2022-12-13 20:01:31,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,798 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 20:01:31,799 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 20:01:31,799 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 153 flow. Second operand 5 states and 555 transitions. [2022-12-13 20:01:31,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 427 flow [2022-12-13 20:01:31,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 419 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 20:01:31,802 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 130 flow [2022-12-13 20:01:31,802 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2022-12-13 20:01:31,802 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2022-12-13 20:01:31,803 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 130 flow [2022-12-13 20:01:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:01:31,803 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 20:01:31,803 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:31,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:01:31,803 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 20:01:31,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:01:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2037270745, now seen corresponding path program 4 times [2022-12-13 20:01:31,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:01:31,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073425654] [2022-12-13 20:01:31,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:01:31,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:01:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:01:31,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:01:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:01:31,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:01:31,910 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:01:31,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 20:01:31,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 20:01:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 20:01:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 20:01:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 20:01:31,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 20:01:31,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:01:31,913 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-13 20:01:31,918 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 20:01:31,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:01:31,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:01:31 BasicIcfg [2022-12-13 20:01:31,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:01:31,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:01:31,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:01:31,958 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:01:31,958 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:01:24" (3/4) ... [2022-12-13 20:01:31,959 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:01:32,006 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:01:32,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:01:32,007 INFO L158 Benchmark]: Toolchain (without parser) took 8628.80ms. Allocated memory was 138.4MB in the beginning and 209.7MB in the end (delta: 71.3MB). Free memory was 100.8MB in the beginning and 97.7MB in the end (delta: 3.1MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,007 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:01:32,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.92ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 73.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,007 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 71.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,008 INFO L158 Benchmark]: Boogie Preprocessor took 19.46ms. Allocated memory is still 138.4MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,008 INFO L158 Benchmark]: RCFGBuilder took 542.86ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 69.3MB in the beginning and 135.8MB in the end (delta: -66.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,008 INFO L158 Benchmark]: TraceAbstraction took 7599.43ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 135.8MB in the beginning and 110.3MB in the end (delta: 25.5MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,008 INFO L158 Benchmark]: Witness Printer took 48.90ms. Allocated memory is still 209.7MB. Free memory was 110.3MB in the beginning and 97.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 20:01:32,009 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.92ms. Allocated memory is still 138.4MB. Free memory was 100.8MB in the beginning and 73.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 138.4MB. Free memory was 73.5MB in the beginning and 71.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.46ms. Allocated memory is still 138.4MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.86ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 69.3MB in the beginning and 135.8MB in the end (delta: -66.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7599.43ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 135.8MB in the beginning and 110.3MB in the end (delta: 25.5MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Witness Printer took 48.90ms. Allocated memory is still 209.7MB. Free memory was 110.3MB in the beginning and 97.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 127 PlacesBefore, 37 PlacesAfterwards, 119 TransitionsBefore, 28 TransitionsAfterwards, 2416 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 6951 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3070, independent: 2856, independent conditional: 0, independent unconditional: 2856, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1315, independent: 1278, independent conditional: 0, independent unconditional: 1278, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3070, independent: 1578, independent conditional: 0, independent unconditional: 1578, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 1315, unknown conditional: 0, unknown unconditional: 1315] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t257, ((void *)0), P0, ((void *)0))=-3, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-2, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, pthread_create(&t259, ((void *)0), P2, ((void *)0))=-1, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 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) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 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 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 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_p0_EAX=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=1, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 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) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=49, weak$$choice2=255, x=1, y=1, z=1] [L828] 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) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 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 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=49, weak$$choice2=255, x=1, y=1, z=1] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=49, weak$$choice2=255, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 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 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 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_p0_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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: 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. - UnprovableResult [Line: 855]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 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: 7.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 166 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 970 IncrementalHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 54 mSDtfsCounter, 970 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=8, InterpolantAutomatonStates: 43, 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, 2.1s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 20:01:32,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_465a0664-e625-4cd8-89bb-2157f8cf7d18/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