./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.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_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/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_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/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_118a0fe8-c653-4c1a-a57e-de85310f50e5/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 ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff --- 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:31:12,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:31:12,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:31:12,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:31:12,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:31:12,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:31:12,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:31:12,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:31:12,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:31:12,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:31:12,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:31:12,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:31:12,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:31:12,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:31:12,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:31:12,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:31:12,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:31:12,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:31:12,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:31:12,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:31:12,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:31:12,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:31:12,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:31:12,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:31:12,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:31:12,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:31:12,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:31:12,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:31:12,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:31:12,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:31:12,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:31:12,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:31:12,322 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:31:12,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:31:12,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:31:12,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:31:12,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:31:12,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:31:12,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:31:12,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:31:12,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:31:12,332 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:31:12,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:31:12,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:31:12,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:31:12,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:31:12,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:31:12,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:31:12,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:31:12,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:31:12,383 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:31:12,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:31:12,385 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:31:12,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:31:12,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:31:12,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:31:12,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:31:12,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:31:12,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:31:12,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:31:12,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:31:12,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:31:12,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:31:12,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:31:12,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:31:12,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:31:12,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:12,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:31:12,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:31:12,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:31:12,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:31:12,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:31:12,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:31:12,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:31:12,393 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:31:12,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:31:12,393 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_118a0fe8-c653-4c1a-a57e-de85310f50e5/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_118a0fe8-c653-4c1a-a57e-de85310f50e5/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 -> ea86164637dd5d5bd9745ca8d3f5dc708b98bc3f75b645830d494ea6e5cae6ff [2022-11-25 17:31:12,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:31:12,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:31:12,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:31:12,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:31:12,794 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:31:12,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:31:15,914 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:31:16,212 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:31:16,213 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:31:16,231 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/data/b3a7a8b91/8112f7867b3b4faa858d59c185859c0e/FLAG771f5ffb3 [2022-11-25 17:31:16,261 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/data/b3a7a8b91/8112f7867b3b4faa858d59c185859c0e [2022-11-25 17:31:16,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:31:16,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:31:16,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:16,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:31:16,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:31:16,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:16,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ea48d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16, skipping insertion in model container [2022-11-25 17:31:16,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:16,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:31:16,344 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:31:16,502 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_118a0fe8-c653-4c1a-a57e-de85310f50e5/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-11-25 17:31:16,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:16,841 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:31:16,854 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_118a0fe8-c653-4c1a-a57e-de85310f50e5/sv-benchmarks/c/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009] [2022-11-25 17:31:16,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,885 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:31:16,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:31:16,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:31:16,951 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:31:16,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16 WrapperNode [2022-11-25 17:31:16,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:31:16,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:16,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:31:16,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:31:16,963 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:31:16" (1/1) ... [2022-11-25 17:31:16,999 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:31:16" (1/1) ... [2022-11-25 17:31:17,053 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-11-25 17:31:17,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:31:17,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:31:17,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:31:17,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:31:17,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,103 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:31:17,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:31:17,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:31:17,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:31:17,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (1/1) ... [2022-11-25 17:31:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:31:17,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:31:17,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:31:17,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:31:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:31:17,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:31:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:31:17,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:31:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:31:17,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:31:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:31:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:31:17,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:31:17,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:31:17,185 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:31:17,326 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:31:17,329 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:31:17,781 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:31:17,955 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:31:17,955 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:31:17,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:17 BoogieIcfgContainer [2022-11-25 17:31:17,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:31:17,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:31:17,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:31:17,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:31:17,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:31:16" (1/3) ... [2022-11-25 17:31:17,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24812d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:17, skipping insertion in model container [2022-11-25 17:31:17,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:31:16" (2/3) ... [2022-11-25 17:31:17,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24812d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:31:17, skipping insertion in model container [2022-11-25 17:31:17,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:17" (3/3) ... [2022-11-25 17:31:17,976 INFO L112 eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:31:17,986 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:31:18,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:31:18,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:31:18,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:31:18,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:31:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-25 17:31:18,226 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-25 17:31:18,226 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 17:31:18,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-25 17:31:18,238 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-25 17:31:18,242 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:31:18,259 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-11-25 17:31:18,263 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-11-25 17:31:18,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-11-25 17:31:18,294 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-25 17:31:18,294 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:18,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 17:31:18,298 INFO L119 LiptonReduction]: Number of co-enabled transitions 2192 [2022-11-25 17:31:23,390 INFO L134 LiptonReduction]: Checked pairs total: 6078 [2022-11-25 17:31:23,390 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-25 17:31:23,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:31:23,436 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;@422c3755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:31:23,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 17:31:23,443 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-11-25 17:31:23,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:31:23,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:23,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:31:23,445 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:23,451 INFO L85 PathProgramCache]: Analyzing trace with hash 499138, now seen corresponding path program 1 times [2022-11-25 17:31:23,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:23,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063680366] [2022-11-25 17:31:23,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:23,922 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:31:23,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:23,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063680366] [2022-11-25 17:31:23,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063680366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:23,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:23,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166949928] [2022-11-25 17:31:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:23,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:23,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:23,985 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 220 [2022-11-25 17:31:23,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:31:23,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:23,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 220 [2022-11-25 17:31:23,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:24,414 INFO L130 PetriNetUnfolder]: 895/1454 cut-off events. [2022-11-25 17:31:24,415 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-25 17:31:24,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1454 events. 895/1454 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7639 event pairs, 142 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 2826. Up to 1084 conditions per place. [2022-11-25 17:31:24,429 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 17:31:24,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 161 flow [2022-11-25 17:31:24,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-25 17:31:24,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5257575757575758 [2022-11-25 17:31:24,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-25 17:31:24,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-25 17:31:24,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:24,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-25 17:31:24,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:31:24,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:31:24,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:31:24,480 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 347 transitions. [2022-11-25 17:31:24,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 161 flow [2022-11-25 17:31:24,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:31:24,486 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 17:31:24,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 17:31:24,495 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 17:31:24,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 17:31:24,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:31:24,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:24,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:24,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:31:24,497 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2043667422, now seen corresponding path program 1 times [2022-11-25 17:31:24,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:24,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557057347] [2022-11-25 17:31:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:24,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:24,827 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:31:24,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:24,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557057347] [2022-11-25 17:31:24,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557057347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:24,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:24,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:31:24,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814186017] [2022-11-25 17:31:24,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:24,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:31:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:24,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:31:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:31:24,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 220 [2022-11-25 17:31:24,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 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:31:24,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:24,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 220 [2022-11-25 17:31:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:25,416 INFO L130 PetriNetUnfolder]: 1991/2996 cut-off events. [2022-11-25 17:31:25,416 INFO L131 PetriNetUnfolder]: For 186/186 co-relation queries the response was YES. [2022-11-25 17:31:25,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 2996 events. 1991/2996 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14203 event pairs, 629 based on Foata normal form. 94/3090 useless extension candidates. Maximal degree in co-relation 6253. Up to 2008 conditions per place. [2022-11-25 17:31:25,436 INFO L137 encePairwiseOnDemand]: 213/220 looper letters, 35 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2022-11-25 17:31:25,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 41 transitions, 180 flow [2022-11-25 17:31:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:31:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:31:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-25 17:31:25,439 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 17:31:25,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-25 17:31:25,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-25 17:31:25,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:25,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-25 17:31:25,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:31:25,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:31:25,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:31:25,444 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 330 transitions. [2022-11-25 17:31:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 41 transitions, 180 flow [2022-11-25 17:31:25,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:25,447 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 96 flow [2022-11-25 17:31:25,447 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2022-11-25 17:31:25,448 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2022-11-25 17:31:25,448 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 96 flow [2022-11-25 17:31:25,449 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:31:25,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:25,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:25,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:31:25,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1070820788, now seen corresponding path program 1 times [2022-11-25 17:31:25,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:25,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345752689] [2022-11-25 17:31:25,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:25,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:25,701 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:31:25,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:25,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345752689] [2022-11-25 17:31:25,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345752689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:25,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:25,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:31:25,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422042153] [2022-11-25 17:31:25,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:25,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:25,739 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 220 [2022-11-25 17:31:25,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:31:25,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:25,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 220 [2022-11-25 17:31:25,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:26,350 INFO L130 PetriNetUnfolder]: 1855/2796 cut-off events. [2022-11-25 17:31:26,351 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2022-11-25 17:31:26,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 2796 events. 1855/2796 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12802 event pairs, 507 based on Foata normal form. 40/2836 useless extension candidates. Maximal degree in co-relation 6803. Up to 1389 conditions per place. [2022-11-25 17:31:26,371 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 41 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2022-11-25 17:31:26,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 240 flow [2022-11-25 17:31:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:31:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:31:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-11-25 17:31:26,373 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4863636363636364 [2022-11-25 17:31:26,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2022-11-25 17:31:26,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2022-11-25 17:31:26,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:26,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2022-11-25 17:31:26,376 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:31:26,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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:31:26,379 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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:31:26,379 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 96 flow. Second operand 4 states and 428 transitions. [2022-11-25 17:31:26,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 240 flow [2022-11-25 17:31:26,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:26,387 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 122 flow [2022-11-25 17:31:26,387 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-11-25 17:31:26,388 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-11-25 17:31:26,388 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 122 flow [2022-11-25 17:31:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:31:26,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:26,389 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:26,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:31:26,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1162561532, now seen corresponding path program 1 times [2022-11-25 17:31:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:26,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174492650] [2022-11-25 17:31:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:26,594 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:31:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:26,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174492650] [2022-11-25 17:31:26,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174492650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:26,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:26,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:31:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852338928] [2022-11-25 17:31:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:26,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:31:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:26,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:31:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:31:26,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 220 [2022-11-25 17:31:26,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:31:26,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:26,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 220 [2022-11-25 17:31:26,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:27,057 INFO L130 PetriNetUnfolder]: 990/1706 cut-off events. [2022-11-25 17:31:27,057 INFO L131 PetriNetUnfolder]: For 482/532 co-relation queries the response was YES. [2022-11-25 17:31:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 1706 events. 990/1706 cut-off events. For 482/532 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9449 event pairs, 172 based on Foata normal form. 175/1866 useless extension candidates. Maximal degree in co-relation 3971. Up to 957 conditions per place. [2022-11-25 17:31:27,069 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 54 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2022-11-25 17:31:27,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 368 flow [2022-11-25 17:31:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:31:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:31:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 536 transitions. [2022-11-25 17:31:27,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48727272727272725 [2022-11-25 17:31:27,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 536 transitions. [2022-11-25 17:31:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 536 transitions. [2022-11-25 17:31:27,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:27,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 536 transitions. [2022-11-25 17:31:27,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:27,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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:31:27,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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:31:27,080 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 122 flow. Second operand 5 states and 536 transitions. [2022-11-25 17:31:27,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 368 flow [2022-11-25 17:31:27,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:27,085 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 179 flow [2022-11-25 17:31:27,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, 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=179, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-25 17:31:27,088 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-11-25 17:31:27,088 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 179 flow [2022-11-25 17:31:27,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 0 states have call successors, (0), 0 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:31:27,089 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:27,089 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:27,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:31:27,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:27,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1575418804, now seen corresponding path program 1 times [2022-11-25 17:31:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:27,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158792105] [2022-11-25 17:31:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:27,407 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:31:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:27,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158792105] [2022-11-25 17:31:27,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158792105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:27,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:27,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741822958] [2022-11-25 17:31:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:27,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:27,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 220 [2022-11-25 17:31:27,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:31:27,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:27,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 220 [2022-11-25 17:31:27,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:27,870 INFO L130 PetriNetUnfolder]: 769/1379 cut-off events. [2022-11-25 17:31:27,870 INFO L131 PetriNetUnfolder]: For 979/1011 co-relation queries the response was YES. [2022-11-25 17:31:27,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 1379 events. 769/1379 cut-off events. For 979/1011 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7622 event pairs, 106 based on Foata normal form. 99/1464 useless extension candidates. Maximal degree in co-relation 4170. Up to 445 conditions per place. [2022-11-25 17:31:27,881 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 62 selfloop transitions, 15 changer transitions 12/97 dead transitions. [2022-11-25 17:31:27,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 97 transitions, 583 flow [2022-11-25 17:31:27,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:27,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:31:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 751 transitions. [2022-11-25 17:31:27,884 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4876623376623377 [2022-11-25 17:31:27,885 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 751 transitions. [2022-11-25 17:31:27,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 751 transitions. [2022-11-25 17:31:27,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:27,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 751 transitions. [2022-11-25 17:31:27,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 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:31:27,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 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:31:27,893 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 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:31:27,893 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 179 flow. Second operand 7 states and 751 transitions. [2022-11-25 17:31:27,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 97 transitions, 583 flow [2022-11-25 17:31:27,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 97 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:31:27,901 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 274 flow [2022-11-25 17:31:27,901 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-11-25 17:31:27,902 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 17:31:27,902 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 274 flow [2022-11-25 17:31:27,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 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:31:27,903 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:27,903 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:27,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:31:27,903 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:27,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:27,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1442704955, now seen corresponding path program 1 times [2022-11-25 17:31:27,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:27,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530512143] [2022-11-25 17:31:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:29,151 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:31:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:29,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530512143] [2022-11-25 17:31:29,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530512143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:29,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:29,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147259011] [2022-11-25 17:31:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:29,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:29,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:29,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:29,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 220 [2022-11-25 17:31:29,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:31:29,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:29,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 220 [2022-11-25 17:31:29,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:29,936 INFO L130 PetriNetUnfolder]: 1248/2301 cut-off events. [2022-11-25 17:31:29,936 INFO L131 PetriNetUnfolder]: For 4851/4905 co-relation queries the response was YES. [2022-11-25 17:31:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8294 conditions, 2301 events. 1248/2301 cut-off events. For 4851/4905 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 14757 event pairs, 304 based on Foata normal form. 14/2294 useless extension candidates. Maximal degree in co-relation 8271. Up to 1206 conditions per place. [2022-11-25 17:31:29,952 INFO L137 encePairwiseOnDemand]: 213/220 looper letters, 68 selfloop transitions, 10 changer transitions 50/136 dead transitions. [2022-11-25 17:31:29,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 136 transitions, 1158 flow [2022-11-25 17:31:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:31:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:31:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2022-11-25 17:31:29,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2022-11-25 17:31:29,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 635 transitions. [2022-11-25 17:31:29,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions. [2022-11-25 17:31:29,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:29,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions. [2022-11-25 17:31:29,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:29,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:31:29,960 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:31:29,960 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 274 flow. Second operand 6 states and 635 transitions. [2022-11-25 17:31:29,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 136 transitions, 1158 flow [2022-11-25 17:31:30,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 136 transitions, 1007 flow, removed 57 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:30,018 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 322 flow [2022-11-25 17:31:30,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=322, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2022-11-25 17:31:30,019 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2022-11-25 17:31:30,020 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 322 flow [2022-11-25 17:31:30,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:31:30,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:30,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:30,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:31:30,021 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 557754591, now seen corresponding path program 2 times [2022-11-25 17:31:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:30,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157665069] [2022-11-25 17:31:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:30,304 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:31:30,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:30,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157665069] [2022-11-25 17:31:30,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157665069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:30,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:30,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:30,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763087682] [2022-11-25 17:31:30,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:30,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:31:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:31:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:31:30,323 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 220 [2022-11-25 17:31:30,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:31:30,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:30,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 220 [2022-11-25 17:31:30,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:30,857 INFO L130 PetriNetUnfolder]: 920/1677 cut-off events. [2022-11-25 17:31:30,857 INFO L131 PetriNetUnfolder]: For 3145/3196 co-relation queries the response was YES. [2022-11-25 17:31:30,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 1677 events. 920/1677 cut-off events. For 3145/3196 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10181 event pairs, 79 based on Foata normal form. 42/1702 useless extension candidates. Maximal degree in co-relation 6206. Up to 401 conditions per place. [2022-11-25 17:31:30,870 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 88 selfloop transitions, 18 changer transitions 18/132 dead transitions. [2022-11-25 17:31:30,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 132 transitions, 1004 flow [2022-11-25 17:31:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:31:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:31:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2022-11-25 17:31:30,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4762626262626263 [2022-11-25 17:31:30,874 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 943 transitions. [2022-11-25 17:31:30,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 943 transitions. [2022-11-25 17:31:30,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:30,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 943 transitions. [2022-11-25 17:31:30,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 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:31:30,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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:31:30,882 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 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:31:30,882 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 322 flow. Second operand 9 states and 943 transitions. [2022-11-25 17:31:30,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 132 transitions, 1004 flow [2022-11-25 17:31:30,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 132 transitions, 997 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 17:31:30,923 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 365 flow [2022-11-25 17:31:30,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2022-11-25 17:31:30,924 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-11-25 17:31:30,924 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 365 flow [2022-11-25 17:31:30,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 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:31:30,925 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:30,925 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:30,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:31:30,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2004819152, now seen corresponding path program 1 times [2022-11-25 17:31:30,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:30,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485374853] [2022-11-25 17:31:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:32,014 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:31:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:32,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485374853] [2022-11-25 17:31:32,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485374853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:32,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:31:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097826777] [2022-11-25 17:31:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:32,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:31:32,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:32,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:31:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:31:32,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2022-11-25 17:31:32,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 365 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 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:31:32,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:32,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2022-11-25 17:31:32,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:32,586 INFO L130 PetriNetUnfolder]: 968/1801 cut-off events. [2022-11-25 17:31:32,586 INFO L131 PetriNetUnfolder]: For 4833/4995 co-relation queries the response was YES. [2022-11-25 17:31:32,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 1801 events. 968/1801 cut-off events. For 4833/4995 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11196 event pairs, 93 based on Foata normal form. 87/1861 useless extension candidates. Maximal degree in co-relation 7335. Up to 860 conditions per place. [2022-11-25 17:31:32,606 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 69 selfloop transitions, 6 changer transitions 29/112 dead transitions. [2022-11-25 17:31:32,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 1023 flow [2022-11-25 17:31:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:31:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:31:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2022-11-25 17:31:32,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4779220779220779 [2022-11-25 17:31:32,610 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2022-11-25 17:31:32,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2022-11-25 17:31:32,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:32,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2022-11-25 17:31:32,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:31:32,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 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:31:32,618 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 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:31:32,618 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 365 flow. Second operand 7 states and 736 transitions. [2022-11-25 17:31:32,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 1023 flow [2022-11-25 17:31:32,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 862 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-11-25 17:31:32,657 INFO L231 Difference]: Finished difference. Result has 63 places, 50 transitions, 317 flow [2022-11-25 17:31:32,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=63, PETRI_TRANSITIONS=50} [2022-11-25 17:31:32,660 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-11-25 17:31:32,660 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 50 transitions, 317 flow [2022-11-25 17:31:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 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:31:32,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:32,661 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:32,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:31:32,662 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1703262858, now seen corresponding path program 2 times [2022-11-25 17:31:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:32,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40581898] [2022-11-25 17:31:32,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:32,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:31:32,978 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:31:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:31:32,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40581898] [2022-11-25 17:31:32,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40581898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:31:32,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:31:32,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:31:32,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096202266] [2022-11-25 17:31:32,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:31:32,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:31:32,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:31:32,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:31:32,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:31:33,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 220 [2022-11-25 17:31:33,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:31:33,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 220 [2022-11-25 17:31:33,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:31:33,687 INFO L130 PetriNetUnfolder]: 1711/2958 cut-off events. [2022-11-25 17:31:33,688 INFO L131 PetriNetUnfolder]: For 7061/7061 co-relation queries the response was YES. [2022-11-25 17:31:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11790 conditions, 2958 events. 1711/2958 cut-off events. For 7061/7061 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17767 event pairs, 292 based on Foata normal form. 1/2959 useless extension candidates. Maximal degree in co-relation 11768. Up to 1312 conditions per place. [2022-11-25 17:31:33,702 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 40 selfloop transitions, 10 changer transitions 98/148 dead transitions. [2022-11-25 17:31:33,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 148 transitions, 1199 flow [2022-11-25 17:31:33,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:31:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:31:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2022-11-25 17:31:33,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-11-25 17:31:33,705 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2022-11-25 17:31:33,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2022-11-25 17:31:33,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:31:33,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2022-11-25 17:31:33,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 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:31:33,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:31:33,713 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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:31:33,713 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 317 flow. Second operand 6 states and 638 transitions. [2022-11-25 17:31:33,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 148 transitions, 1199 flow [2022-11-25 17:31:33,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 148 transitions, 1153 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-25 17:31:33,762 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 241 flow [2022-11-25 17:31:33,763 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2022-11-25 17:31:33,764 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-11-25 17:31:33,765 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 241 flow [2022-11-25 17:31:33,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:31:33,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:31:33,768 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:31:33,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:31:33,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:31:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:31:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 553807718, now seen corresponding path program 3 times [2022-11-25 17:31:33,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:31:33,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824117250] [2022-11-25 17:31:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:31:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:31:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:33,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:31:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:31:33,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:31:33,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:31:33,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 17:31:33,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 17:31:33,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 17:31:33,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 17:31:33,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 17:31:33,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 17:31:34,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:31:34,001 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-25 17:31:34,009 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:31:34,009 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:31:34,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:31:34 BasicIcfg [2022-11-25 17:31:34,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:31:34,138 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:31:34,139 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:31:34,139 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:31:34,139 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:31:17" (3/4) ... [2022-11-25 17:31:34,142 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:31:34,254 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:31:34,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:31:34,255 INFO L158 Benchmark]: Toolchain (without parser) took 17989.21ms. Allocated memory was 121.6MB in the beginning and 362.8MB in the end (delta: 241.2MB). Free memory was 76.9MB in the beginning and 327.8MB in the end (delta: -250.8MB). Peak memory consumption was 205.1MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,256 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 121.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:31:34,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 683.25ms. Allocated memory is still 121.6MB. Free memory was 76.9MB in the beginning and 50.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.12ms. Allocated memory is still 121.6MB. Free memory was 50.1MB in the beginning and 92.9MB in the end (delta: -42.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,257 INFO L158 Benchmark]: Boogie Preprocessor took 54.37ms. Allocated memory was 121.6MB in the beginning and 174.1MB in the end (delta: 52.4MB). Free memory was 92.9MB in the beginning and 146.8MB in the end (delta: -53.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,257 INFO L158 Benchmark]: RCFGBuilder took 852.90ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 112.3MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,258 INFO L158 Benchmark]: TraceAbstraction took 16173.32ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 111.2MB in the beginning and 126.8MB in the end (delta: -15.7MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,258 INFO L158 Benchmark]: Witness Printer took 116.43ms. Allocated memory is still 362.8MB. Free memory was 126.8MB in the beginning and 327.8MB in the end (delta: -200.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:31:34,261 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.36ms. Allocated memory is still 121.6MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 683.25ms. Allocated memory is still 121.6MB. Free memory was 76.9MB in the beginning and 50.1MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.12ms. Allocated memory is still 121.6MB. Free memory was 50.1MB in the beginning and 92.9MB in the end (delta: -42.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.37ms. Allocated memory was 121.6MB in the beginning and 174.1MB in the end (delta: 52.4MB). Free memory was 92.9MB in the beginning and 146.8MB in the end (delta: -53.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * RCFGBuilder took 852.90ms. Allocated memory is still 174.1MB. Free memory was 146.8MB in the beginning and 112.3MB in the end (delta: 34.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16173.32ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 111.2MB in the beginning and 126.8MB in the end (delta: -15.7MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. * Witness Printer took 116.43ms. Allocated memory is still 362.8MB. Free memory was 126.8MB in the beginning and 327.8MB in the end (delta: -200.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 122 PlacesBefore, 34 PlacesAfterwards, 114 TransitionsBefore, 25 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 6078 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2788, independent: 2590, independent conditional: 0, independent unconditional: 2590, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1629, independent: 1563, independent conditional: 0, independent unconditional: 1563, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1629, independent: 1538, independent conditional: 0, independent unconditional: 1538, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 534, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 485, dependent conditional: 0, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2788, independent: 1027, independent conditional: 0, independent unconditional: 1027, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1629, unknown conditional: 0, unknown unconditional: 1629] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_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; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t657; [L839] FCALL, FORK 0 pthread_create(&t657, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t657, ((void *)0), P0, ((void *)0))=-1, t657={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t658; [L841] FCALL, FORK 0 pthread_create(&t658, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t658, ((void *)0), P1, ((void *)0))=0, t657={5:0}, t658={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t659; [L843] FCALL, FORK 0 pthread_create(&t659, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t659, ((void *)0), P2, ((void *)0))=1, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L794] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __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=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t657={5:0}, t658={6:0}, t659={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 843]: 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: 841]: 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: 839]: 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, 145 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: 15.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1001 IncrementalHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 43 mSDtfsCounter, 1001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=7, InterpolantAutomatonStates: 50, 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.4s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1305 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 17:31:34,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118a0fe8-c653-4c1a-a57e-de85310f50e5/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE