./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R --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 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 --- 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-38b53e6 [2022-11-25 17:09:56,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:09:56,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:09:56,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:09:56,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:09:56,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:09:56,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:09:56,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:09:56,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:09:56,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:09:56,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:09:56,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:09:56,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:09:56,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:09:56,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:09:56,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:09:56,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:09:56,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:09:56,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:09:56,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:09:56,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:09:56,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:09:56,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:09:56,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:09:56,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:09:56,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:09:56,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:09:56,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:09:56,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:09:56,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:09:56,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:09:56,267 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:09:56,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:09:56,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:09:56,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:09:56,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:09:56,272 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:09:56,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:09:56,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:09:56,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:09:56,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:09:56,276 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:09:56,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:09:56,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:09:56,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:09:56,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:09:56,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:09:56,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:09:56,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:09:56,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:09:56,312 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:09:56,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:09:56,313 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:09:56,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:09:56,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:09:56,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:09:56,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:09:56,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:09:56,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:09:56,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:09:56,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:09:56,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:09:56,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:09:56,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:09:56,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:09:56,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:09:56,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:09:56,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:09:56,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:09:56,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:09:56,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:09:56,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:09:56,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:09:56,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:09:56,319 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:09:56,319 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:09:56,320 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_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/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_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R 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 -> 67b3041d4ade18f863c3144705a5a5c36c735377f16a3c3ca7c2065b436994d1 [2022-11-25 17:09:56,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:09:56,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:09:56,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:09:56,620 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:09:56,621 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:09:56,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-11-25 17:09:59,768 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:10:00,113 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:10:00,113 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/sv-benchmarks/c/pthread-wmm/mix019.opt.i [2022-11-25 17:10:00,127 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/data/1b8bcc910/9408b8fd8dba483fae24d5d8cb5fe7d7/FLAGe76cc2e23 [2022-11-25 17:10:00,147 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/data/1b8bcc910/9408b8fd8dba483fae24d5d8cb5fe7d7 [2022-11-25 17:10:00,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:10:00,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:10:00,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:10:00,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:10:00,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:10:00,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a65f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00, skipping insertion in model container [2022-11-25 17:10:00,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:10:00,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:10:00,391 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_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-11-25 17:10:00,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:10:00,717 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:10:00,734 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_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/sv-benchmarks/c/pthread-wmm/mix019.opt.i[944,957] [2022-11-25 17:10:00,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,811 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,812 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:10:00,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:10:00,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:10:00,878 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:10:00,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00 WrapperNode [2022-11-25 17:10:00,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:10:00,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:10:00,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:10:00,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:10:00,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,931 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2022-11-25 17:10:00,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:10:00,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:10:00,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:10:00,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:10:00,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,963 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:10:00,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:10:00,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:10:00,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:10:00,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (1/1) ... [2022-11-25 17:10:00,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:10:00,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:10:01,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:10:01,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:10:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:10:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:10:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:10:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:10:01,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:10:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:10:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:10:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:10:01,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:10:01,059 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:10:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:10:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:10:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:10:01,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:10:01,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:10:01,062 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:10:01,205 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:10:01,207 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:10:01,637 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:10:01,928 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:10:01,928 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:10:01,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:10:01 BoogieIcfgContainer [2022-11-25 17:10:01,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:10:01,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:10:01,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:10:01,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:10:01,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:10:00" (1/3) ... [2022-11-25 17:10:01,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1a0eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:10:01, skipping insertion in model container [2022-11-25 17:10:01,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:10:00" (2/3) ... [2022-11-25 17:10:01,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1a0eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:10:01, skipping insertion in model container [2022-11-25 17:10:01,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:10:01" (3/3) ... [2022-11-25 17:10:01,943 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019.opt.i [2022-11-25 17:10:01,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:10:01,967 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:10:01,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:10:01,968 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:10:02,050 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:10:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-11-25 17:10:02,148 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-25 17:10:02,148 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:10:02,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-25 17:10:02,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-11-25 17:10:02,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-11-25 17:10:02,173 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:10:02,188 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-25 17:10:02,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-11-25 17:10:02,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-11-25 17:10:02,257 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-11-25 17:10:02,257 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:10:02,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-11-25 17:10:02,261 INFO L119 LiptonReduction]: Number of co-enabled transitions 1926 [2022-11-25 17:10:07,136 INFO L134 LiptonReduction]: Checked pairs total: 4664 [2022-11-25 17:10:07,136 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-25 17:10:07,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:10:07,161 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;@881f1a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:10:07,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 17:10:07,166 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-11-25 17:10:07,167 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:10:07,167 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:07,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:07,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1551114779, now seen corresponding path program 1 times [2022-11-25 17:10:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:07,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648859485] [2022-11-25 17:10:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:07,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648859485] [2022-11-25 17:10:07,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648859485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:07,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:07,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:10:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597706780] [2022-11-25 17:10:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:07,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:10:07,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:07,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:10:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:10:07,770 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2022-11-25 17:10:07,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:07,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:07,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2022-11-25 17:10:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:08,109 INFO L130 PetriNetUnfolder]: 644/1036 cut-off events. [2022-11-25 17:10:08,110 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 17:10:08,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1036 events. 644/1036 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4735 event pairs, 112 based on Foata normal form. 0/975 useless extension candidates. Maximal degree in co-relation 2037. Up to 773 conditions per place. [2022-11-25 17:10:08,125 INFO L137 encePairwiseOnDemand]: 214/218 looper letters, 24 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2022-11-25 17:10:08,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 125 flow [2022-11-25 17:10:08,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:10:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:10:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-25 17:10:08,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5152905198776758 [2022-11-25 17:10:08,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-25 17:10:08,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-25 17:10:08,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:08,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-25 17:10:08,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,177 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 337 transitions. [2022-11-25 17:10:08,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 125 flow [2022-11-25 17:10:08,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:10:08,184 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2022-11-25 17:10:08,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2022-11-25 17:10:08,191 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2022-11-25 17:10:08,192 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2022-11-25 17:10:08,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,192 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:08,193 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:08,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:10:08,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -267563855, now seen corresponding path program 1 times [2022-11-25 17:10:08,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226949507] [2022-11-25 17:10:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:08,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:08,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:08,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:08,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226949507] [2022-11-25 17:10:08,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226949507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:08,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:08,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:10:08,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042656986] [2022-11-25 17:10:08,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:08,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:10:08,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:10:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:10:08,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-25 17:10:08,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:08,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-25 17:10:08,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:08,914 INFO L130 PetriNetUnfolder]: 1119/1724 cut-off events. [2022-11-25 17:10:08,915 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-11-25 17:10:08,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3590 conditions, 1724 events. 1119/1724 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7745 event pairs, 363 based on Foata normal form. 52/1776 useless extension candidates. Maximal degree in co-relation 3580. Up to 1221 conditions per place. [2022-11-25 17:10:08,925 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 29 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2022-11-25 17:10:08,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2022-11-25 17:10:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:10:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:10:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-11-25 17:10:08,928 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4954128440366973 [2022-11-25 17:10:08,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2022-11-25 17:10:08,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2022-11-25 17:10:08,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:08,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2022-11-25 17:10:08,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,935 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 324 transitions. [2022-11-25 17:10:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2022-11-25 17:10:08,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:08,939 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 92 flow [2022-11-25 17:10:08,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2022-11-25 17:10:08,943 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2022-11-25 17:10:08,943 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 92 flow [2022-11-25 17:10:08,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:08,945 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:08,945 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:08,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:10:08,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:08,949 INFO L85 PathProgramCache]: Analyzing trace with hash 295453789, now seen corresponding path program 1 times [2022-11-25 17:10:08,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:08,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89882774] [2022-11-25 17:10:08,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:08,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:09,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:09,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89882774] [2022-11-25 17:10:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89882774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:09,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:09,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:10:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425758389] [2022-11-25 17:10:09,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:10:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:09,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:10:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:10:09,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 218 [2022-11-25 17:10:09,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:09,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 218 [2022-11-25 17:10:09,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:09,412 INFO L130 PetriNetUnfolder]: 837/1348 cut-off events. [2022-11-25 17:10:09,412 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-11-25 17:10:09,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1348 events. 837/1348 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6237 event pairs, 295 based on Foata normal form. 24/1357 useless extension candidates. Maximal degree in co-relation 3333. Up to 847 conditions per place. [2022-11-25 17:10:09,422 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 26 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-11-25 17:10:09,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 176 flow [2022-11-25 17:10:09,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:10:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:10:09,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2022-11-25 17:10:09,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5076452599388379 [2022-11-25 17:10:09,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2022-11-25 17:10:09,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2022-11-25 17:10:09,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:09,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2022-11-25 17:10:09,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,429 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 92 flow. Second operand 3 states and 332 transitions. [2022-11-25 17:10:09,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 176 flow [2022-11-25 17:10:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:09,432 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 91 flow [2022-11-25 17:10:09,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2022-11-25 17:10:09,433 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2022-11-25 17:10:09,434 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 91 flow [2022-11-25 17:10:09,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,434 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:09,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:09,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:10:09,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:09,436 INFO L85 PathProgramCache]: Analyzing trace with hash 566770981, now seen corresponding path program 1 times [2022-11-25 17:10:09,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262018984] [2022-11-25 17:10:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:09,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262018984] [2022-11-25 17:10:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262018984] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:09,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:10:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592821047] [2022-11-25 17:10:09,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:09,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:09,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:09,639 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-25 17:10:09,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:09,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-25 17:10:09,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:09,973 INFO L130 PetriNetUnfolder]: 1015/1568 cut-off events. [2022-11-25 17:10:09,973 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2022-11-25 17:10:09,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 1568 events. 1015/1568 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6996 event pairs, 211 based on Foata normal form. 8/1576 useless extension candidates. Maximal degree in co-relation 3936. Up to 1047 conditions per place. [2022-11-25 17:10:09,983 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 39 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2022-11-25 17:10:09,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 256 flow [2022-11-25 17:10:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2022-11-25 17:10:09,986 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4954128440366973 [2022-11-25 17:10:09,986 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2022-11-25 17:10:09,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2022-11-25 17:10:09,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:09,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2022-11-25 17:10:09,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,991 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 91 flow. Second operand 4 states and 432 transitions. [2022-11-25 17:10:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 256 flow [2022-11-25 17:10:09,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:10:09,993 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 140 flow [2022-11-25 17:10:09,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2022-11-25 17:10:09,994 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2022-11-25 17:10:09,994 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 140 flow [2022-11-25 17:10:09,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:09,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:09,995 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:09,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:10:09,996 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash 390069919, now seen corresponding path program 1 times [2022-11-25 17:10:09,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107999460] [2022-11-25 17:10:09,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:09,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:10,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107999460] [2022-11-25 17:10:10,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107999460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:10,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:10,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518996971] [2022-11-25 17:10:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:10,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:10,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:10,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:10,184 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-11-25 17:10:10,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:10,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-11-25 17:10:10,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:10,474 INFO L130 PetriNetUnfolder]: 679/1143 cut-off events. [2022-11-25 17:10:10,475 INFO L131 PetriNetUnfolder]: For 800/837 co-relation queries the response was YES. [2022-11-25 17:10:10,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3177 conditions, 1143 events. 679/1143 cut-off events. For 800/837 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5705 event pairs, 118 based on Foata normal form. 133/1255 useless extension candidates. Maximal degree in co-relation 3162. Up to 684 conditions per place. [2022-11-25 17:10:10,482 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 49 selfloop transitions, 7 changer transitions 14/75 dead transitions. [2022-11-25 17:10:10,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 75 transitions, 476 flow [2022-11-25 17:10:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:10:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:10:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-11-25 17:10:10,485 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4834862385321101 [2022-11-25 17:10:10,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2022-11-25 17:10:10,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2022-11-25 17:10:10,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:10,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2022-11-25 17:10:10,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,491 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 140 flow. Second operand 5 states and 527 transitions. [2022-11-25 17:10:10,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 75 transitions, 476 flow [2022-11-25 17:10:10,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 75 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:10:10,495 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 194 flow [2022-11-25 17:10:10,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-11-25 17:10:10,496 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-11-25 17:10:10,497 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 194 flow [2022-11-25 17:10:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:10,497 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:10,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:10:10,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1649695108, now seen corresponding path program 1 times [2022-11-25 17:10:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:10,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828662500] [2022-11-25 17:10:10,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:10,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:10,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828662500] [2022-11-25 17:10:10,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828662500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:10,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:10,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859414529] [2022-11-25 17:10:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:10,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:10,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 218 [2022-11-25 17:10:10,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:10,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:10,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 218 [2022-11-25 17:10:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:11,010 INFO L130 PetriNetUnfolder]: 935/1588 cut-off events. [2022-11-25 17:10:11,010 INFO L131 PetriNetUnfolder]: For 2053/2053 co-relation queries the response was YES. [2022-11-25 17:10:11,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5746 conditions, 1588 events. 935/1588 cut-off events. For 2053/2053 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8052 event pairs, 256 based on Foata normal form. 23/1611 useless extension candidates. Maximal degree in co-relation 5726. Up to 793 conditions per place. [2022-11-25 17:10:11,021 INFO L137 encePairwiseOnDemand]: 213/218 looper letters, 42 selfloop transitions, 8 changer transitions 10/60 dead transitions. [2022-11-25 17:10:11,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 420 flow [2022-11-25 17:10:11,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:11,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-11-25 17:10:11,023 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4908256880733945 [2022-11-25 17:10:11,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2022-11-25 17:10:11,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2022-11-25 17:10:11,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:11,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2022-11-25 17:10:11,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,029 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 194 flow. Second operand 4 states and 428 transitions. [2022-11-25 17:10:11,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 420 flow [2022-11-25 17:10:11,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:11,039 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 195 flow [2022-11-25 17:10:11,039 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 17:10:11,040 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2022-11-25 17:10:11,040 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 195 flow [2022-11-25 17:10:11,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:11,041 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:11,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:10:11,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1220900608, now seen corresponding path program 1 times [2022-11-25 17:10:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:11,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316717555] [2022-11-25 17:10:11,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316717555] [2022-11-25 17:10:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316717555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:11,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:11,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:10:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500329017] [2022-11-25 17:10:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:10:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:10:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:10:11,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-11-25 17:10:11,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:11,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-11-25 17:10:11,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:11,592 INFO L130 PetriNetUnfolder]: 414/779 cut-off events. [2022-11-25 17:10:11,592 INFO L131 PetriNetUnfolder]: For 978/993 co-relation queries the response was YES. [2022-11-25 17:10:11,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 779 events. 414/779 cut-off events. For 978/993 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3950 event pairs, 60 based on Foata normal form. 96/864 useless extension candidates. Maximal degree in co-relation 2727. Up to 328 conditions per place. [2022-11-25 17:10:11,597 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 44 selfloop transitions, 8 changer transitions 29/86 dead transitions. [2022-11-25 17:10:11,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 86 transitions, 643 flow [2022-11-25 17:10:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:10:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:10:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2022-11-25 17:10:11,601 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48394495412844035 [2022-11-25 17:10:11,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2022-11-25 17:10:11,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2022-11-25 17:10:11,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:11,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2022-11-25 17:10:11,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,607 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 195 flow. Second operand 6 states and 633 transitions. [2022-11-25 17:10:11,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 86 transitions, 643 flow [2022-11-25 17:10:11,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 587 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 17:10:11,613 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 230 flow [2022-11-25 17:10:11,614 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-11-25 17:10:11,614 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-11-25 17:10:11,614 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 230 flow [2022-11-25 17:10:11,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,615 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:11,615 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:11,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:10:11,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1166232729, now seen corresponding path program 1 times [2022-11-25 17:10:11,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:11,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913648859] [2022-11-25 17:10:11,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:11,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913648859] [2022-11-25 17:10:11,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913648859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:11,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:11,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:10:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784001038] [2022-11-25 17:10:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:11,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:10:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:10:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:10:11,960 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 218 [2022-11-25 17:10:11,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:11,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:11,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 218 [2022-11-25 17:10:11,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:12,215 INFO L130 PetriNetUnfolder]: 284/563 cut-off events. [2022-11-25 17:10:12,215 INFO L131 PetriNetUnfolder]: For 917/924 co-relation queries the response was YES. [2022-11-25 17:10:12,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 563 events. 284/563 cut-off events. For 917/924 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2763 event pairs, 49 based on Foata normal form. 35/590 useless extension candidates. Maximal degree in co-relation 2190. Up to 232 conditions per place. [2022-11-25 17:10:12,219 INFO L137 encePairwiseOnDemand]: 212/218 looper letters, 37 selfloop transitions, 11 changer transitions 27/79 dead transitions. [2022-11-25 17:10:12,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 590 flow [2022-11-25 17:10:12,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:10:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:10:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 821 transitions. [2022-11-25 17:10:12,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47075688073394495 [2022-11-25 17:10:12,223 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 821 transitions. [2022-11-25 17:10:12,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 821 transitions. [2022-11-25 17:10:12,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:12,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 821 transitions. [2022-11-25 17:10:12,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.625) internal successors, (821), 8 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,230 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,230 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 230 flow. Second operand 8 states and 821 transitions. [2022-11-25 17:10:12,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 590 flow [2022-11-25 17:10:12,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 543 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-25 17:10:12,240 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 206 flow [2022-11-25 17:10:12,240 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2022-11-25 17:10:12,241 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2022-11-25 17:10:12,241 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 206 flow [2022-11-25 17:10:12,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,242 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:12,242 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-11-25 17:10:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:10:12,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1181824059, now seen corresponding path program 1 times [2022-11-25 17:10:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:12,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856169981] [2022-11-25 17:10:12,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:12,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856169981] [2022-11-25 17:10:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856169981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046026305] [2022-11-25 17:10:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:12,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:12,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:12,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:12,539 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 218 [2022-11-25 17:10:12,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:12,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 218 [2022-11-25 17:10:12,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:12,700 INFO L130 PetriNetUnfolder]: 163/324 cut-off events. [2022-11-25 17:10:12,700 INFO L131 PetriNetUnfolder]: For 714/714 co-relation queries the response was YES. [2022-11-25 17:10:12,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 324 events. 163/324 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1241 event pairs, 24 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1274. Up to 184 conditions per place. [2022-11-25 17:10:12,703 INFO L137 encePairwiseOnDemand]: 210/218 looper letters, 41 selfloop transitions, 11 changer transitions 10/62 dead transitions. [2022-11-25 17:10:12,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 512 flow [2022-11-25 17:10:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:10:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:10:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-11-25 17:10:12,706 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47339449541284406 [2022-11-25 17:10:12,706 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2022-11-25 17:10:12,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2022-11-25 17:10:12,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:12,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2022-11-25 17:10:12,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,712 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,712 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 206 flow. Second operand 5 states and 516 transitions. [2022-11-25 17:10:12,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 512 flow [2022-11-25 17:10:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 403 flow, removed 32 selfloop flow, removed 9 redundant places. [2022-11-25 17:10:12,718 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 214 flow [2022-11-25 17:10:12,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 17:10:12,719 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2022-11-25 17:10:12,720 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 214 flow [2022-11-25 17:10:12,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:12,721 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-11-25 17:10:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:10:12,721 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:12,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2125229401, now seen corresponding path program 2 times [2022-11-25 17:10:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:12,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246809016] [2022-11-25 17:10:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:12,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246809016] [2022-11-25 17:10:12,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246809016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:10:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791150346] [2022-11-25 17:10:12,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:12,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:10:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:10:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:10:12,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2022-11-25 17:10:12,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:12,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:12,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2022-11-25 17:10:12,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:13,103 INFO L130 PetriNetUnfolder]: 133/280 cut-off events. [2022-11-25 17:10:13,103 INFO L131 PetriNetUnfolder]: For 523/525 co-relation queries the response was YES. [2022-11-25 17:10:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 280 events. 133/280 cut-off events. For 523/525 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1044 event pairs, 32 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 1068. Up to 151 conditions per place. [2022-11-25 17:10:13,105 INFO L137 encePairwiseOnDemand]: 215/218 looper letters, 26 selfloop transitions, 1 changer transitions 30/58 dead transitions. [2022-11-25 17:10:13,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 424 flow [2022-11-25 17:10:13,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:10:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:10:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2022-11-25 17:10:13,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49655963302752293 [2022-11-25 17:10:13,108 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2022-11-25 17:10:13,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2022-11-25 17:10:13,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:13,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2022-11-25 17:10:13,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:13,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:13,112 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:13,112 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 214 flow. Second operand 4 states and 433 transitions. [2022-11-25 17:10:13,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 424 flow [2022-11-25 17:10:13,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 420 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 17:10:13,116 INFO L231 Difference]: Finished difference. Result has 48 places, 26 transitions, 139 flow [2022-11-25 17:10:13,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=26} [2022-11-25 17:10:13,117 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2022-11-25 17:10:13,118 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 26 transitions, 139 flow [2022-11-25 17:10:13,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:13,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:13,118 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-11-25 17:10:13,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:10:13,119 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:13,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:13,119 INFO L85 PathProgramCache]: Analyzing trace with hash 749072645, now seen corresponding path program 3 times [2022-11-25 17:10:13,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757706228] [2022-11-25 17:10:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:13,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:10:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:10:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:10:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757706228] [2022-11-25 17:10:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757706228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:10:14,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:10:14,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:10:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475138788] [2022-11-25 17:10:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:10:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:10:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:10:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:10:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:10:14,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 218 [2022-11-25 17:10:14,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 26 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:14,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:10:14,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 218 [2022-11-25 17:10:14,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:10:14,702 INFO L130 PetriNetUnfolder]: 32/90 cut-off events. [2022-11-25 17:10:14,703 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2022-11-25 17:10:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 90 events. 32/90 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 4 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 343. Up to 37 conditions per place. [2022-11-25 17:10:14,704 INFO L137 encePairwiseOnDemand]: 211/218 looper letters, 23 selfloop transitions, 5 changer transitions 14/44 dead transitions. [2022-11-25 17:10:14,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 328 flow [2022-11-25 17:10:14,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:10:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:10:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 805 transitions. [2022-11-25 17:10:14,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46158256880733944 [2022-11-25 17:10:14,707 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 805 transitions. [2022-11-25 17:10:14,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 805 transitions. [2022-11-25 17:10:14,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:10:14,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 805 transitions. [2022-11-25 17:10:14,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.625) internal successors, (805), 8 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:14,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:14,714 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 218.0) internal successors, (1962), 9 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:14,715 INFO L175 Difference]: Start difference. First operand has 48 places, 26 transitions, 139 flow. Second operand 8 states and 805 transitions. [2022-11-25 17:10:14,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 328 flow [2022-11-25 17:10:14,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 288 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-11-25 17:10:14,717 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 127 flow [2022-11-25 17:10:14,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2022-11-25 17:10:14,718 INFO L288 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-11-25 17:10:14,718 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 127 flow [2022-11-25 17:10:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.57142857142857) internal successors, (697), 7 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:10:14,719 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:10:14,719 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-11-25 17:10:14,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:10:14,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:10:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:10:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1733944815, now seen corresponding path program 4 times [2022-11-25 17:10:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:10:14,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236698035] [2022-11-25 17:10:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:10:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:10:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:10:14,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:10:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:10:14,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:10:14,842 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:10:14,843 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 17:10:14,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 17:10:14,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 17:10:14,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 17:10:14,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 17:10:14,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 17:10:14,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:10:14,847 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:10:14,853 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:10:14,854 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:10:14,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:10:14 BasicIcfg [2022-11-25 17:10:14,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:10:14,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:10:14,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:10:14,947 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:10:14,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:10:01" (3/4) ... [2022-11-25 17:10:14,950 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:10:15,101 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:10:15,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:10:15,102 INFO L158 Benchmark]: Toolchain (without parser) took 14948.18ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 159.1MB in the beginning and 297.9MB in the end (delta: -138.8MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,103 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:10:15,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 721.43ms. Allocated memory is still 192.9MB. Free memory was 158.5MB in the beginning and 131.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.58ms. Allocated memory is still 192.9MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,104 INFO L158 Benchmark]: Boogie Preprocessor took 36.13ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,104 INFO L158 Benchmark]: RCFGBuilder took 962.38ms. Allocated memory is still 192.9MB. Free memory was 126.4MB in the beginning and 152.8MB in the end (delta: -26.4MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,105 INFO L158 Benchmark]: TraceAbstraction took 13012.86ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 152.8MB in the beginning and 308.3MB in the end (delta: -155.5MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,105 INFO L158 Benchmark]: Witness Printer took 154.99ms. Allocated memory is still 343.9MB. Free memory was 308.3MB in the beginning and 297.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:10:15,107 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.27ms. Allocated memory is still 142.6MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 721.43ms. Allocated memory is still 192.9MB. Free memory was 158.5MB in the beginning and 131.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.58ms. Allocated memory is still 192.9MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.13ms. Allocated memory is still 192.9MB. Free memory was 128.5MB in the beginning and 126.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 962.38ms. Allocated memory is still 192.9MB. Free memory was 126.4MB in the beginning and 152.8MB in the end (delta: -26.4MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13012.86ms. Allocated memory was 192.9MB in the beginning and 343.9MB in the end (delta: 151.0MB). Free memory was 152.8MB in the beginning and 308.3MB in the end (delta: -155.5MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. * Witness Printer took 154.99ms. Allocated memory is still 343.9MB. Free memory was 308.3MB in the beginning and 297.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 120 PlacesBefore, 32 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 1926 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 4664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2582, independent: 2415, independent conditional: 0, independent unconditional: 2415, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1473, independent: 1418, independent conditional: 0, independent unconditional: 1418, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1473, independent: 1402, independent conditional: 0, independent unconditional: 1402, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 471, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 431, dependent conditional: 0, dependent unconditional: 431, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2582, independent: 997, independent conditional: 0, independent unconditional: 997, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1473, unknown conditional: 0, unknown unconditional: 1473] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t500; [L842] FCALL, FORK 0 pthread_create(&t500, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t500, ((void *)0), P0, ((void *)0))=-3, t500={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t501; [L844] FCALL, FORK 0 pthread_create(&t501, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t501, ((void *)0), P1, ((void *)0))=-2, t500={5:0}, t501={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t502; [L846] FCALL, FORK 0 pthread_create(&t502, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t502, ((void *)0), P2, ((void *)0))=-1, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$w_buff1 = y$w_buff0 [L789] 3 y$w_buff0 = 1 [L790] 3 y$w_buff1_used = y$w_buff0_used [L791] 3 y$w_buff0_used = (_Bool)1 [L792] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L792] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L793] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L794] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L795] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L796] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 y$flush_delayed = weak$$choice2 [L803] 3 y$mem_tmp = y [L804] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L805] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L806] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L807] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L808] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L810] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EAX = y [L812] 3 y = y$flush_delayed ? y$mem_tmp : y [L813] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 y$flush_delayed = weak$$choice2 [L766] 2 y$mem_tmp = y [L767] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L768] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L769] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L770] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L771] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L773] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EAX = y [L775] 2 y = y$flush_delayed ? y$mem_tmp : y [L776] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L820] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L821] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L822] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L823] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L853] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L854] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L856] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t500={5:0}, t501={6:0}, t502={3:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 401 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 312 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 867 IncrementalHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 39 mSDtfsCounter, 867 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:10:15,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5d45cdc9-6c7f-4eda-bff9-274f714f32d6/bin/uautomizer-ZsLfNo2U6R/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