./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 10:57:43,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:57:43,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:57:43,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:57:43,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:57:43,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:57:43,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:57:43,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:57:43,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:57:43,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:57:43,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:57:43,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:57:43,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:57:43,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:57:43,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:57:43,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:57:43,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:57:43,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:57:43,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:57:43,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:57:43,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:57:43,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:57:43,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:57:43,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:57:43,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:57:43,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:57:43,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:57:43,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:57:43,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:57:43,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:57:43,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:57:43,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:57:43,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:57:43,374 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:57:43,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:57:43,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:57:43,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:57:43,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:57:43,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:57:43,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:57:43,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:57:43,378 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 10:57:43,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:57:43,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:57:43,392 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 10:57:43,392 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 10:57:43,393 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 10:57:43,393 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 10:57:43,393 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:57:43,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:57:43,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:57:43,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:57:43,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:57:43,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:57:43,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:57:43,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:57:43,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 10:57:43,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 10:57:43,397 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 10:57:43,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 10:57:43,397 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 10:57:43,397 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_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e73cda23545f4a54d3eef0093038f0fb79909f0b7b9d845db14abda8dd1f5281 [2022-12-13 10:57:43,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:57:43,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:57:43,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:57:43,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:57:43,575 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:57:43,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 10:57:46,227 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:57:46,437 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:57:46,438 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 10:57:46,449 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/data/a3da59810/1e7486ef8f58403081d4033a2fc67cd0/FLAG9894476c3 [2022-12-13 10:57:46,459 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/data/a3da59810/1e7486ef8f58403081d4033a2fc67cd0 [2022-12-13 10:57:46,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:57:46,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 10:57:46,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:57:46,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:57:46,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:57:46,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46, skipping insertion in model container [2022-12-13 10:57:46,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:57:46,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:57:46,671 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_907e500d-ee27-4b9f-b34d-214da167574f/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 10:57:46,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,835 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,836 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:57:46,871 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:57:46,884 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_907e500d-ee27-4b9f-b34d-214da167574f/sv-benchmarks/c/pthread-wmm/safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-12-13 10:57:46,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 10:57:46,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 10:57:46,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:57:46,948 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:57:46,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46 WrapperNode [2022-12-13 10:57:46,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:57:46,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:57:46,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:57:46,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:57:46,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,966 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,985 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 10:57:46,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:57:46,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:57:46,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:57:46,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:57:46,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:46,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:57:47,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:57:47,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:57:47,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:57:47,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (1/1) ... [2022-12-13 10:57:47,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:57:47,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 10:57:47,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 10:57:47,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 10:57:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:57:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 10:57:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:57:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:57:47,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 10:57:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 10:57:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 10:57:47,063 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 10:57:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:57:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:57:47,065 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 10:57:47,181 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 10:57:47,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:57:47,433 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 10:57:47,513 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:57:47,513 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 10:57:47,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:57:47 BoogieIcfgContainer [2022-12-13 10:57:47,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:57:47,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:57:47,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:57:47,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:57:47,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:57:46" (1/3) ... [2022-12-13 10:57:47,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:57:47, skipping insertion in model container [2022-12-13 10:57:47,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:57:46" (2/3) ... [2022-12-13 10:57:47,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4481e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:57:47, skipping insertion in model container [2022-12-13 10:57:47,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:57:47" (3/3) ... [2022-12-13 10:57:47,521 INFO L112 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 10:57:47,527 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 10:57:47,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:57:47,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 10:57:47,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:57:47,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 10:57:47,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 10:57:47,630 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 10:57:47,630 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:57:47,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 10:57:47,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-12-13 10:57:47,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-12-13 10:57:47,642 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 10:57:47,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 10:57:47,651 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 233 flow [2022-12-13 10:57:47,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 233 flow [2022-12-13 10:57:47,669 INFO L130 PetriNetUnfolder]: 2/112 cut-off events. [2022-12-13 10:57:47,670 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:57:47,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 10:57:47,671 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 10:57:51,202 INFO L134 LiptonReduction]: Checked pairs total: 5489 [2022-12-13 10:57:51,203 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 10:57:51,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:57:51,217 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;@254c1831, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 10:57:51,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 10:57:51,219 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 10:57:51,219 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:57:51,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:51,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 10:57:51,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 493204, now seen corresponding path program 1 times [2022-12-13 10:57:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:51,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868642999] [2022-12-13 10:57:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:51,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:51,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:51,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868642999] [2022-12-13 10:57:51,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868642999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:51,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:51,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:57:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351981686] [2022-12-13 10:57:51,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:51,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:57:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:51,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:57:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:57:51,519 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 217 [2022-12-13 10:57:51,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:51,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 217 [2022-12-13 10:57:51,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:51,737 INFO L130 PetriNetUnfolder]: 711/1167 cut-off events. [2022-12-13 10:57:51,737 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-13 10:57:51,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2286 conditions, 1167 events. 711/1167 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6039 event pairs, 111 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 2275. Up to 871 conditions per place. [2022-12-13 10:57:51,744 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 10:57:51,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2022-12-13 10:57:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:57:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:57:51,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-12-13 10:57:51,754 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176651305683564 [2022-12-13 10:57:51,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-12-13 10:57:51,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-12-13 10:57:51,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:51,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-12-13 10:57:51,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,765 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 337 transitions. [2022-12-13 10:57:51,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2022-12-13 10:57:51,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 10:57:51,769 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-12-13 10:57:51,770 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 10:57:51,773 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 10:57:51,773 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-12-13 10:57:51,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,773 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:51,773 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:51,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:57:51,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:51,774 INFO L85 PathProgramCache]: Analyzing trace with hash -834125036, now seen corresponding path program 1 times [2022-12-13 10:57:51,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:51,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703450088] [2022-12-13 10:57:51,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:51,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703450088] [2022-12-13 10:57:51,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703450088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:51,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:51,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 10:57:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247266423] [2022-12-13 10:57:51,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:51,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 10:57:51,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:51,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 10:57:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 10:57:51,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 217 [2022-12-13 10:57:51,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:51,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:51,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 217 [2022-12-13 10:57:51,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:52,081 INFO L130 PetriNetUnfolder]: 527/863 cut-off events. [2022-12-13 10:57:52,081 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 10:57:52,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 863 events. 527/863 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3966 event pairs, 143 based on Foata normal form. 16/873 useless extension candidates. Maximal degree in co-relation 1777. Up to 609 conditions per place. [2022-12-13 10:57:52,084 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 24 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-13 10:57:52,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 122 flow [2022-12-13 10:57:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:57:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:57:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-12-13 10:57:52,086 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5023041474654378 [2022-12-13 10:57:52,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2022-12-13 10:57:52,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2022-12-13 10:57:52,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:52,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2022-12-13 10:57:52,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,089 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,089 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 327 transitions. [2022-12-13 10:57:52,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 122 flow [2022-12-13 10:57:52,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:57:52,090 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-13 10:57:52,090 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 10:57:52,090 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 10:57:52,091 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2022-12-13 10:57:52,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:52,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:52,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:57:52,091 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:52,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash -88073680, now seen corresponding path program 1 times [2022-12-13 10:57:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:52,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268501213] [2022-12-13 10:57:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:52,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268501213] [2022-12-13 10:57:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268501213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:52,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:52,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:57:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441315278] [2022-12-13 10:57:52,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:52,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:57:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:52,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:57:52,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:57:52,404 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 217 [2022-12-13 10:57:52,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:52,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 217 [2022-12-13 10:57:52,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:52,559 INFO L130 PetriNetUnfolder]: 498/829 cut-off events. [2022-12-13 10:57:52,560 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2022-12-13 10:57:52,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 829 events. 498/829 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3894 event pairs, 93 based on Foata normal form. 12/836 useless extension candidates. Maximal degree in co-relation 1764. Up to 634 conditions per place. [2022-12-13 10:57:52,562 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-13 10:57:52,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 137 flow [2022-12-13 10:57:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 10:57:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 10:57:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2022-12-13 10:57:52,564 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47772657450076805 [2022-12-13 10:57:52,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2022-12-13 10:57:52,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2022-12-13 10:57:52,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:52,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2022-12-13 10:57:52,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,566 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 311 transitions. [2022-12-13 10:57:52,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 137 flow [2022-12-13 10:57:52,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:57:52,567 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2022-12-13 10:57:52,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-13 10:57:52,568 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2022-12-13 10:57:52,568 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2022-12-13 10:57:52,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:52,568 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:52,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:57:52,569 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:52,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:52,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1518410160, now seen corresponding path program 1 times [2022-12-13 10:57:52,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:52,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163137461] [2022-12-13 10:57:52,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:52,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:52,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:52,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163137461] [2022-12-13 10:57:52,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163137461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:52,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:52,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 10:57:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432092836] [2022-12-13 10:57:52,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:52,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:57:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:57:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:57:52,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-12-13 10:57:52,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:52,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:52,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-12-13 10:57:52,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:53,144 INFO L130 PetriNetUnfolder]: 728/1130 cut-off events. [2022-12-13 10:57:53,144 INFO L131 PetriNetUnfolder]: For 195/195 co-relation queries the response was YES. [2022-12-13 10:57:53,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1130 events. 728/1130 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5329 event pairs, 85 based on Foata normal form. 9/1133 useless extension candidates. Maximal degree in co-relation 2579. Up to 663 conditions per place. [2022-12-13 10:57:53,149 INFO L137 encePairwiseOnDemand]: 207/217 looper letters, 40 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2022-12-13 10:57:53,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 261 flow [2022-12-13 10:57:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:57:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:57:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2022-12-13 10:57:53,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47557603686635946 [2022-12-13 10:57:53,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2022-12-13 10:57:53,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2022-12-13 10:57:53,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:53,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2022-12-13 10:57:53,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,154 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 5 states and 516 transitions. [2022-12-13 10:57:53,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 261 flow [2022-12-13 10:57:53,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 56 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 10:57:53,155 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 158 flow [2022-12-13 10:57:53,155 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-13 10:57:53,156 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2022-12-13 10:57:53,156 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 158 flow [2022-12-13 10:57:53,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,156 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:53,156 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:53,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:57:53,156 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:53,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash 344108302, now seen corresponding path program 2 times [2022-12-13 10:57:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:53,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110729812] [2022-12-13 10:57:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:53,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110729812] [2022-12-13 10:57:53,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110729812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:53,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:53,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:57:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923306217] [2022-12-13 10:57:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:53,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:57:53,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-12-13 10:57:53,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:53,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-12-13 10:57:53,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:53,686 INFO L130 PetriNetUnfolder]: 899/1447 cut-off events. [2022-12-13 10:57:53,686 INFO L131 PetriNetUnfolder]: For 1693/1713 co-relation queries the response was YES. [2022-12-13 10:57:53,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 1447 events. 899/1447 cut-off events. For 1693/1713 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7436 event pairs, 134 based on Foata normal form. 47/1490 useless extension candidates. Maximal degree in co-relation 4601. Up to 585 conditions per place. [2022-12-13 10:57:53,700 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 37 selfloop transitions, 3 changer transitions 14/56 dead transitions. [2022-12-13 10:57:53,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 357 flow [2022-12-13 10:57:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:57:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:57:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2022-12-13 10:57:53,701 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2022-12-13 10:57:53,701 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2022-12-13 10:57:53,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2022-12-13 10:57:53,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:53,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2022-12-13 10:57:53,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,704 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 158 flow. Second operand 4 states and 412 transitions. [2022-12-13 10:57:53,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 357 flow [2022-12-13 10:57:53,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:57:53,706 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 119 flow [2022-12-13 10:57:53,706 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2022-12-13 10:57:53,706 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2022-12-13 10:57:53,706 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 119 flow [2022-12-13 10:57:53,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,707 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:53,707 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:53,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:57:53,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:53,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -86411012, now seen corresponding path program 1 times [2022-12-13 10:57:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:53,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487609263] [2022-12-13 10:57:53,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487609263] [2022-12-13 10:57:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487609263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:53,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:57:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403640548] [2022-12-13 10:57:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:57:53,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 217 [2022-12-13 10:57:53,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:53,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:53,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 217 [2022-12-13 10:57:53,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:54,208 INFO L130 PetriNetUnfolder]: 598/981 cut-off events. [2022-12-13 10:57:54,208 INFO L131 PetriNetUnfolder]: For 1572/1573 co-relation queries the response was YES. [2022-12-13 10:57:54,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 981 events. 598/981 cut-off events. For 1572/1573 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4407 event pairs, 161 based on Foata normal form. 36/1015 useless extension candidates. Maximal degree in co-relation 3072. Up to 434 conditions per place. [2022-12-13 10:57:54,213 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 30 selfloop transitions, 3 changer transitions 6/41 dead transitions. [2022-12-13 10:57:54,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 262 flow [2022-12-13 10:57:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:57:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:57:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2022-12-13 10:57:54,215 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2022-12-13 10:57:54,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2022-12-13 10:57:54,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2022-12-13 10:57:54,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:54,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2022-12-13 10:57:54,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,218 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 119 flow. Second operand 4 states and 406 transitions. [2022-12-13 10:57:54,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 262 flow [2022-12-13 10:57:54,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 240 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-13 10:57:54,221 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 106 flow [2022-12-13 10:57:54,221 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2022-12-13 10:57:54,222 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-13 10:57:54,222 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 106 flow [2022-12-13 10:57:54,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,222 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:54,222 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:54,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 10:57:54,222 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1797625975, now seen corresponding path program 1 times [2022-12-13 10:57:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:54,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227097892] [2022-12-13 10:57:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:54,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:54,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227097892] [2022-12-13 10:57:54,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227097892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:54,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:54,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:57:54,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562715715] [2022-12-13 10:57:54,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:54,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:54,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:57:54,613 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2022-12-13 10:57:54,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:54,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2022-12-13 10:57:54,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:54,744 INFO L130 PetriNetUnfolder]: 380/613 cut-off events. [2022-12-13 10:57:54,744 INFO L131 PetriNetUnfolder]: For 835/847 co-relation queries the response was YES. [2022-12-13 10:57:54,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 613 events. 380/613 cut-off events. For 835/847 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2147 event pairs, 201 based on Foata normal form. 1/614 useless extension candidates. Maximal degree in co-relation 2012. Up to 568 conditions per place. [2022-12-13 10:57:54,746 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 31 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2022-12-13 10:57:54,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 276 flow [2022-12-13 10:57:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:57:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:57:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-12-13 10:57:54,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4912442396313364 [2022-12-13 10:57:54,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2022-12-13 10:57:54,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2022-12-13 10:57:54,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:54,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2022-12-13 10:57:54,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,751 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 106 flow. Second operand 5 states and 533 transitions. [2022-12-13 10:57:54,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 276 flow [2022-12-13 10:57:54,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 254 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 10:57:54,753 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 163 flow [2022-12-13 10:57:54,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-13 10:57:54,753 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2022-12-13 10:57:54,753 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 163 flow [2022-12-13 10:57:54,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:54,753 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:54,753 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:54,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 10:57:54,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 47768315, now seen corresponding path program 2 times [2022-12-13 10:57:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:54,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620422335] [2022-12-13 10:57:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620422335] [2022-12-13 10:57:55,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620422335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:55,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:55,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:57:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108166907] [2022-12-13 10:57:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:55,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:57:55,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 217 [2022-12-13 10:57:55,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:55,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 217 [2022-12-13 10:57:55,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:55,194 INFO L130 PetriNetUnfolder]: 374/605 cut-off events. [2022-12-13 10:57:55,194 INFO L131 PetriNetUnfolder]: For 926/950 co-relation queries the response was YES. [2022-12-13 10:57:55,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2103 conditions, 605 events. 374/605 cut-off events. For 926/950 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2172 event pairs, 184 based on Foata normal form. 10/615 useless extension candidates. Maximal degree in co-relation 2087. Up to 551 conditions per place. [2022-12-13 10:57:55,198 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2022-12-13 10:57:55,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 324 flow [2022-12-13 10:57:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 10:57:55,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 10:57:55,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-12-13 10:57:55,200 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 10:57:55,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2022-12-13 10:57:55,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2022-12-13 10:57:55,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:55,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2022-12-13 10:57:55,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,204 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,204 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 163 flow. Second operand 4 states and 434 transitions. [2022-12-13 10:57:55,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 324 flow [2022-12-13 10:57:55,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 10:57:55,206 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 217 flow [2022-12-13 10:57:55,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 10:57:55,207 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2022-12-13 10:57:55,207 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 217 flow [2022-12-13 10:57:55,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:55,208 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 10:57:55,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2103383320, now seen corresponding path program 1 times [2022-12-13 10:57:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:55,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981866357] [2022-12-13 10:57:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:55,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:55,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:55,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981866357] [2022-12-13 10:57:55,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981866357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:55,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:55,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:57:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778280657] [2022-12-13 10:57:55,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:55,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:57:55,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:57:55,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:57:55,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217 [2022-12-13 10:57:55,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:55,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217 [2022-12-13 10:57:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:55,474 INFO L130 PetriNetUnfolder]: 293/506 cut-off events. [2022-12-13 10:57:55,474 INFO L131 PetriNetUnfolder]: For 1591/1595 co-relation queries the response was YES. [2022-12-13 10:57:55,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1979 conditions, 506 events. 293/506 cut-off events. For 1591/1595 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2014 event pairs, 98 based on Foata normal form. 51/544 useless extension candidates. Maximal degree in co-relation 1961. Up to 307 conditions per place. [2022-12-13 10:57:55,476 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 31 selfloop transitions, 4 changer transitions 23/62 dead transitions. [2022-12-13 10:57:55,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 483 flow [2022-12-13 10:57:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:57:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:57:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2022-12-13 10:57:55,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4930875576036866 [2022-12-13 10:57:55,478 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2022-12-13 10:57:55,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2022-12-13 10:57:55,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:55,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2022-12-13 10:57:55,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,480 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 217 flow. Second operand 5 states and 535 transitions. [2022-12-13 10:57:55,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 483 flow [2022-12-13 10:57:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 464 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 10:57:55,482 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 188 flow [2022-12-13 10:57:55,482 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2022-12-13 10:57:55,482 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-12-13 10:57:55,482 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 188 flow [2022-12-13 10:57:55,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:55,483 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:55,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 10:57:55,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:55,483 INFO L85 PathProgramCache]: Analyzing trace with hash 357962551, now seen corresponding path program 1 times [2022-12-13 10:57:55,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:55,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714166900] [2022-12-13 10:57:55,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:55,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:55,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:55,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714166900] [2022-12-13 10:57:55,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714166900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:55,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:55,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:57:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334945153] [2022-12-13 10:57:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:55,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:57:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:55,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:57:55,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:57:55,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217 [2022-12-13 10:57:55,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:55,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217 [2022-12-13 10:57:55,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:55,742 INFO L130 PetriNetUnfolder]: 151/293 cut-off events. [2022-12-13 10:57:55,742 INFO L131 PetriNetUnfolder]: For 1107/1111 co-relation queries the response was YES. [2022-12-13 10:57:55,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 293 events. 151/293 cut-off events. For 1107/1111 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1033 event pairs, 29 based on Foata normal form. 29/317 useless extension candidates. Maximal degree in co-relation 1262. Up to 126 conditions per place. [2022-12-13 10:57:55,743 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 37 selfloop transitions, 7 changer transitions 16/64 dead transitions. [2022-12-13 10:57:55,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 526 flow [2022-12-13 10:57:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:57:55,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:57:55,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 639 transitions. [2022-12-13 10:57:55,745 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49078341013824883 [2022-12-13 10:57:55,745 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 639 transitions. [2022-12-13 10:57:55,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 639 transitions. [2022-12-13 10:57:55,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:55,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 639 transitions. [2022-12-13 10:57:55,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,748 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,748 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 188 flow. Second operand 6 states and 639 transitions. [2022-12-13 10:57:55,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 526 flow [2022-12-13 10:57:55,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 514 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 10:57:55,750 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 232 flow [2022-12-13 10:57:55,750 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-13 10:57:55,750 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2022-12-13 10:57:55,750 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 232 flow [2022-12-13 10:57:55,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:55,751 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:55,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 10:57:55,751 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:55,751 INFO L85 PathProgramCache]: Analyzing trace with hash -69733628, now seen corresponding path program 1 times [2022-12-13 10:57:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:55,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199528388] [2022-12-13 10:57:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:55,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199528388] [2022-12-13 10:57:55,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199528388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 10:57:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11796143] [2022-12-13 10:57:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:55,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:57:55,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:57:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:57:55,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217 [2022-12-13 10:57:55,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:55,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:55,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217 [2022-12-13 10:57:55,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:56,002 INFO L130 PetriNetUnfolder]: 98/198 cut-off events. [2022-12-13 10:57:56,002 INFO L131 PetriNetUnfolder]: For 752/756 co-relation queries the response was YES. [2022-12-13 10:57:56,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 198 events. 98/198 cut-off events. For 752/756 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 601 event pairs, 26 based on Foata normal form. 10/205 useless extension candidates. Maximal degree in co-relation 864. Up to 75 conditions per place. [2022-12-13 10:57:56,003 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 34 selfloop transitions, 10 changer transitions 8/56 dead transitions. [2022-12-13 10:57:56,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 495 flow [2022-12-13 10:57:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 10:57:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 10:57:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2022-12-13 10:57:56,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4792626728110599 [2022-12-13 10:57:56,005 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2022-12-13 10:57:56,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2022-12-13 10:57:56,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:56,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2022-12-13 10:57:56,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,008 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,008 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 232 flow. Second operand 7 states and 728 transitions. [2022-12-13 10:57:56,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 495 flow [2022-12-13 10:57:56,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 446 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 10:57:56,010 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 224 flow [2022-12-13 10:57:56,010 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2022-12-13 10:57:56,010 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 10:57:56,010 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 224 flow [2022-12-13 10:57:56,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,011 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:56,011 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] [2022-12-13 10:57:56,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 10:57:56,011 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash -895322632, now seen corresponding path program 1 times [2022-12-13 10:57:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:56,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443693296] [2022-12-13 10:57:56,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:56,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:56,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443693296] [2022-12-13 10:57:56,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443693296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:56,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:56,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:57:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507579484] [2022-12-13 10:57:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:56,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 10:57:56,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 10:57:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 10:57:56,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 217 [2022-12-13 10:57:56,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:56,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 217 [2022-12-13 10:57:56,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:56,642 INFO L130 PetriNetUnfolder]: 118/245 cut-off events. [2022-12-13 10:57:56,642 INFO L131 PetriNetUnfolder]: For 752/752 co-relation queries the response was YES. [2022-12-13 10:57:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 245 events. 118/245 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 791 event pairs, 21 based on Foata normal form. 1/246 useless extension candidates. Maximal degree in co-relation 1059. Up to 178 conditions per place. [2022-12-13 10:57:56,643 INFO L137 encePairwiseOnDemand]: 210/217 looper letters, 36 selfloop transitions, 12 changer transitions 7/57 dead transitions. [2022-12-13 10:57:56,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 518 flow [2022-12-13 10:57:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:57:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:57:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-12-13 10:57:56,646 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4792626728110599 [2022-12-13 10:57:56,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 624 transitions. [2022-12-13 10:57:56,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 624 transitions. [2022-12-13 10:57:56,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:56,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 624 transitions. [2022-12-13 10:57:56,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,649 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,649 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 224 flow. Second operand 6 states and 624 transitions. [2022-12-13 10:57:56,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 518 flow [2022-12-13 10:57:56,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 57 transitions, 430 flow, removed 28 selfloop flow, removed 6 redundant places. [2022-12-13 10:57:56,652 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 270 flow [2022-12-13 10:57:56,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-12-13 10:57:56,653 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-13 10:57:56,653 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 270 flow [2022-12-13 10:57:56,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:56,654 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:56,654 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] [2022-12-13 10:57:56,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 10:57:56,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash 936405516, now seen corresponding path program 2 times [2022-12-13 10:57:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:56,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240577784] [2022-12-13 10:57:56,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:56,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:57:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:57:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:57:57,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240577784] [2022-12-13 10:57:57,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240577784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:57:57,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:57:57,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 10:57:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110432115] [2022-12-13 10:57:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:57:57,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 10:57:57,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:57:57,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 10:57:57,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 10:57:57,361 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 217 [2022-12-13 10:57:57,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:57,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:57:57,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 217 [2022-12-13 10:57:57,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:57:57,591 INFO L130 PetriNetUnfolder]: 126/267 cut-off events. [2022-12-13 10:57:57,591 INFO L131 PetriNetUnfolder]: For 795/795 co-relation queries the response was YES. [2022-12-13 10:57:57,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 267 events. 126/267 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 914 event pairs, 21 based on Foata normal form. 1/268 useless extension candidates. Maximal degree in co-relation 1178. Up to 162 conditions per place. [2022-12-13 10:57:57,592 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 33 selfloop transitions, 12 changer transitions 13/60 dead transitions. [2022-12-13 10:57:57,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 510 flow [2022-12-13 10:57:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:57:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:57:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-12-13 10:57:57,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2022-12-13 10:57:57,594 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2022-12-13 10:57:57,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2022-12-13 10:57:57,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 10:57:57,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2022-12-13 10:57:57,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:57,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:57,597 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:57,597 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 270 flow. Second operand 6 states and 618 transitions. [2022-12-13 10:57:57,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 510 flow [2022-12-13 10:57:57,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 465 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-13 10:57:57,599 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 271 flow [2022-12-13 10:57:57,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-13 10:57:57,599 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-12-13 10:57:57,599 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 271 flow [2022-12-13 10:57:57,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.375) internal successors, (795), 8 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 10:57:57,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:57:57,600 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] [2022-12-13 10:57:57,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 10:57:57,600 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 10:57:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:57:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1692754294, now seen corresponding path program 3 times [2022-12-13 10:57:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:57:57,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826230123] [2022-12-13 10:57:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:57:57,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:57:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 10:57:57,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 10:57:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 10:57:57,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 10:57:57,668 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 10:57:57,669 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 10:57:57,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 10:57:57,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 10:57:57,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 10:57:57,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 10:57:57,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 10:57:57,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 10:57:57,671 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:57:57,677 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:57:57,677 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:57:57,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:57:57 BasicIcfg [2022-12-13 10:57:57,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:57:57,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 10:57:57,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 10:57:57,714 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 10:57:57,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:57:47" (3/4) ... [2022-12-13 10:57:57,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 10:57:57,762 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 10:57:57,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 10:57:57,763 INFO L158 Benchmark]: Toolchain (without parser) took 11300.31ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 106.3MB in the beginning and 116.9MB in the end (delta: -10.6MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,763 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 102.8MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 10:57:57,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.86ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 79.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.48ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,764 INFO L158 Benchmark]: Boogie Preprocessor took 21.72ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,764 INFO L158 Benchmark]: RCFGBuilder took 507.45ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 87.0MB in the end (delta: -11.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,764 INFO L158 Benchmark]: TraceAbstraction took 10196.88ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 86.2MB in the beginning and 126.4MB in the end (delta: -40.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,764 INFO L158 Benchmark]: Witness Printer took 48.53ms. Allocated memory is still 207.6MB. Free memory was 126.4MB in the beginning and 116.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 10:57:57,766 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.12ms. Allocated memory is still 102.8MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 485.86ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 79.9MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.48ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 77.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.72ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.45ms. Allocated memory is still 142.6MB. Free memory was 75.3MB in the beginning and 87.0MB in the end (delta: -11.7MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10196.88ms. Allocated memory was 142.6MB in the beginning and 207.6MB in the end (delta: 65.0MB). Free memory was 86.2MB in the beginning and 126.4MB in the end (delta: -40.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Witness Printer took 48.53ms. Allocated memory is still 207.6MB. Free memory was 126.4MB in the beginning and 116.9MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 23 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 5489 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2624, independent: 2443, independent conditional: 0, independent unconditional: 2443, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1159, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2624, independent: 1333, independent conditional: 0, independent unconditional: 1333, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1159, unknown conditional: 0, unknown unconditional: 1159] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1961, ((void *)0), P0, ((void *)0))=-3, t1961={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] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1962, ((void *)0), P1, ((void *)0))=-2, t1961={5:0}, t1962={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1963, ((void *)0), P2, ((void *)0))=-1, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 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) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 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 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 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_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 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) [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] 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 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 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) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 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 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 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_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1961={5:0}, t1962={6:0}, t1963={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, 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: 823]: 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: 821]: 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: 825]: 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, 142 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: 10.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 553 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 72 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=13, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 2267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 10:57:57,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_907e500d-ee27-4b9f-b34d-214da167574f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE