./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 --- 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 13:45:24,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:45:24,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:45:24,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:45:24,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:45:24,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:45:24,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:45:24,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:45:24,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:45:24,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:45:24,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:45:24,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:45:24,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:45:24,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:45:24,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:45:24,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:45:24,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:45:24,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:45:24,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:45:24,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:45:24,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:45:24,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:45:24,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:45:24,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:45:24,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:45:24,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:45:24,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:45:24,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:45:24,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:45:24,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:45:24,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:45:24,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:45:24,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:45:24,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:45:24,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:45:24,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:45:24,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:45:24,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:45:24,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:45:24,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:45:24,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:45:24,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:45:24,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:45:24,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:45:24,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:45:24,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:45:24,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:45:24,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:45:24,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:45:24,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:45:24,095 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:45:24,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:45:24,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:45:24,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:45:24,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:45:24,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:45:24,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:45:24,098 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:45:24,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:45:24,098 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:45:24,098 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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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 -> 951d1f5e5395236f7d0da1ed6dd6f4a1398d1a8ad75d935345731aeb4389e0e8 [2022-12-13 13:45:24,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:45:24,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:45:24,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:45:24,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:45:24,280 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:45:24,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-12-13 13:45:26,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:45:26,999 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:45:26,999 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/sv-benchmarks/c/pthread-wmm/mix015.oepc.i [2022-12-13 13:45:27,012 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/data/5a1487696/cf57910e288747ac921dd5768ec6d831/FLAG1bb2face1 [2022-12-13 13:45:27,357 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/data/5a1487696/cf57910e288747ac921dd5768ec6d831 [2022-12-13 13:45:27,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:45:27,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:45:27,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:45:27,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:45:27,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:45:27,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65727521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27, skipping insertion in model container [2022-12-13 13:45:27,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:45:27,403 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:45:27,507 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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-12-13 13:45:27,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:45:27,631 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:45:27,640 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_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/sv-benchmarks/c/pthread-wmm/mix015.oepc.i[945,958] [2022-12-13 13:45:27,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:45:27,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:45:27,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:45:27,700 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:45:27,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27 WrapperNode [2022-12-13 13:45:27,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:45:27,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:45:27,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:45:27,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:45:27,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,744 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-12-13 13:45:27,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:45:27,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:45:27,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:45:27,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:45:27,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:45:27,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:45:27,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:45:27,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:45:27,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (1/1) ... [2022-12-13 13:45:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:45:27,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:45:27,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:45:27,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:45:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:45:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:45:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:45:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:45:27,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:45:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:45:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:45:27,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:45:27,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:45:27,843 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 13:45:27,945 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:45:27,946 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:45:28,195 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:45:28,290 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:45:28,290 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:45:28,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:45:28 BoogieIcfgContainer [2022-12-13 13:45:28,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:45:28,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:45:28,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:45:28,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:45:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:45:27" (1/3) ... [2022-12-13 13:45:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e06869d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:45:28, skipping insertion in model container [2022-12-13 13:45:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:45:27" (2/3) ... [2022-12-13 13:45:28,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e06869d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:45:28, skipping insertion in model container [2022-12-13 13:45:28,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:45:28" (3/3) ... [2022-12-13 13:45:28,297 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i [2022-12-13 13:45:28,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:45:28,311 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:45:28,311 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:45:28,311 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:45:28,349 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:45:28,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-12-13 13:45:28,421 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-12-13 13:45:28,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:45:28,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 13:45:28,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-12-13 13:45:28,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-12-13 13:45:28,433 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:45:28,440 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2022-12-13 13:45:28,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2022-12-13 13:45:28,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2022-12-13 13:45:28,463 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-12-13 13:45:28,463 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:45:28,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 13:45:28,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 2440 [2022-12-13 13:45:31,194 INFO L134 LiptonReduction]: Checked pairs total: 7061 [2022-12-13 13:45:31,195 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-12-13 13:45:31,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:45:31,209 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;@6011977f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:45:31,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 13:45:31,211 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 13:45:31,211 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:45:31,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:31,212 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 13:45:31,212 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 13:45:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash 513032, now seen corresponding path program 1 times [2022-12-13 13:45:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:31,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825761079] [2022-12-13 13:45:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:31,467 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 13:45:31,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825761079] [2022-12-13 13:45:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825761079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:31,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:31,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:45:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795126147] [2022-12-13 13:45:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:31,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:45:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:45:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:45:31,496 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 227 [2022-12-13 13:45:31,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:31,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:31,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 227 [2022-12-13 13:45:31,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:31,818 INFO L130 PetriNetUnfolder]: 1616/2521 cut-off events. [2022-12-13 13:45:31,818 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 13:45:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4945 conditions, 2521 events. 1616/2521 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14185 event pairs, 204 based on Foata normal form. 100/2413 useless extension candidates. Maximal degree in co-relation 4934. Up to 2013 conditions per place. [2022-12-13 13:45:31,829 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2022-12-13 13:45:31,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 181 flow [2022-12-13 13:45:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:45:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:45:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-12-13 13:45:31,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5389133627019089 [2022-12-13 13:45:31,839 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-12-13 13:45:31,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-12-13 13:45:31,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:31,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-12-13 13:45:31,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 13:45:31,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:31,848 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:31,850 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 367 transitions. [2022-12-13 13:45:31,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 181 flow [2022-12-13 13:45:31,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:45:31,853 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-12-13 13:45:31,855 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 13:45:31,857 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2022-12-13 13:45:31,857 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-12-13 13:45:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:31,857 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:31,858 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:31,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:45:31,858 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 13:45:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1832088602, now seen corresponding path program 1 times [2022-12-13 13:45:31,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:31,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034170984] [2022-12-13 13:45:31,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:32,024 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 13:45:32,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:32,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034170984] [2022-12-13 13:45:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034170984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:32,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:32,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:45:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633841230] [2022-12-13 13:45:32,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:45:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:45:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:45:32,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 13:45:32,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:32,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 13:45:32,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:32,383 INFO L130 PetriNetUnfolder]: 1383/2081 cut-off events. [2022-12-13 13:45:32,384 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2022-12-13 13:45:32,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 2081 events. 1383/2081 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9758 event pairs, 397 based on Foata normal form. 120/2195 useless extension candidates. Maximal degree in co-relation 4339. Up to 1301 conditions per place. [2022-12-13 13:45:32,390 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 29 selfloop transitions, 2 changer transitions 20/53 dead transitions. [2022-12-13 13:45:32,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 53 transitions, 224 flow [2022-12-13 13:45:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:45:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:45:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-12-13 13:45:32,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5092511013215859 [2022-12-13 13:45:32,393 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2022-12-13 13:45:32,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2022-12-13 13:45:32,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:32,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2022-12-13 13:45:32,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 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 13:45:32,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,397 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 578 transitions. [2022-12-13 13:45:32,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 53 transitions, 224 flow [2022-12-13 13:45:32,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 53 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:45:32,398 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 66 flow [2022-12-13 13:45:32,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-13 13:45:32,399 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-13 13:45:32,399 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 66 flow [2022-12-13 13:45:32,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:32,399 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:45:32,400 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 13:45:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1426513950, now seen corresponding path program 1 times [2022-12-13 13:45:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:32,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381625673] [2022-12-13 13:45:32,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:32,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:32,523 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 13:45:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:32,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381625673] [2022-12-13 13:45:32,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381625673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:32,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:32,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:45:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113454083] [2022-12-13 13:45:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:32,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:45:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:45:32,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:45:32,554 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2022-12-13 13:45:32,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:32,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2022-12-13 13:45:32,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:32,936 INFO L130 PetriNetUnfolder]: 1835/2728 cut-off events. [2022-12-13 13:45:32,936 INFO L131 PetriNetUnfolder]: For 552/552 co-relation queries the response was YES. [2022-12-13 13:45:32,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5997 conditions, 2728 events. 1835/2728 cut-off events. For 552/552 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12402 event pairs, 473 based on Foata normal form. 120/2848 useless extension candidates. Maximal degree in co-relation 5984. Up to 1845 conditions per place. [2022-12-13 13:45:32,949 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 37 selfloop transitions, 2 changer transitions 20/59 dead transitions. [2022-12-13 13:45:32,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 263 flow [2022-12-13 13:45:32,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:45:32,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:45:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-12-13 13:45:32,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48546255506607927 [2022-12-13 13:45:32,951 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-12-13 13:45:32,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-12-13 13:45:32,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:32,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-12-13 13:45:32,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 13:45:32,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,957 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:32,957 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 66 flow. Second operand 5 states and 551 transitions. [2022-12-13 13:45:32,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 59 transitions, 263 flow [2022-12-13 13:45:32,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 253 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 13:45:32,966 INFO L231 Difference]: Finished difference. Result has 39 places, 24 transitions, 70 flow [2022-12-13 13:45:32,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2022-12-13 13:45:32,966 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-13 13:45:32,967 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 70 flow [2022-12-13 13:45:32,967 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 13:45:32,967 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:32,968 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:32,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:45:32,968 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 13:45:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash -784436409, now seen corresponding path program 1 times [2022-12-13 13:45:32,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:32,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541327696] [2022-12-13 13:45:32,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:32,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:33,171 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 13:45:33,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:33,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541327696] [2022-12-13 13:45:33,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541327696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:33,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:33,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:45:33,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055792295] [2022-12-13 13:45:33,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:33,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:45:33,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:33,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:45:33,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:45:33,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 13:45:33,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 13:45:33,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:33,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 13:45:33,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:33,306 INFO L130 PetriNetUnfolder]: 488/822 cut-off events. [2022-12-13 13:45:33,307 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-12-13 13:45:33,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 822 events. 488/822 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3652 event pairs, 144 based on Foata normal form. 48/863 useless extension candidates. Maximal degree in co-relation 1895. Up to 626 conditions per place. [2022-12-13 13:45:33,310 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 32 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-13 13:45:33,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 179 flow [2022-12-13 13:45:33,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:45:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:45:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-12-13 13:45:33,312 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5168869309838473 [2022-12-13 13:45:33,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2022-12-13 13:45:33,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2022-12-13 13:45:33,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:33,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2022-12-13 13:45:33,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 13:45:33,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:33,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:33,314 INFO L175 Difference]: Start difference. First operand has 39 places, 24 transitions, 70 flow. Second operand 3 states and 352 transitions. [2022-12-13 13:45:33,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 179 flow [2022-12-13 13:45:33,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 169 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 13:45:33,316 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 88 flow [2022-12-13 13:45:33,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-13 13:45:33,317 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2022-12-13 13:45:33,317 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 88 flow [2022-12-13 13:45:33,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 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 13:45:33,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:33,317 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:33,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:45:33,318 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 13:45:33,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:33,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2089677076, now seen corresponding path program 1 times [2022-12-13 13:45:33,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:33,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113394840] [2022-12-13 13:45:33,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:33,456 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 13:45:33,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:33,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113394840] [2022-12-13 13:45:33,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113394840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:33,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:33,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:45:33,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940339321] [2022-12-13 13:45:33,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:33,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:45:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:33,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:45:33,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:45:33,464 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 13:45:33,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 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 13:45:33,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:33,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 13:45:33,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:33,586 INFO L130 PetriNetUnfolder]: 244/456 cut-off events. [2022-12-13 13:45:33,586 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 13:45:33,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 456 events. 244/456 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1869 event pairs, 101 based on Foata normal form. 40/489 useless extension candidates. Maximal degree in co-relation 1166. Up to 178 conditions per place. [2022-12-13 13:45:33,588 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 42 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-12-13 13:45:33,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 250 flow [2022-12-13 13:45:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:45:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:45:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2022-12-13 13:45:33,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176211453744494 [2022-12-13 13:45:33,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2022-12-13 13:45:33,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2022-12-13 13:45:33,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:33,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2022-12-13 13:45:33,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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 13:45:33,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:33,596 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:33,596 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 88 flow. Second operand 4 states and 470 transitions. [2022-12-13 13:45:33,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 250 flow [2022-12-13 13:45:33,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:45:33,598 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2022-12-13 13:45:33,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-13 13:45:33,599 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2022-12-13 13:45:33,599 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2022-12-13 13:45:33,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 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 13:45:33,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:33,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] [2022-12-13 13:45:33,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:45:33,600 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 13:45:33,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -712617646, now seen corresponding path program 1 times [2022-12-13 13:45:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:33,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248819495] [2022-12-13 13:45:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:34,156 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 13:45:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:34,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248819495] [2022-12-13 13:45:34,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248819495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:34,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:34,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:45:34,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798076369] [2022-12-13 13:45:34,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:34,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:45:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:34,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:45:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:45:34,174 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2022-12-13 13:45:34,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 13:45:34,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:34,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2022-12-13 13:45:34,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:34,494 INFO L130 PetriNetUnfolder]: 410/795 cut-off events. [2022-12-13 13:45:34,494 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2022-12-13 13:45:34,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 795 events. 410/795 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4005 event pairs, 92 based on Foata normal form. 7/797 useless extension candidates. Maximal degree in co-relation 2249. Up to 369 conditions per place. [2022-12-13 13:45:34,498 INFO L137 encePairwiseOnDemand]: 219/227 looper letters, 58 selfloop transitions, 9 changer transitions 31/101 dead transitions. [2022-12-13 13:45:34,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 101 transitions, 635 flow [2022-12-13 13:45:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:45:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:45:34,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 791 transitions. [2022-12-13 13:45:34,500 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4977973568281938 [2022-12-13 13:45:34,500 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 791 transitions. [2022-12-13 13:45:34,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 791 transitions. [2022-12-13 13:45:34,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:34,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 791 transitions. [2022-12-13 13:45:34,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:34,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 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 13:45:34,503 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 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 13:45:34,503 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 7 states and 791 transitions. [2022-12-13 13:45:34,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 101 transitions, 635 flow [2022-12-13 13:45:34,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 101 transitions, 581 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-13 13:45:34,505 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 170 flow [2022-12-13 13:45:34,506 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 13:45:34,506 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2022-12-13 13:45:34,506 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 170 flow [2022-12-13 13:45:34,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 13:45:34,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:34,507 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:45:34,507 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 13:45:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash -997545718, now seen corresponding path program 2 times [2022-12-13 13:45:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:34,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966011199] [2022-12-13 13:45:34,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:34,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:34,641 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 13:45:34,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966011199] [2022-12-13 13:45:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966011199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:34,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:34,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:45:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749530018] [2022-12-13 13:45:34,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:34,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:45:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:34,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:45:34,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:45:34,649 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 227 [2022-12-13 13:45:34,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 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 13:45:34,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:34,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 227 [2022-12-13 13:45:34,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:34,790 INFO L130 PetriNetUnfolder]: 295/560 cut-off events. [2022-12-13 13:45:34,791 INFO L131 PetriNetUnfolder]: For 528/528 co-relation queries the response was YES. [2022-12-13 13:45:34,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 560 events. 295/560 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2609 event pairs, 92 based on Foata normal form. 21/573 useless extension candidates. Maximal degree in co-relation 1758. Up to 228 conditions per place. [2022-12-13 13:45:34,795 INFO L137 encePairwiseOnDemand]: 222/227 looper letters, 55 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2022-12-13 13:45:34,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 420 flow [2022-12-13 13:45:34,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:45:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:45:34,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2022-12-13 13:45:34,797 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2022-12-13 13:45:34,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2022-12-13 13:45:34,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2022-12-13 13:45:34,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:34,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2022-12-13 13:45:34,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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 13:45:34,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:34,799 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:34,799 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 170 flow. Second operand 5 states and 575 transitions. [2022-12-13 13:45:34,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 420 flow [2022-12-13 13:45:34,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 406 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 13:45:34,801 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 181 flow [2022-12-13 13:45:34,801 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 13:45:34,802 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2022-12-13 13:45:34,802 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 181 flow [2022-12-13 13:45:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 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 13:45:34,802 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:34,802 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:34,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:45:34,802 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 13:45:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash -422865267, now seen corresponding path program 1 times [2022-12-13 13:45:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:34,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351003464] [2022-12-13 13:45:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:34,961 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 13:45:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:34,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351003464] [2022-12-13 13:45:34,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351003464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:34,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:34,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:45:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018446706] [2022-12-13 13:45:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:34,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:45:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:45:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:45:34,971 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 227 [2022-12-13 13:45:34,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 13:45:34,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:34,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 227 [2022-12-13 13:45:34,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:35,165 INFO L130 PetriNetUnfolder]: 456/870 cut-off events. [2022-12-13 13:45:35,165 INFO L131 PetriNetUnfolder]: For 1201/1201 co-relation queries the response was YES. [2022-12-13 13:45:35,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 870 events. 456/870 cut-off events. For 1201/1201 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4469 event pairs, 61 based on Foata normal form. 1/871 useless extension candidates. Maximal degree in co-relation 2840. Up to 421 conditions per place. [2022-12-13 13:45:35,168 INFO L137 encePairwiseOnDemand]: 223/227 looper letters, 47 selfloop transitions, 1 changer transitions 29/79 dead transitions. [2022-12-13 13:45:35,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 560 flow [2022-12-13 13:45:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:45:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:45:35,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-12-13 13:45:35,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4951541850220264 [2022-12-13 13:45:35,169 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2022-12-13 13:45:35,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2022-12-13 13:45:35,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:35,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2022-12-13 13:45:35,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 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 13:45:35,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:35,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:35,172 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 181 flow. Second operand 5 states and 562 transitions. [2022-12-13 13:45:35,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 560 flow [2022-12-13 13:45:35,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 504 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:45:35,175 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 159 flow [2022-12-13 13:45:35,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 13:45:35,176 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2022-12-13 13:45:35,176 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 159 flow [2022-12-13 13:45:35,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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 13:45:35,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:35,176 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:35,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:45:35,176 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 13:45:35,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:35,177 INFO L85 PathProgramCache]: Analyzing trace with hash 439223499, now seen corresponding path program 2 times [2022-12-13 13:45:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:35,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514790736] [2022-12-13 13:45:35,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:35,423 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 13:45:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:35,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514790736] [2022-12-13 13:45:35,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514790736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:35,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:35,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:45:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908114435] [2022-12-13 13:45:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:35,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:45:35,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:35,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:45:35,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:45:35,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2022-12-13 13:45:35,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 159 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 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 13:45:35,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:35,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2022-12-13 13:45:35,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:35,759 INFO L130 PetriNetUnfolder]: 591/1065 cut-off events. [2022-12-13 13:45:35,759 INFO L131 PetriNetUnfolder]: For 1041/1041 co-relation queries the response was YES. [2022-12-13 13:45:35,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 1065 events. 591/1065 cut-off events. For 1041/1041 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5155 event pairs, 46 based on Foata normal form. 1/1066 useless extension candidates. Maximal degree in co-relation 3339. Up to 453 conditions per place. [2022-12-13 13:45:35,762 INFO L137 encePairwiseOnDemand]: 215/227 looper letters, 58 selfloop transitions, 20 changer transitions 31/109 dead transitions. [2022-12-13 13:45:35,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 706 flow [2022-12-13 13:45:35,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:45:35,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:45:35,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 831 transitions. [2022-12-13 13:45:35,763 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45759911894273125 [2022-12-13 13:45:35,764 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 831 transitions. [2022-12-13 13:45:35,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 831 transitions. [2022-12-13 13:45:35,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:35,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 831 transitions. [2022-12-13 13:45:35,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.875) internal successors, (831), 8 states have internal predecessors, (831), 0 states have call successors, (0), 0 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 13:45:35,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:35,767 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:35,767 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 159 flow. Second operand 8 states and 831 transitions. [2022-12-13 13:45:35,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 706 flow [2022-12-13 13:45:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 690 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 13:45:35,771 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 304 flow [2022-12-13 13:45:35,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=304, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-13 13:45:35,771 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 18 predicate places. [2022-12-13 13:45:35,771 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 304 flow [2022-12-13 13:45:35,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 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 13:45:35,772 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:35,772 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:35,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:45:35,772 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 13:45:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash 122153107, now seen corresponding path program 3 times [2022-12-13 13:45:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:35,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363724463] [2022-12-13 13:45:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:35,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:36,198 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 13:45:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:36,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363724463] [2022-12-13 13:45:36,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363724463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:36,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:36,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:45:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287051703] [2022-12-13 13:45:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:36,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:45:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:45:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:45:36,250 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2022-12-13 13:45:36,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 304 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 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 13:45:36,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:36,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2022-12-13 13:45:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:36,570 INFO L130 PetriNetUnfolder]: 502/965 cut-off events. [2022-12-13 13:45:36,570 INFO L131 PetriNetUnfolder]: For 1525/1525 co-relation queries the response was YES. [2022-12-13 13:45:36,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3684 conditions, 965 events. 502/965 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4878 event pairs, 98 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 3667. Up to 347 conditions per place. [2022-12-13 13:45:36,572 INFO L137 encePairwiseOnDemand]: 217/227 looper letters, 46 selfloop transitions, 16 changer transitions 62/124 dead transitions. [2022-12-13 13:45:36,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 905 flow [2022-12-13 13:45:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:45:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:45:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2022-12-13 13:45:36,575 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4468918257464513 [2022-12-13 13:45:36,575 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 913 transitions. [2022-12-13 13:45:36,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 913 transitions. [2022-12-13 13:45:36,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:36,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 913 transitions. [2022-12-13 13:45:36,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 0 states have call successors, (0), 0 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 13:45:36,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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 13:45:36,580 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 0 states have call successors, (0), 0 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 13:45:36,580 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 304 flow. Second operand 9 states and 913 transitions. [2022-12-13 13:45:36,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 905 flow [2022-12-13 13:45:36,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 124 transitions, 903 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:45:36,586 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 357 flow [2022-12-13 13:45:36,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=357, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2022-12-13 13:45:36,586 INFO L288 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2022-12-13 13:45:36,587 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 357 flow [2022-12-13 13:45:36,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 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 13:45:36,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:36,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:36,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:45:36,587 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 13:45:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 132930743, now seen corresponding path program 4 times [2022-12-13 13:45:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:36,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048459151] [2022-12-13 13:45:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:45:36,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:45:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:45:36,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:45:36,662 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:45:36,662 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 13:45:36,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 13:45:36,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 13:45:36,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 13:45:36,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 13:45:36,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 13:45:36,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:45:36,665 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-12-13 13:45:36,669 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:45:36,669 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:45:36,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:45:36 BasicIcfg [2022-12-13 13:45:36,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:45:36,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:45:36,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:45:36,723 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:45:36,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:45:28" (3/4) ... [2022-12-13 13:45:36,725 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:45:36,769 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:45:36,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:45:36,770 INFO L158 Benchmark]: Toolchain (without parser) took 9407.48ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 106.4MB in the beginning and 155.1MB in the end (delta: -48.7MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,770 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:45:36,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.40ms. Allocated memory is still 140.5MB. Free memory was 106.0MB in the beginning and 79.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 140.5MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,771 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 140.5MB. Free memory was 76.6MB in the beginning and 74.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:45:36,771 INFO L158 Benchmark]: RCFGBuilder took 518.08ms. Allocated memory is still 140.5MB. Free memory was 74.5MB in the beginning and 80.6MB in the end (delta: -6.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,771 INFO L158 Benchmark]: TraceAbstraction took 8429.74ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 80.0MB in the beginning and 166.6MB in the end (delta: -86.6MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,772 INFO L158 Benchmark]: Witness Printer took 46.13ms. Allocated memory is still 205.5MB. Free memory was 166.6MB in the beginning and 155.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:45:36,773 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.17ms. Allocated memory is still 109.1MB. Free memory is still 57.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.40ms. Allocated memory is still 140.5MB. Free memory was 106.0MB in the beginning and 79.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 140.5MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 140.5MB. Free memory was 76.6MB in the beginning and 74.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 518.08ms. Allocated memory is still 140.5MB. Free memory was 74.5MB in the beginning and 80.6MB in the end (delta: -6.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8429.74ms. Allocated memory was 140.5MB in the beginning and 205.5MB in the end (delta: 65.0MB). Free memory was 80.0MB in the beginning and 166.6MB in the end (delta: -86.6MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. * Witness Printer took 46.13ms. Allocated memory is still 205.5MB. Free memory was 166.6MB in the beginning and 155.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 127 PlacesBefore, 37 PlacesAfterwards, 119 TransitionsBefore, 28 TransitionsAfterwards, 2440 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 7061 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3188, independent: 2972, independent conditional: 0, independent unconditional: 2972, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1300, independent: 1266, independent conditional: 0, independent unconditional: 1266, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3188, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 1300, unknown conditional: 0, unknown unconditional: 1300] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385; [L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385, ((void *)0), P0, ((void *)0))=-3, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t386; [L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t386, ((void *)0), P1, ((void *)0))=-2, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t387; [L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t387, ((void *)0), P2, ((void *)0))=-1, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 [L766] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L769] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 452 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1402 IncrementalHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 67 mSDtfsCounter, 1402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=10, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 13:45:36,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8a18b11-8afd-4d3b-89e3-923a74dee5bf/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