./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/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_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/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_dfd8e40a-470c-44ef-9db5-8072c11274ff/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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- 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 17:31:41,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:31:41,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:31:41,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:31:41,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:31:41,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:31:41,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:31:41,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:31:41,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:31:41,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:31:41,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:31:41,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:31:41,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:31:41,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:31:41,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:31:41,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:31:41,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:31:41,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:31:41,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:31:41,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:31:41,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:31:41,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:31:41,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:31:41,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:31:41,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:31:41,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:31:41,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:31:41,288 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:31:41,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:31:41,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:31:41,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:31:41,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:31:41,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:31:41,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:31:41,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:31:41,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:31:41,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:31:41,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:31:41,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:31:41,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:31:41,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:31:41,296 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:31:41,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:31:41,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:31:41,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:31:41,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:31:41,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:31:41,320 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:31:41,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:31:41,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:31:41,322 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:31:41,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:31:41,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:31:41,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:31:41,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:31:41,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:31:41,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:31:41,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:31:41,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:31:41,323 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:31:41,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:31:41,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:31:41,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:31:41,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:31:41,326 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:31:41,326 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_dfd8e40a-470c-44ef-9db5-8072c11274ff/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_dfd8e40a-470c-44ef-9db5-8072c11274ff/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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2022-12-13 17:31:41,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:31:41,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:31:41,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:31:41,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:31:41,532 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:31:41,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-12-13 17:31:44,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:31:44,373 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:31:44,374 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2022-12-13 17:31:44,386 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/data/18df6457c/a4b5374a7def45a8a63ca3d32456754f/FLAGfd2c98486 [2022-12-13 17:31:44,401 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/data/18df6457c/a4b5374a7def45a8a63ca3d32456754f [2022-12-13 17:31:44,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:31:44,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:31:44,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:31:44,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:31:44,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:31:44,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@187c06e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44, skipping insertion in model container [2022-12-13 17:31:44,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:31:44,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:31:44,556 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_dfd8e40a-470c-44ef-9db5-8072c11274ff/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-12-13 17:31:44,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:31:44,704 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:31:44,713 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_dfd8e40a-470c-44ef-9db5-8072c11274ff/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2022-12-13 17:31:44,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:31:44,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:31:44,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:31:44,776 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:31:44,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44 WrapperNode [2022-12-13 17:31:44,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:31:44,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:31:44,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:31:44,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:31:44,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,812 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-13 17:31:44,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:31:44,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:31:44,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:31:44,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:31:44,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,836 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:31:44,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:31:44,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:31:44,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:31:44,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (1/1) ... [2022-12-13 17:31:44,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:31:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:31:44,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:31:44,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:31:44,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:31:44,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:31:44,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:31:44,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:31:44,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 17:31:44,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 17:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:31:44,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:31:44,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:31:44,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:31:44,907 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 17:31:45,016 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:31:45,018 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:31:45,300 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:31:45,392 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:31:45,392 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:31:45,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:31:45 BoogieIcfgContainer [2022-12-13 17:31:45,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:31:45,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:31:45,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:31:45,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:31:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:31:44" (1/3) ... [2022-12-13 17:31:45,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd1e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:31:45, skipping insertion in model container [2022-12-13 17:31:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:31:44" (2/3) ... [2022-12-13 17:31:45,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbd1e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:31:45, skipping insertion in model container [2022-12-13 17:31:45,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:31:45" (3/3) ... [2022-12-13 17:31:45,399 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-12-13 17:31:45,405 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 17:31:45,413 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:31:45,413 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 17:31:45,413 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:31:45,447 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:31:45,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-12-13 17:31:45,511 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-12-13 17:31:45,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:31:45,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 17:31:45,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-12-13 17:31:45,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-12-13 17:31:45,521 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:31:45,528 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 134 transitions, 280 flow [2022-12-13 17:31:45,530 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 134 transitions, 280 flow [2022-12-13 17:31:45,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 280 flow [2022-12-13 17:31:45,552 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-12-13 17:31:45,553 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:31:45,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 17:31:45,555 INFO L119 LiptonReduction]: Number of co-enabled transitions 3074 [2022-12-13 17:31:48,852 INFO L134 LiptonReduction]: Checked pairs total: 7146 [2022-12-13 17:31:48,852 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-12-13 17:31:48,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:31:48,867 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;@7752c450, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:31:48,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 17:31:48,870 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 17:31:48,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:31:48,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:48,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:48,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 207520437, now seen corresponding path program 1 times [2022-12-13 17:31:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:48,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730706184] [2022-12-13 17:31:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:48,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:49,183 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 17:31:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:49,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730706184] [2022-12-13 17:31:49,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730706184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:49,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:49,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:31:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066524848] [2022-12-13 17:31:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:31:49,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:31:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:31:49,213 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 255 [2022-12-13 17:31:49,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:49,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 255 [2022-12-13 17:31:49,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:49,671 INFO L130 PetriNetUnfolder]: 2594/3778 cut-off events. [2022-12-13 17:31:49,671 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 17:31:49,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7473 conditions, 3778 events. 2594/3778 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20064 event pairs, 518 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 7461. Up to 2797 conditions per place. [2022-12-13 17:31:49,690 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 17:31:49,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-12-13 17:31:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:31:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:31:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2022-12-13 17:31:49,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5320261437908497 [2022-12-13 17:31:49,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2022-12-13 17:31:49,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2022-12-13 17:31:49,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:49,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2022-12-13 17:31:49,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,718 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 407 transitions. [2022-12-13 17:31:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-12-13 17:31:49,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 17:31:49,724 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-12-13 17:31:49,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 17:31:49,728 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 17:31:49,729 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-12-13 17:31:49,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:49,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:31:49,729 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1858704965, now seen corresponding path program 1 times [2022-12-13 17:31:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555267532] [2022-12-13 17:31:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:49,947 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 17:31:49,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:49,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555267532] [2022-12-13 17:31:49,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555267532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:49,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:31:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975514054] [2022-12-13 17:31:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:49,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:31:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:31:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:31:49,967 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2022-12-13 17:31:49,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:49,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:49,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2022-12-13 17:31:49,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:50,589 INFO L130 PetriNetUnfolder]: 5909/8022 cut-off events. [2022-12-13 17:31:50,589 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2022-12-13 17:31:50,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16570 conditions, 8022 events. 5909/8022 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 35247 event pairs, 2449 based on Foata normal form. 16/8038 useless extension candidates. Maximal degree in co-relation 16560. Up to 7831 conditions per place. [2022-12-13 17:31:50,616 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2022-12-13 17:31:50,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2022-12-13 17:31:50,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:31:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:31:50,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-12-13 17:31:50,618 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5071895424836601 [2022-12-13 17:31:50,618 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-12-13 17:31:50,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-12-13 17:31:50,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:50,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-12-13 17:31:50,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:50,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:50,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:50,620 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 388 transitions. [2022-12-13 17:31:50,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2022-12-13 17:31:50,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:31:50,622 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2022-12-13 17:31:50,634 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-13 17:31:50,635 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 17:31:50,635 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2022-12-13 17:31:50,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:50,635 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:50,636 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:50,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:31:50,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:50,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash 830877273, now seen corresponding path program 1 times [2022-12-13 17:31:50,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:50,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403520421] [2022-12-13 17:31:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:50,806 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 17:31:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:50,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403520421] [2022-12-13 17:31:50,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403520421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:50,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:50,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:31:50,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265502032] [2022-12-13 17:31:50,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:50,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:50,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:50,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:50,826 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2022-12-13 17:31:50,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:50,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:50,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2022-12-13 17:31:50,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:51,478 INFO L130 PetriNetUnfolder]: 5333/7270 cut-off events. [2022-12-13 17:31:51,478 INFO L131 PetriNetUnfolder]: For 1335/1335 co-relation queries the response was YES. [2022-12-13 17:31:51,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16745 conditions, 7270 events. 5333/7270 cut-off events. For 1335/1335 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 32210 event pairs, 2179 based on Foata normal form. 176/7446 useless extension candidates. Maximal degree in co-relation 16734. Up to 5011 conditions per place. [2022-12-13 17:31:51,509 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-13 17:31:51,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 231 flow [2022-12-13 17:31:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:31:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:31:51,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-12-13 17:31:51,511 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5084967320261438 [2022-12-13 17:31:51,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-12-13 17:31:51,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-12-13 17:31:51,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:51,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-12-13 17:31:51,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:51,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:51,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:51,516 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 389 transitions. [2022-12-13 17:31:51,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 231 flow [2022-12-13 17:31:51,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:31:51,518 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2022-12-13 17:31:51,518 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=88, 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=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 17:31:51,519 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-12-13 17:31:51,519 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2022-12-13 17:31:51,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:51,520 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:51,520 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:51,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:31:51,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1458848811, now seen corresponding path program 1 times [2022-12-13 17:31:51,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:51,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101921181] [2022-12-13 17:31:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:51,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:51,654 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 17:31:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:51,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101921181] [2022-12-13 17:31:51,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101921181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:51,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:51,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:31:51,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819161660] [2022-12-13 17:31:51,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:51,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:51,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:51,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:51,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:51,669 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 255 [2022-12-13 17:31:51,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:51,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:51,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 255 [2022-12-13 17:31:51,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:52,166 INFO L130 PetriNetUnfolder]: 5029/6870 cut-off events. [2022-12-13 17:31:52,167 INFO L131 PetriNetUnfolder]: For 2187/2187 co-relation queries the response was YES. [2022-12-13 17:31:52,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16473 conditions, 6870 events. 5029/6870 cut-off events. For 2187/2187 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29160 event pairs, 1599 based on Foata normal form. 96/6966 useless extension candidates. Maximal degree in co-relation 16460. Up to 4561 conditions per place. [2022-12-13 17:31:52,185 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 17:31:52,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 216 flow [2022-12-13 17:31:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:31:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:31:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-12-13 17:31:52,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2022-12-13 17:31:52,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-12-13 17:31:52,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-12-13 17:31:52,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:52,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-12-13 17:31:52,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,189 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 3 states and 384 transitions. [2022-12-13 17:31:52,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 216 flow [2022-12-13 17:31:52,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:31:52,191 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 104 flow [2022-12-13 17:31:52,191 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-13 17:31:52,192 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-13 17:31:52,192 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 104 flow [2022-12-13 17:31:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:52,192 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:31:52,193 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 345685549, now seen corresponding path program 1 times [2022-12-13 17:31:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:52,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639272962] [2022-12-13 17:31:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:52,356 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 17:31:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639272962] [2022-12-13 17:31:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639272962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:52,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:31:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280841621] [2022-12-13 17:31:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:52,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:52,367 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-12-13 17:31:52,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:52,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-12-13 17:31:52,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:52,863 INFO L130 PetriNetUnfolder]: 2510/3784 cut-off events. [2022-12-13 17:31:52,863 INFO L131 PetriNetUnfolder]: For 1081/1099 co-relation queries the response was YES. [2022-12-13 17:31:52,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8902 conditions, 3784 events. 2510/3784 cut-off events. For 1081/1099 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 20696 event pairs, 441 based on Foata normal form. 289/3968 useless extension candidates. Maximal degree in co-relation 8888. Up to 1619 conditions per place. [2022-12-13 17:31:52,872 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 47 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-12-13 17:31:52,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 288 flow [2022-12-13 17:31:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:31:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:31:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-12-13 17:31:52,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-13 17:31:52,874 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2022-12-13 17:31:52,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2022-12-13 17:31:52,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:52,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2022-12-13 17:31:52,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,876 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,876 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 104 flow. Second operand 4 states and 525 transitions. [2022-12-13 17:31:52,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 288 flow [2022-12-13 17:31:52,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:31:52,879 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 144 flow [2022-12-13 17:31:52,879 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 17:31:52,879 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2022-12-13 17:31:52,879 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 144 flow [2022-12-13 17:31:52,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:52,880 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:52,880 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:52,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:31:52,880 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:52,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2057627742, now seen corresponding path program 1 times [2022-12-13 17:31:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:52,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099474325] [2022-12-13 17:31:52,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:52,999 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 17:31:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:53,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099474325] [2022-12-13 17:31:53,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099474325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:53,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:53,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:31:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429720988] [2022-12-13 17:31:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:53,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:53,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:53,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-12-13 17:31:53,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:53,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-12-13 17:31:53,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:53,549 INFO L130 PetriNetUnfolder]: 3608/5719 cut-off events. [2022-12-13 17:31:53,549 INFO L131 PetriNetUnfolder]: For 3496/3496 co-relation queries the response was YES. [2022-12-13 17:31:53,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 5719 events. 3608/5719 cut-off events. For 3496/3496 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 35195 event pairs, 790 based on Foata normal form. 42/5761 useless extension candidates. Maximal degree in co-relation 16526. Up to 2706 conditions per place. [2022-12-13 17:31:53,563 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 58 selfloop transitions, 2 changer transitions 14/78 dead transitions. [2022-12-13 17:31:53,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 78 transitions, 465 flow [2022-12-13 17:31:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:31:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:31:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2022-12-13 17:31:53,565 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5284313725490196 [2022-12-13 17:31:53,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2022-12-13 17:31:53,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2022-12-13 17:31:53,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:53,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2022-12-13 17:31:53,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,567 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 144 flow. Second operand 4 states and 539 transitions. [2022-12-13 17:31:53,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 78 transitions, 465 flow [2022-12-13 17:31:53,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 78 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:31:53,569 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 159 flow [2022-12-13 17:31:53,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-12-13 17:31:53,570 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 17:31:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 159 flow [2022-12-13 17:31:53,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,570 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:53,570 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 17:31:53,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:31:53,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:53,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -426000650, now seen corresponding path program 1 times [2022-12-13 17:31:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:53,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932462370] [2022-12-13 17:31:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:53,699 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 17:31:53,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:53,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932462370] [2022-12-13 17:31:53,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932462370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:53,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:53,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:31:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469143011] [2022-12-13 17:31:53,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:31:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:31:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:31:53,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-12-13 17:31:53,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:53,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:53,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-12-13 17:31:53,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:54,187 INFO L130 PetriNetUnfolder]: 2846/4464 cut-off events. [2022-12-13 17:31:54,187 INFO L131 PetriNetUnfolder]: For 3435/3574 co-relation queries the response was YES. [2022-12-13 17:31:54,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13153 conditions, 4464 events. 2846/4464 cut-off events. For 3435/3574 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 26716 event pairs, 479 based on Foata normal form. 311/4620 useless extension candidates. Maximal degree in co-relation 13135. Up to 1764 conditions per place. [2022-12-13 17:31:54,199 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 59 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2022-12-13 17:31:54,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 429 flow [2022-12-13 17:31:54,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:31:54,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:31:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-12-13 17:31:54,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5168627450980392 [2022-12-13 17:31:54,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2022-12-13 17:31:54,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2022-12-13 17:31:54,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:54,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2022-12-13 17:31:54,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:54,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:54,203 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:54,203 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 159 flow. Second operand 5 states and 659 transitions. [2022-12-13 17:31:54,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 429 flow [2022-12-13 17:31:54,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 76 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:31:54,206 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 225 flow [2022-12-13 17:31:54,206 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-13 17:31:54,207 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-12-13 17:31:54,207 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 225 flow [2022-12-13 17:31:54,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:54,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:54,207 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 17:31:54,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:31:54,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:54,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -472315335, now seen corresponding path program 1 times [2022-12-13 17:31:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:54,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370386065] [2022-12-13 17:31:54,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:54,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:54,366 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 17:31:54,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:54,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370386065] [2022-12-13 17:31:54,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370386065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:54,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:54,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:31:54,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937576841] [2022-12-13 17:31:54,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:54,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:31:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:54,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:31:54,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:31:54,384 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-12-13 17:31:54,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:54,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:54,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-12-13 17:31:54,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:55,040 INFO L130 PetriNetUnfolder]: 2589/4093 cut-off events. [2022-12-13 17:31:55,040 INFO L131 PetriNetUnfolder]: For 6839/7102 co-relation queries the response was YES. [2022-12-13 17:31:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14600 conditions, 4093 events. 2589/4093 cut-off events. For 6839/7102 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 24360 event pairs, 468 based on Foata normal form. 173/4115 useless extension candidates. Maximal degree in co-relation 14579. Up to 1554 conditions per place. [2022-12-13 17:31:55,054 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 69 selfloop transitions, 14 changer transitions 0/90 dead transitions. [2022-12-13 17:31:55,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 566 flow [2022-12-13 17:31:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:31:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:31:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2022-12-13 17:31:55,057 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5169934640522876 [2022-12-13 17:31:55,058 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2022-12-13 17:31:55,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2022-12-13 17:31:55,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:55,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2022-12-13 17:31:55,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:55,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:55,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:55,064 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 225 flow. Second operand 6 states and 791 transitions. [2022-12-13 17:31:55,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 566 flow [2022-12-13 17:31:55,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 550 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 17:31:55,073 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 295 flow [2022-12-13 17:31:55,073 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 17:31:55,074 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2022-12-13 17:31:55,074 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 295 flow [2022-12-13 17:31:55,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:55,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:55,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:55,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:31:55,075 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:55,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1899305437, now seen corresponding path program 1 times [2022-12-13 17:31:55,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:55,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474397357] [2022-12-13 17:31:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:55,294 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 17:31:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:55,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474397357] [2022-12-13 17:31:55,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474397357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:55,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:55,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:31:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77628142] [2022-12-13 17:31:55,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:55,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:55,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:55,316 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 255 [2022-12-13 17:31:55,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:55,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:55,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 255 [2022-12-13 17:31:55,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:56,152 INFO L130 PetriNetUnfolder]: 6169/9265 cut-off events. [2022-12-13 17:31:56,152 INFO L131 PetriNetUnfolder]: For 25160/25160 co-relation queries the response was YES. [2022-12-13 17:31:56,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35260 conditions, 9265 events. 6169/9265 cut-off events. For 25160/25160 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 53824 event pairs, 482 based on Foata normal form. 10/9275 useless extension candidates. Maximal degree in co-relation 35237. Up to 5879 conditions per place. [2022-12-13 17:31:56,174 INFO L137 encePairwiseOnDemand]: 246/255 looper letters, 89 selfloop transitions, 14 changer transitions 15/118 dead transitions. [2022-12-13 17:31:56,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 985 flow [2022-12-13 17:31:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:31:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:31:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2022-12-13 17:31:56,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2022-12-13 17:31:56,175 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2022-12-13 17:31:56,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2022-12-13 17:31:56,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:56,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2022-12-13 17:31:56,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,178 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 295 flow. Second operand 5 states and 640 transitions. [2022-12-13 17:31:56,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 985 flow [2022-12-13 17:31:56,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 118 transitions, 903 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 17:31:56,294 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 335 flow [2022-12-13 17:31:56,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=335, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2022-12-13 17:31:56,294 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-12-13 17:31:56,294 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 335 flow [2022-12-13 17:31:56,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:56,294 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:56,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:31:56,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -899988233, now seen corresponding path program 2 times [2022-12-13 17:31:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:56,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876298436] [2022-12-13 17:31:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:56,445 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 17:31:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876298436] [2022-12-13 17:31:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876298436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:56,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:56,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:31:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726242656] [2022-12-13 17:31:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:31:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:31:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:31:56,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-12-13 17:31:56,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:56,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-12-13 17:31:56,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:56,868 INFO L130 PetriNetUnfolder]: 1624/2642 cut-off events. [2022-12-13 17:31:56,868 INFO L131 PetriNetUnfolder]: For 6477/6870 co-relation queries the response was YES. [2022-12-13 17:31:56,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10248 conditions, 2642 events. 1624/2642 cut-off events. For 6477/6870 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15032 event pairs, 267 based on Foata normal form. 220/2713 useless extension candidates. Maximal degree in co-relation 10223. Up to 942 conditions per place. [2022-12-13 17:31:56,876 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 61 selfloop transitions, 18 changer transitions 4/91 dead transitions. [2022-12-13 17:31:56,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 674 flow [2022-12-13 17:31:56,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:31:56,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:31:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2022-12-13 17:31:56,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2022-12-13 17:31:56,877 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2022-12-13 17:31:56,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2022-12-13 17:31:56,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:56,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2022-12-13 17:31:56,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,880 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,880 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 335 flow. Second operand 7 states and 896 transitions. [2022-12-13 17:31:56,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 674 flow [2022-12-13 17:31:56,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 617 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-13 17:31:56,947 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 323 flow [2022-12-13 17:31:56,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=323, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2022-12-13 17:31:56,947 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-12-13 17:31:56,948 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 323 flow [2022-12-13 17:31:56,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:56,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:56,948 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:56,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:31:56,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1766774278, now seen corresponding path program 1 times [2022-12-13 17:31:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102207043] [2022-12-13 17:31:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:56,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:57,075 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 17:31:57,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:57,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102207043] [2022-12-13 17:31:57,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102207043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:57,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:57,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:31:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186296883] [2022-12-13 17:31:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:57,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:57,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:57,083 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-12-13 17:31:57,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:57,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-12-13 17:31:57,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:57,397 INFO L130 PetriNetUnfolder]: 1339/2267 cut-off events. [2022-12-13 17:31:57,397 INFO L131 PetriNetUnfolder]: For 5474/5525 co-relation queries the response was YES. [2022-12-13 17:31:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8673 conditions, 2267 events. 1339/2267 cut-off events. For 5474/5525 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12508 event pairs, 277 based on Foata normal form. 1/2203 useless extension candidates. Maximal degree in co-relation 8655. Up to 1259 conditions per place. [2022-12-13 17:31:57,404 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 40 selfloop transitions, 1 changer transitions 58/103 dead transitions. [2022-12-13 17:31:57,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 882 flow [2022-12-13 17:31:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:31:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:31:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2022-12-13 17:31:57,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5245098039215687 [2022-12-13 17:31:57,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2022-12-13 17:31:57,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2022-12-13 17:31:57,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:57,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2022-12-13 17:31:57,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,408 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,408 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 323 flow. Second operand 4 states and 535 transitions. [2022-12-13 17:31:57,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 882 flow [2022-12-13 17:31:57,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 773 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-13 17:31:57,425 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 230 flow [2022-12-13 17:31:57,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2022-12-13 17:31:57,426 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-12-13 17:31:57,426 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 230 flow [2022-12-13 17:31:57,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:57,426 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:57,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:31:57,426 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:57,427 INFO L85 PathProgramCache]: Analyzing trace with hash 915304562, now seen corresponding path program 2 times [2022-12-13 17:31:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:57,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761450184] [2022-12-13 17:31:57,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:57,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:57,547 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 17:31:57,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:57,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761450184] [2022-12-13 17:31:57,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761450184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:57,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:57,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:31:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125284290] [2022-12-13 17:31:57,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:57,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:31:57,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:57,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:31:57,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:31:57,556 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-12-13 17:31:57,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:57,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-12-13 17:31:57,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:57,739 INFO L130 PetriNetUnfolder]: 648/1128 cut-off events. [2022-12-13 17:31:57,739 INFO L131 PetriNetUnfolder]: For 1909/1916 co-relation queries the response was YES. [2022-12-13 17:31:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1128 events. 648/1128 cut-off events. For 1909/1916 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5677 event pairs, 120 based on Foata normal form. 8/1104 useless extension candidates. Maximal degree in co-relation 4035. Up to 537 conditions per place. [2022-12-13 17:31:57,742 INFO L137 encePairwiseOnDemand]: 252/255 looper letters, 44 selfloop transitions, 1 changer transitions 29/77 dead transitions. [2022-12-13 17:31:57,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 578 flow [2022-12-13 17:31:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:31:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:31:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2022-12-13 17:31:57,743 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2022-12-13 17:31:57,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2022-12-13 17:31:57,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2022-12-13 17:31:57,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:57,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2022-12-13 17:31:57,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,745 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,745 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 230 flow. Second operand 4 states and 528 transitions. [2022-12-13 17:31:57,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 578 flow [2022-12-13 17:31:57,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 448 flow, removed 11 selfloop flow, removed 10 redundant places. [2022-12-13 17:31:57,751 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 151 flow [2022-12-13 17:31:57,751 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-13 17:31:57,752 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-12-13 17:31:57,752 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 151 flow [2022-12-13 17:31:57,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:57,752 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:57,752 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:57,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:31:57,752 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 300108798, now seen corresponding path program 3 times [2022-12-13 17:31:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367794074] [2022-12-13 17:31:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:31:58,537 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 17:31:58,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:31:58,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367794074] [2022-12-13 17:31:58,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367794074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:31:58,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:31:58,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:31:58,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272638623] [2022-12-13 17:31:58,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:31:58,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:31:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:31:58,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:31:58,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:31:58,599 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 17:31:58,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:58,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:31:58,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 17:31:58,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:31:58,857 INFO L130 PetriNetUnfolder]: 433/782 cut-off events. [2022-12-13 17:31:58,857 INFO L131 PetriNetUnfolder]: For 824/836 co-relation queries the response was YES. [2022-12-13 17:31:58,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 782 events. 433/782 cut-off events. For 824/836 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3788 event pairs, 86 based on Foata normal form. 2/731 useless extension candidates. Maximal degree in co-relation 2391. Up to 302 conditions per place. [2022-12-13 17:31:58,859 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 34 selfloop transitions, 4 changer transitions 40/82 dead transitions. [2022-12-13 17:31:58,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 482 flow [2022-12-13 17:31:58,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:31:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 17:31:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 999 transitions. [2022-12-13 17:31:58,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48970588235294116 [2022-12-13 17:31:58,861 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 999 transitions. [2022-12-13 17:31:58,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 999 transitions. [2022-12-13 17:31:58,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:31:58,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 999 transitions. [2022-12-13 17:31:58,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:58,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:58,864 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:58,864 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 151 flow. Second operand 8 states and 999 transitions. [2022-12-13 17:31:58,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 482 flow [2022-12-13 17:31:58,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 474 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 17:31:58,866 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 160 flow [2022-12-13 17:31:58,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2022-12-13 17:31:58,866 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-12-13 17:31:58,867 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 160 flow [2022-12-13 17:31:58,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:31:58,867 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:31:58,867 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:58,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:31:58,867 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:31:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:31:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1623520446, now seen corresponding path program 4 times [2022-12-13 17:31:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:31:58,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609896855] [2022-12-13 17:31:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:31:58,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:31:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:31:58,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:31:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:31:58,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:31:58,938 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:31:58,938 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 17:31:58,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 17:31:58,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 17:31:58,940 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 17:31:58,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 17:31:58,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 17:31:58,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 17:31:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:31:58,941 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:31:58,945 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:31:58,945 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:31:58,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:31:58 BasicIcfg [2022-12-13 17:31:58,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:31:58,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:31:58,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:31:58,995 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:31:58,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:31:45" (3/4) ... [2022-12-13 17:31:58,996 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:31:59,045 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:31:59,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:31:59,046 INFO L158 Benchmark]: Toolchain (without parser) took 14641.52ms. Allocated memory was 151.0MB in the beginning and 918.6MB in the end (delta: 767.6MB). Free memory was 108.7MB in the beginning and 765.3MB in the end (delta: -656.6MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,046 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:31:59,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.22ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 79.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,047 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.26ms. Allocated memory is still 151.0MB. Free memory was 79.8MB in the beginning and 77.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,047 INFO L158 Benchmark]: Boogie Preprocessor took 27.51ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,047 INFO L158 Benchmark]: RCFGBuilder took 552.34ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 102.6MB in the end (delta: -28.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,047 INFO L158 Benchmark]: TraceAbstraction took 13598.89ms. Allocated memory was 151.0MB in the beginning and 918.6MB in the end (delta: 767.6MB). Free memory was 102.0MB in the beginning and 781.0MB in the end (delta: -679.0MB). Peak memory consumption was 627.0MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,047 INFO L158 Benchmark]: Witness Printer took 51.37ms. Allocated memory is still 918.6MB. Free memory was 781.0MB in the beginning and 765.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 17:31:59,048 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.19ms. Allocated memory is still 151.0MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.22ms. Allocated memory is still 151.0MB. Free memory was 108.2MB in the beginning and 79.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.26ms. Allocated memory is still 151.0MB. Free memory was 79.8MB in the beginning and 77.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.51ms. Allocated memory is still 151.0MB. Free memory was 76.7MB in the beginning and 75.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.34ms. Allocated memory is still 151.0MB. Free memory was 74.6MB in the beginning and 102.6MB in the end (delta: -28.0MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13598.89ms. Allocated memory was 151.0MB in the beginning and 918.6MB in the end (delta: 767.6MB). Free memory was 102.0MB in the beginning and 781.0MB in the end (delta: -679.0MB). Peak memory consumption was 627.0MB. Max. memory is 16.1GB. * Witness Printer took 51.37ms. Allocated memory is still 918.6MB. Free memory was 781.0MB in the beginning and 765.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 145 PlacesBefore, 41 PlacesAfterwards, 134 TransitionsBefore, 28 TransitionsAfterwards, 3074 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 7146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3472, independent: 3270, independent conditional: 0, independent unconditional: 3270, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1629, independent: 1585, independent conditional: 0, independent unconditional: 1585, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3472, independent: 1685, independent conditional: 0, independent unconditional: 1685, dependent: 158, dependent conditional: 0, dependent unconditional: 158, unknown: 1629, unknown conditional: 0, unknown unconditional: 1629] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-2, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((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_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=-1, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=0, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=1, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 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_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 878]: 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: 874]: 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: 876]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 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: 13.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 714 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 50 mSDtfsCounter, 1194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=9, InterpolantAutomatonStates: 59, 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.4s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1587 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 17:31:59,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dfd8e40a-470c-44ef-9db5-8072c11274ff/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