./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix042.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_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/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_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/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_6ae75b77-68e5-471b-816a-cb0710edc779/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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- 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 16:57:05,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:57:05,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:57:05,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:57:05,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:57:05,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:57:05,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:57:05,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:57:05,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:57:05,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:57:05,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:57:05,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:57:05,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:57:05,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:57:05,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:57:05,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:57:05,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:57:05,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:57:05,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:57:05,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:57:05,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:57:05,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:57:05,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:57:05,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:57:05,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:57:05,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:57:05,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:57:05,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:57:05,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:57:05,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:57:05,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:57:05,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:57:05,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:57:05,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:57:05,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:57:05,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:57:05,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:57:05,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:57:05,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:57:05,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:57:05,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:57:05,526 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:57:05,542 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:57:05,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:57:05,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:57:05,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:57:05,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:57:05,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:57:05,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:57:05,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:57:05,543 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:57:05,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:57:05,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:57:05,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:57:05,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:57:05,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:57:05,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:57:05,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:57:05,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:57:05,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:57:05,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:57:05,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:05,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:57:05,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:57:05,556 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:57:05,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:57:05,556 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:57:05,556 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_6ae75b77-68e5-471b-816a-cb0710edc779/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_6ae75b77-68e5-471b-816a-cb0710edc779/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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2022-12-13 16:57:05,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:57:05,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:57:05,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:57:05,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:57:05,742 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:57:05,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-12-13 16:57:08,287 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:57:08,452 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:57:08,453 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2022-12-13 16:57:08,462 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/data/2a403ec59/46ee49b171264057b6fb3190d7510e48/FLAGab203b36e [2022-12-13 16:57:08,866 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/data/2a403ec59/46ee49b171264057b6fb3190d7510e48 [2022-12-13 16:57:08,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:57:08,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:57:08,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:08,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:57:08,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:57:08,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:08" (1/1) ... [2022-12-13 16:57:08,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55bfd8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:08, skipping insertion in model container [2022-12-13 16:57:08,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:57:08" (1/1) ... [2022-12-13 16:57:08,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:57:08,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:57:09,054 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_6ae75b77-68e5-471b-816a-cb0710edc779/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-12-13 16:57:09,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:09,171 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:57:09,180 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_6ae75b77-68e5-471b-816a-cb0710edc779/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2022-12-13 16:57:09,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,204 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 16:57:09,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 16:57:09,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:57:09,238 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:57:09,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09 WrapperNode [2022-12-13 16:57:09,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:57:09,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:09,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:57:09,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:57:09,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,272 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 16:57:09,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:57:09,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:57:09,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:57:09,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:57:09,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,291 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:57:09,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:57:09,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:57:09,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:57:09,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (1/1) ... [2022-12-13 16:57:09,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:57:09,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:57:09,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:57:09,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:57:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 16:57:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 16:57:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:57:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 16:57:09,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 16:57:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 16:57:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 16:57:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 16:57:09,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:57:09,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:57:09,344 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 16:57:09,441 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:57:09,443 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:57:09,713 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:57:09,814 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:57:09,814 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 16:57:09,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:09 BoogieIcfgContainer [2022-12-13 16:57:09,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:57:09,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:57:09,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:57:09,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:57:09,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:57:08" (1/3) ... [2022-12-13 16:57:09,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8797b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:09, skipping insertion in model container [2022-12-13 16:57:09,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:57:09" (2/3) ... [2022-12-13 16:57:09,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8797b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:57:09, skipping insertion in model container [2022-12-13 16:57:09,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:09" (3/3) ... [2022-12-13 16:57:09,822 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2022-12-13 16:57:09,829 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 16:57:09,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:57:09,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 16:57:09,838 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 16:57:09,880 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 16:57:09,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2022-12-13 16:57:09,942 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-12-13 16:57:09,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:09,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-12-13 16:57:09,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2022-12-13 16:57:09,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2022-12-13 16:57:09,951 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 16:57:09,959 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2022-12-13 16:57:09,961 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2022-12-13 16:57:09,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2022-12-13 16:57:09,979 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2022-12-13 16:57:09,979 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:09,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-12-13 16:57:09,981 INFO L119 LiptonReduction]: Number of co-enabled transitions 2288 [2022-12-13 16:57:12,502 INFO L134 LiptonReduction]: Checked pairs total: 6271 [2022-12-13 16:57:12,502 INFO L136 LiptonReduction]: Total number of compositions: 101 [2022-12-13 16:57:12,512 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:57:12,517 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;@306e1230, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:57:12,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 16:57:12,518 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 16:57:12,518 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 16:57:12,519 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:12,519 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 16:57:12,519 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 16:57:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 502175, now seen corresponding path program 1 times [2022-12-13 16:57:12,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:12,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388326117] [2022-12-13 16:57:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:12,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:12,759 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 16:57:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:12,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388326117] [2022-12-13 16:57:12,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388326117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:12,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:12,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 16:57:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996931996] [2022-12-13 16:57:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:57:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:12,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:57:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:57:12,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 220 [2022-12-13 16:57:12,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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 16:57:12,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:12,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 220 [2022-12-13 16:57:12,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:13,119 INFO L130 PetriNetUnfolder]: 1527/2331 cut-off events. [2022-12-13 16:57:13,120 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 16:57:13,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4618 conditions, 2331 events. 1527/2331 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 11581 event pairs, 425 based on Foata normal form. 96/2234 useless extension candidates. Maximal degree in co-relation 4607. Up to 1813 conditions per place. [2022-12-13 16:57:13,135 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 35 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2022-12-13 16:57:13,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2022-12-13 16:57:13,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:57:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 16:57:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-12-13 16:57:13,148 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.543939393939394 [2022-12-13 16:57:13,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-12-13 16:57:13,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-12-13 16:57:13,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:13,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-12-13 16:57:13,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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 16:57:13,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,165 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 359 transitions. [2022-12-13 16:57:13,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2022-12-13 16:57:13,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 16:57:13,170 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-12-13 16:57:13,172 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-12-13 16:57:13,175 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-13 16:57:13,175 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-12-13 16:57:13,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 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 16:57:13,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:13,176 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:13,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:57:13,176 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 16:57:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash 897335305, now seen corresponding path program 1 times [2022-12-13 16:57:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:13,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426856720] [2022-12-13 16:57:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:13,393 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 16:57:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:13,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426856720] [2022-12-13 16:57:13,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426856720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:13,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:13,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:57:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770949571] [2022-12-13 16:57:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:13,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:13,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:13,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:13,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 220 [2022-12-13 16:57:13,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:13,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 220 [2022-12-13 16:57:13,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:13,944 INFO L130 PetriNetUnfolder]: 2935/4398 cut-off events. [2022-12-13 16:57:13,944 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-13 16:57:13,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9152 conditions, 4398 events. 2935/4398 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 22320 event pairs, 843 based on Foata normal form. 234/4632 useless extension candidates. Maximal degree in co-relation 9142. Up to 2511 conditions per place. [2022-12-13 16:57:13,956 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 37 selfloop transitions, 6 changer transitions 27/70 dead transitions. [2022-12-13 16:57:13,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 70 transitions, 300 flow [2022-12-13 16:57:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2022-12-13 16:57:13,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5063636363636363 [2022-12-13 16:57:13,960 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2022-12-13 16:57:13,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2022-12-13 16:57:13,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:13,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2022-12-13 16:57:13,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 16:57:13,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,967 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,967 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 557 transitions. [2022-12-13 16:57:13,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 70 transitions, 300 flow [2022-12-13 16:57:13,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 70 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:13,969 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 112 flow [2022-12-13 16:57:13,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-13 16:57:13,970 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 16:57:13,970 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 112 flow [2022-12-13 16:57:13,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:13,970 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:13,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:13,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:57:13,971 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 16:57:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2047565051, now seen corresponding path program 1 times [2022-12-13 16:57:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:13,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067960566] [2022-12-13 16:57:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:14,107 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 16:57:14,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:14,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067960566] [2022-12-13 16:57:14,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067960566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:14,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:14,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:57:14,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936764545] [2022-12-13 16:57:14,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:14,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:14,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:14,117 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 220 [2022-12-13 16:57:14,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 16:57:14,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:14,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 220 [2022-12-13 16:57:14,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:14,579 INFO L130 PetriNetUnfolder]: 2152/3359 cut-off events. [2022-12-13 16:57:14,579 INFO L131 PetriNetUnfolder]: For 1725/1754 co-relation queries the response was YES. [2022-12-13 16:57:14,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8430 conditions, 3359 events. 2152/3359 cut-off events. For 1725/1754 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17626 event pairs, 651 based on Foata normal form. 216/3549 useless extension candidates. Maximal degree in co-relation 8416. Up to 2111 conditions per place. [2022-12-13 16:57:14,599 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 29 selfloop transitions, 3 changer transitions 21/57 dead transitions. [2022-12-13 16:57:14,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 302 flow [2022-12-13 16:57:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2022-12-13 16:57:14,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5127272727272727 [2022-12-13 16:57:14,600 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2022-12-13 16:57:14,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2022-12-13 16:57:14,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:14,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2022-12-13 16:57:14,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 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 16:57:14,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:14,603 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:14,603 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 112 flow. Second operand 5 states and 564 transitions. [2022-12-13 16:57:14,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 302 flow [2022-12-13 16:57:14,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 278 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:14,609 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 111 flow [2022-12-13 16:57:14,609 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 16:57:14,609 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 16:57:14,609 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 111 flow [2022-12-13 16:57:14,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 16:57:14,610 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:14,610 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:14,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:57:14,610 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 16:57:14,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:14,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1861327218, now seen corresponding path program 1 times [2022-12-13 16:57:14,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:14,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749719426] [2022-12-13 16:57:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:14,743 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 16:57:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:14,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749719426] [2022-12-13 16:57:14,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749719426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:14,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:14,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:57:14,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159639523] [2022-12-13 16:57:14,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:14,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:14,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:14,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:14,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:14,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2022-12-13 16:57:14,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 16:57:14,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:14,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2022-12-13 16:57:14,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:15,108 INFO L130 PetriNetUnfolder]: 1248/2078 cut-off events. [2022-12-13 16:57:15,108 INFO L131 PetriNetUnfolder]: For 1131/1131 co-relation queries the response was YES. [2022-12-13 16:57:15,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5284 conditions, 2078 events. 1248/2078 cut-off events. For 1131/1131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11146 event pairs, 221 based on Foata normal form. 199/2259 useless extension candidates. Maximal degree in co-relation 5267. Up to 1221 conditions per place. [2022-12-13 16:57:15,116 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 58 selfloop transitions, 7 changer transitions 6/75 dead transitions. [2022-12-13 16:57:15,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 417 flow [2022-12-13 16:57:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-12-13 16:57:15,119 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5009090909090909 [2022-12-13 16:57:15,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-12-13 16:57:15,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-12-13 16:57:15,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:15,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-12-13 16:57:15,122 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 16:57:15,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:15,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:15,125 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 111 flow. Second operand 5 states and 551 transitions. [2022-12-13 16:57:15,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 417 flow [2022-12-13 16:57:15,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 75 transitions, 393 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 16:57:15,131 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 153 flow [2022-12-13 16:57:15,131 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 16:57:15,132 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-13 16:57:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 153 flow [2022-12-13 16:57:15,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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 16:57:15,132 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:15,132 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:15,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:57:15,133 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 16:57:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -524399303, now seen corresponding path program 1 times [2022-12-13 16:57:15,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:15,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742334859] [2022-12-13 16:57:15,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:15,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:15,275 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 16:57:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742334859] [2022-12-13 16:57:15,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742334859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:15,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:15,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:57:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69328089] [2022-12-13 16:57:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:15,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:15,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2022-12-13 16:57:15,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 16:57:15,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:15,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2022-12-13 16:57:15,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:15,591 INFO L130 PetriNetUnfolder]: 850/1484 cut-off events. [2022-12-13 16:57:15,591 INFO L131 PetriNetUnfolder]: For 1077/1077 co-relation queries the response was YES. [2022-12-13 16:57:15,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 1484 events. 850/1484 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7956 event pairs, 125 based on Foata normal form. 107/1573 useless extension candidates. Maximal degree in co-relation 4553. Up to 473 conditions per place. [2022-12-13 16:57:15,597 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 70 selfloop transitions, 13 changer transitions 18/105 dead transitions. [2022-12-13 16:57:15,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 105 transitions, 631 flow [2022-12-13 16:57:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:57:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:57:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions. [2022-12-13 16:57:15,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5006493506493507 [2022-12-13 16:57:15,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 771 transitions. [2022-12-13 16:57:15,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 771 transitions. [2022-12-13 16:57:15,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:15,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 771 transitions. [2022-12-13 16:57:15,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 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 16:57:15,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:15,607 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:15,607 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 153 flow. Second operand 7 states and 771 transitions. [2022-12-13 16:57:15,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 105 transitions, 631 flow [2022-12-13 16:57:15,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 105 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 16:57:15,613 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 237 flow [2022-12-13 16:57:15,613 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 16:57:15,614 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 16:57:15,614 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 237 flow [2022-12-13 16:57:15,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 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 16:57:15,614 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:15,614 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:15,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:57:15,615 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 16:57:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1708962280, now seen corresponding path program 1 times [2022-12-13 16:57:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:15,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951138755] [2022-12-13 16:57:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:16,078 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 16:57:16,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:16,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951138755] [2022-12-13 16:57:16,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951138755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:16,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:16,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:16,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029035134] [2022-12-13 16:57:16,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:16,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 16:57:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:16,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 16:57:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:57:16,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 220 [2022-12-13 16:57:16,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 16:57:16,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:16,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 220 [2022-12-13 16:57:16,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:16,662 INFO L130 PetriNetUnfolder]: 1297/2205 cut-off events. [2022-12-13 16:57:16,662 INFO L131 PetriNetUnfolder]: For 4022/4022 co-relation queries the response was YES. [2022-12-13 16:57:16,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 2205 events. 1297/2205 cut-off events. For 4022/4022 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11832 event pairs, 88 based on Foata normal form. 11/2216 useless extension candidates. Maximal degree in co-relation 7675. Up to 868 conditions per place. [2022-12-13 16:57:16,669 INFO L137 encePairwiseOnDemand]: 208/220 looper letters, 84 selfloop transitions, 30 changer transitions 50/164 dead transitions. [2022-12-13 16:57:16,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 164 transitions, 1225 flow [2022-12-13 16:57:16,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:57:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 16:57:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1045 transitions. [2022-12-13 16:57:16,672 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-13 16:57:16,672 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1045 transitions. [2022-12-13 16:57:16,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1045 transitions. [2022-12-13 16:57:16,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:16,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1045 transitions. [2022-12-13 16:57:16,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 104.5) internal successors, (1045), 10 states have internal predecessors, (1045), 0 states have call successors, (0), 0 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 16:57:16,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 220.0) internal successors, (2420), 11 states have internal predecessors, (2420), 0 states have call successors, (0), 0 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 16:57:16,676 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 220.0) internal successors, (2420), 11 states have internal predecessors, (2420), 0 states have call successors, (0), 0 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 16:57:16,676 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 237 flow. Second operand 10 states and 1045 transitions. [2022-12-13 16:57:16,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 164 transitions, 1225 flow [2022-12-13 16:57:16,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 164 transitions, 1112 flow, removed 38 selfloop flow, removed 2 redundant places. [2022-12-13 16:57:16,696 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 388 flow [2022-12-13 16:57:16,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=388, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2022-12-13 16:57:16,697 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2022-12-13 16:57:16,697 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 388 flow [2022-12-13 16:57:16,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 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 16:57:16,697 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:16,697 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:16,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:57:16,698 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 16:57:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2092202202, now seen corresponding path program 2 times [2022-12-13 16:57:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:16,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785595203] [2022-12-13 16:57:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:16,855 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 16:57:16,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:16,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785595203] [2022-12-13 16:57:16,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785595203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:16,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:16,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 16:57:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821992234] [2022-12-13 16:57:16,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:16,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 16:57:16,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 16:57:16,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 16:57:16,871 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 220 [2022-12-13 16:57:16,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 16:57:16,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:16,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 220 [2022-12-13 16:57:16,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:17,092 INFO L130 PetriNetUnfolder]: 428/782 cut-off events. [2022-12-13 16:57:17,092 INFO L131 PetriNetUnfolder]: For 1559/1615 co-relation queries the response was YES. [2022-12-13 16:57:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2995 conditions, 782 events. 428/782 cut-off events. For 1559/1615 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3754 event pairs, 82 based on Foata normal form. 63/826 useless extension candidates. Maximal degree in co-relation 2970. Up to 301 conditions per place. [2022-12-13 16:57:17,096 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 77 selfloop transitions, 11 changer transitions 20/116 dead transitions. [2022-12-13 16:57:17,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 915 flow [2022-12-13 16:57:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:57:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 16:57:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2022-12-13 16:57:17,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4863636363636364 [2022-12-13 16:57:17,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 749 transitions. [2022-12-13 16:57:17,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 749 transitions. [2022-12-13 16:57:17,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:17,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 749 transitions. [2022-12-13 16:57:17,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 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 16:57:17,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,104 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,104 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 388 flow. Second operand 7 states and 749 transitions. [2022-12-13 16:57:17,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 915 flow [2022-12-13 16:57:17,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 116 transitions, 851 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-13 16:57:17,112 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 381 flow [2022-12-13 16:57:17,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2022-12-13 16:57:17,113 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2022-12-13 16:57:17,113 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 381 flow [2022-12-13 16:57:17,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 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 16:57:17,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:17,114 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:17,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:57:17,114 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 16:57:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:17,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1047444159, now seen corresponding path program 1 times [2022-12-13 16:57:17,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:17,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273464031] [2022-12-13 16:57:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:17,272 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 16:57:17,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273464031] [2022-12-13 16:57:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273464031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:17,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:17,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:57:17,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781516530] [2022-12-13 16:57:17,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:17,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:57:17,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:17,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:57:17,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:57:17,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220 [2022-12-13 16:57:17,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 381 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:17,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220 [2022-12-13 16:57:17,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:17,566 INFO L130 PetriNetUnfolder]: 648/1210 cut-off events. [2022-12-13 16:57:17,566 INFO L131 PetriNetUnfolder]: For 2502/2515 co-relation queries the response was YES. [2022-12-13 16:57:17,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4942 conditions, 1210 events. 648/1210 cut-off events. For 2502/2515 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6344 event pairs, 134 based on Foata normal form. 11/1212 useless extension candidates. Maximal degree in co-relation 4913. Up to 558 conditions per place. [2022-12-13 16:57:17,571 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 50 selfloop transitions, 1 changer transitions 63/116 dead transitions. [2022-12-13 16:57:17,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 983 flow [2022-12-13 16:57:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:57:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 16:57:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2022-12-13 16:57:17,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5036363636363637 [2022-12-13 16:57:17,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2022-12-13 16:57:17,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2022-12-13 16:57:17,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:17,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2022-12-13 16:57:17,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 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 16:57:17,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,575 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 381 flow. Second operand 5 states and 554 transitions. [2022-12-13 16:57:17,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 983 flow [2022-12-13 16:57:17,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 116 transitions, 878 flow, removed 32 selfloop flow, removed 7 redundant places. [2022-12-13 16:57:17,583 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 270 flow [2022-12-13 16:57:17,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2022-12-13 16:57:17,583 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 16:57:17,583 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 270 flow [2022-12-13 16:57:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:17,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:17,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:57:17,584 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 16:57:17,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1635448305, now seen corresponding path program 2 times [2022-12-13 16:57:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610765887] [2022-12-13 16:57:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:17,691 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 16:57:17,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:17,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610765887] [2022-12-13 16:57:17,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610765887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:17,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:17,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:57:17,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186337075] [2022-12-13 16:57:17,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:17,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:57:17,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:57:17,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:57:17,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 220 [2022-12-13 16:57:17,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 270 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 16:57:17,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:17,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 220 [2022-12-13 16:57:17,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:17,829 INFO L130 PetriNetUnfolder]: 288/558 cut-off events. [2022-12-13 16:57:17,829 INFO L131 PetriNetUnfolder]: For 872/878 co-relation queries the response was YES. [2022-12-13 16:57:17,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 558 events. 288/558 cut-off events. For 872/878 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2425 event pairs, 105 based on Foata normal form. 7/561 useless extension candidates. Maximal degree in co-relation 2099. Up to 293 conditions per place. [2022-12-13 16:57:17,831 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 38 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2022-12-13 16:57:17,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 516 flow [2022-12-13 16:57:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:57:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 16:57:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2022-12-13 16:57:17,832 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2022-12-13 16:57:17,832 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 445 transitions. [2022-12-13 16:57:17,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 445 transitions. [2022-12-13 16:57:17,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:17,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 445 transitions. [2022-12-13 16:57:17,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 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 16:57:17,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:17,834 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 270 flow. Second operand 4 states and 445 transitions. [2022-12-13 16:57:17,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 516 flow [2022-12-13 16:57:17,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 467 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-13 16:57:17,837 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 201 flow [2022-12-13 16:57:17,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2022-12-13 16:57:17,837 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-12-13 16:57:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 201 flow [2022-12-13 16:57:17,838 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 16:57:17,838 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:17,838 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:17,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:57:17,838 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 16:57:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash -818093767, now seen corresponding path program 3 times [2022-12-13 16:57:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:17,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988211522] [2022-12-13 16:57:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:57:18,232 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 16:57:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:57:18,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988211522] [2022-12-13 16:57:18,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988211522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:57:18,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:57:18,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 16:57:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102881311] [2022-12-13 16:57:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:57:18,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:57:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:57:18,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:57:18,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:57:18,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 220 [2022-12-13 16:57:18,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 201 flow. Second operand has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 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 16:57:18,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 16:57:18,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 220 [2022-12-13 16:57:18,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 16:57:18,554 INFO L130 PetriNetUnfolder]: 137/269 cut-off events. [2022-12-13 16:57:18,554 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-12-13 16:57:18,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 269 events. 137/269 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 831 event pairs, 13 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 976. Up to 66 conditions per place. [2022-12-13 16:57:18,555 INFO L137 encePairwiseOnDemand]: 210/220 looper letters, 37 selfloop transitions, 7 changer transitions 41/85 dead transitions. [2022-12-13 16:57:18,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 596 flow [2022-12-13 16:57:18,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:57:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 16:57:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-12-13 16:57:18,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4505050505050505 [2022-12-13 16:57:18,558 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-12-13 16:57:18,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-12-13 16:57:18,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 16:57:18,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-12-13 16:57:18,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 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 16:57:18,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:18,563 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 220.0) internal successors, (2200), 10 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:57:18,563 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 201 flow. Second operand 9 states and 892 transitions. [2022-12-13 16:57:18,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 596 flow [2022-12-13 16:57:18,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 560 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-13 16:57:18,566 INFO L231 Difference]: Finished difference. Result has 61 places, 33 transitions, 192 flow [2022-12-13 16:57:18,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=61, PETRI_TRANSITIONS=33} [2022-12-13 16:57:18,567 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2022-12-13 16:57:18,567 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 33 transitions, 192 flow [2022-12-13 16:57:18,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 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 16:57:18,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 16:57:18,568 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:57:18,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:57:18,568 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 16:57:18,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:57:18,569 INFO L85 PathProgramCache]: Analyzing trace with hash 661076363, now seen corresponding path program 4 times [2022-12-13 16:57:18,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:57:18,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793825127] [2022-12-13 16:57:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:57:18,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:57:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:57:18,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:57:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:57:18,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:57:18,671 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:57:18,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 16:57:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 16:57:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 16:57:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 16:57:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 16:57:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 16:57:18,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:57:18,676 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-12-13 16:57:18,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 16:57:18,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:57:18,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:57:18 BasicIcfg [2022-12-13 16:57:18,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:57:18,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:57:18,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:57:18,739 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:57:18,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:57:09" (3/4) ... [2022-12-13 16:57:18,741 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 16:57:18,809 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 16:57:18,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:57:18,810 INFO L158 Benchmark]: Toolchain (without parser) took 9931.00ms. Allocated memory was 130.0MB in the beginning and 285.2MB in the end (delta: 155.2MB). Free memory was 92.4MB in the beginning and 215.1MB in the end (delta: -122.7MB). Peak memory consumption was 200.4MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,810 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:57:18,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.23ms. Allocated memory is still 130.0MB. Free memory was 92.4MB in the beginning and 65.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 130.0MB. Free memory was 65.6MB in the beginning and 63.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,811 INFO L158 Benchmark]: Boogie Preprocessor took 21.09ms. Allocated memory is still 130.0MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,811 INFO L158 Benchmark]: RCFGBuilder took 522.02ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 61.1MB in the beginning and 115.2MB in the end (delta: -54.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,812 INFO L158 Benchmark]: TraceAbstraction took 8920.87ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 114.3MB in the beginning and 59.8MB in the end (delta: 54.5MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,812 INFO L158 Benchmark]: Witness Printer took 70.62ms. Allocated memory is still 285.2MB. Free memory was 59.8MB in the beginning and 215.1MB in the end (delta: -155.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 16:57:18,814 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 130.0MB. Free memory is still 100.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.23ms. Allocated memory is still 130.0MB. Free memory was 92.4MB in the beginning and 65.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 130.0MB. Free memory was 65.6MB in the beginning and 63.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.09ms. Allocated memory is still 130.0MB. Free memory was 63.2MB in the beginning and 61.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.02ms. Allocated memory was 130.0MB in the beginning and 163.6MB in the end (delta: 33.6MB). Free memory was 61.1MB in the beginning and 115.2MB in the end (delta: -54.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8920.87ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 114.3MB in the beginning and 59.8MB in the end (delta: 54.5MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Witness Printer took 70.62ms. Allocated memory is still 285.2MB. Free memory was 59.8MB in the beginning and 215.1MB in the end (delta: -155.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 124 PlacesBefore, 36 PlacesAfterwards, 116 TransitionsBefore, 27 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 6271 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2698, independent: 2492, independent conditional: 0, independent unconditional: 2492, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1174, independent conditional: 0, independent unconditional: 1174, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2698, independent: 1318, independent conditional: 0, independent unconditional: 1318, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1105, ((void *)0), P0, ((void *)0))=-3, t1105={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1106, ((void *)0), P1, ((void *)0))=-2, t1105={5:0}, t1106={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t1107, ((void *)0), P2, ((void *)0))=-1, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L776] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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=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_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=2, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 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) [L810] 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)) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=255, x=1, y=2, z=1] [L821] 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) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 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 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 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=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=255, x=1, y=2, z=1] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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=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=255, x=1, y=2, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 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 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 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=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, t1105={5:0}, t1106={6:0}, t1107={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=255, x=1, y=2, 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: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 338 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1498 IncrementalHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 32 mSDtfsCounter, 1498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=6, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 978 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 16:57:18,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ae75b77-68e5-471b-816a-cb0710edc779/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