./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/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_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/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_3ff4fdcd-fe5c-4622-969f-da1628762c19/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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:10:31,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:10:31,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:10:31,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:10:31,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:10:31,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:10:31,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:10:31,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:10:31,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:10:31,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:10:31,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:10:31,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:10:31,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:10:31,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:10:31,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:10:31,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:10:31,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:10:31,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:10:31,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:10:31,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:10:31,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:10:31,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:10:31,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:10:31,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:10:31,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:10:31,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:10:31,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:10:31,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:10:31,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:10:31,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:10:31,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:10:31,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:10:31,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:10:31,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:10:31,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:10:31,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:10:31,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:10:31,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:10:31,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:10:31,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:10:31,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:10:31,747 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:10:31,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:10:31,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:10:31,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:10:31,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:10:31,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:10:31,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:10:31,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:10:31,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:10:31,763 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:10:31,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:10:31,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:10:31,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:10:31,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:10:31,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:10:31,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:10:31,767 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:10:31,767 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_3ff4fdcd-fe5c-4622-969f-da1628762c19/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_3ff4fdcd-fe5c-4622-969f-da1628762c19/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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2022-12-13 13:10:31,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:10:31,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:10:31,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:10:31,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:10:31,951 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:10:31,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2022-12-13 13:10:34,485 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:10:34,698 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:10:34,698 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2022-12-13 13:10:34,711 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/data/2dcfc6d4a/bcfe5171e62e477695808be65cb9676e/FLAGdd58c9802 [2022-12-13 13:10:35,043 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/data/2dcfc6d4a/bcfe5171e62e477695808be65cb9676e [2022-12-13 13:10:35,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:10:35,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:10:35,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:10:35,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:10:35,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:10:35,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19aac0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35, skipping insertion in model container [2022-12-13 13:10:35,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:10:35,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:10:35,217 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_3ff4fdcd-fe5c-4622-969f-da1628762c19/sv-benchmarks/c/pthread-wmm/mix039.opt.i[944,957] [2022-12-13 13:10:35,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:10:35,386 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:10:35,395 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_3ff4fdcd-fe5c-4622-969f-da1628762c19/sv-benchmarks/c/pthread-wmm/mix039.opt.i[944,957] [2022-12-13 13:10:35,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:10:35,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:10:35,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:10:35,473 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:10:35,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35 WrapperNode [2022-12-13 13:10:35,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:10:35,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:10:35,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:10:35,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:10:35,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,519 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-12-13 13:10:35,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:10:35,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:10:35,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:10:35,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:10:35,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,544 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:10:35,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:10:35,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:10:35,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:10:35,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (1/1) ... [2022-12-13 13:10:35,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:10:35,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:10:35,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:10:35,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:10:35,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:10:35,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:10:35,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:10:35,615 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:10:35,615 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:10:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 13:10:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 13:10:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:10:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:10:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:10:35,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:10:35,617 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:10:35,730 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:10:35,732 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:10:35,995 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:10:36,091 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:10:36,092 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:10:36,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:10:36 BoogieIcfgContainer [2022-12-13 13:10:36,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:10:36,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:10:36,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:10:36,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:10:36,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:10:35" (1/3) ... [2022-12-13 13:10:36,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3694f14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:10:36, skipping insertion in model container [2022-12-13 13:10:36,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:10:35" (2/3) ... [2022-12-13 13:10:36,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3694f14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:10:36, skipping insertion in model container [2022-12-13 13:10:36,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:10:36" (3/3) ... [2022-12-13 13:10:36,102 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2022-12-13 13:10:36,111 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:10:36,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:10:36,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:10:36,122 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:10:36,162 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:10:36,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:10:36,227 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:10:36,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:10:36,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:10:36,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:10:36,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-12-13 13:10:36,238 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:10:36,245 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:10:36,247 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:10:36,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-12-13 13:10:36,269 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:10:36,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:10:36,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:10:36,271 INFO L119 LiptonReduction]: Number of co-enabled transitions 3040 [2022-12-13 13:10:39,444 INFO L134 LiptonReduction]: Checked pairs total: 6771 [2022-12-13 13:10:39,444 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-12-13 13:10:39,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:10:39,458 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;@c75ee3e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:10:39,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 13:10:39,462 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-13 13:10:39,462 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:10:39,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:39,463 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:39,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:39,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1537044639, now seen corresponding path program 1 times [2022-12-13 13:10:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:39,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797246979] [2022-12-13 13:10:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797246979] [2022-12-13 13:10:39,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797246979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:39,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:39,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:10:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277423503] [2022-12-13 13:10:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:10:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:39,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:10:39,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:10:39,857 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2022-12-13 13:10:39,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:39,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:39,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2022-12-13 13:10:39,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:40,256 INFO L130 PetriNetUnfolder]: 2594/3776 cut-off events. [2022-12-13 13:10:40,256 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-13 13:10:40,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7471 conditions, 3776 events. 2594/3776 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19539 event pairs, 518 based on Foata normal form. 0/3592 useless extension candidates. Maximal degree in co-relation 7459. Up to 2797 conditions per place. [2022-12-13 13:10:40,272 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2022-12-13 13:10:40,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2022-12-13 13:10:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:10:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:10:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2022-12-13 13:10:40,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5304798962386511 [2022-12-13 13:10:40,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2022-12-13 13:10:40,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2022-12-13 13:10:40,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:40,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2022-12-13 13:10:40,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,297 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 409 transitions. [2022-12-13 13:10:40,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2022-12-13 13:10:40,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:10:40,301 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2022-12-13 13:10:40,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-13 13:10:40,305 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 13:10:40,305 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2022-12-13 13:10:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:40,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:40,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:10:40,306 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 368937068, now seen corresponding path program 1 times [2022-12-13 13:10:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719969460] [2022-12-13 13:10:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:40,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719969460] [2022-12-13 13:10:40,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719969460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:40,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:40,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:10:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444805350] [2022-12-13 13:10:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:40,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:10:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:10:40,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:10:40,447 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 257 [2022-12-13 13:10:40,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:40,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 257 [2022-12-13 13:10:40,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:40,875 INFO L130 PetriNetUnfolder]: 2751/3828 cut-off events. [2022-12-13 13:10:40,876 INFO L131 PetriNetUnfolder]: For 180/180 co-relation queries the response was YES. [2022-12-13 13:10:40,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7954 conditions, 3828 events. 2751/3828 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18393 event pairs, 543 based on Foata normal form. 30/3848 useless extension candidates. Maximal degree in co-relation 7944. Up to 3508 conditions per place. [2022-12-13 13:10:40,891 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 35 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2022-12-13 13:10:40,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 174 flow [2022-12-13 13:10:40,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:10:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:10:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-12-13 13:10:40,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252918287937743 [2022-12-13 13:10:40,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-12-13 13:10:40,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-12-13 13:10:40,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:40,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-12-13 13:10:40,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,896 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 405 transitions. [2022-12-13 13:10:40,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 174 flow [2022-12-13 13:10:40,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:10:40,897 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2022-12-13 13:10:40,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-13 13:10:40,898 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 13:10:40,898 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2022-12-13 13:10:40,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:40,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:40,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:40,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:10:40,898 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1447854257, now seen corresponding path program 1 times [2022-12-13 13:10:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:40,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347626433] [2022-12-13 13:10:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:41,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:41,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347626433] [2022-12-13 13:10:41,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347626433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:41,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:41,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:10:41,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314188692] [2022-12-13 13:10:41,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:41,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:10:41,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:41,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:10:41,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:10:41,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2022-12-13 13:10:41,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:41,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2022-12-13 13:10:41,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:41,671 INFO L130 PetriNetUnfolder]: 5255/7280 cut-off events. [2022-12-13 13:10:41,671 INFO L131 PetriNetUnfolder]: For 961/961 co-relation queries the response was YES. [2022-12-13 13:10:41,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16031 conditions, 7280 events. 5255/7280 cut-off events. For 961/961 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 32722 event pairs, 1343 based on Foata normal form. 240/7520 useless extension candidates. Maximal degree in co-relation 16020. Up to 4113 conditions per place. [2022-12-13 13:10:41,696 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 44 selfloop transitions, 8 changer transitions 0/52 dead transitions. [2022-12-13 13:10:41,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 243 flow [2022-12-13 13:10:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:10:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:10:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2022-12-13 13:10:41,698 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4961089494163424 [2022-12-13 13:10:41,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2022-12-13 13:10:41,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2022-12-13 13:10:41,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:41,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2022-12-13 13:10:41,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,701 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,701 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 510 transitions. [2022-12-13 13:10:41,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 243 flow [2022-12-13 13:10:41,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:41,702 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 140 flow [2022-12-13 13:10:41,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-12-13 13:10:41,703 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2022-12-13 13:10:41,703 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 140 flow [2022-12-13 13:10:41,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:41,703 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:41,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:10:41,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:41,704 INFO L85 PathProgramCache]: Analyzing trace with hash 562927950, now seen corresponding path program 1 times [2022-12-13 13:10:41,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985168187] [2022-12-13 13:10:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:41,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985168187] [2022-12-13 13:10:41,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985168187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:41,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:41,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:10:41,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067642102] [2022-12-13 13:10:41,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:41,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:10:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:10:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:10:41,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 13:10:41,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:41,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:41,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 13:10:41,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:42,428 INFO L130 PetriNetUnfolder]: 3607/5352 cut-off events. [2022-12-13 13:10:42,428 INFO L131 PetriNetUnfolder]: For 3258/3394 co-relation queries the response was YES. [2022-12-13 13:10:42,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13428 conditions, 5352 events. 3607/5352 cut-off events. For 3258/3394 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 30007 event pairs, 779 based on Foata normal form. 426/5526 useless extension candidates. Maximal degree in co-relation 13413. Up to 3565 conditions per place. [2022-12-13 13:10:42,453 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 64 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-13 13:10:42,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 82 transitions, 458 flow [2022-12-13 13:10:42,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:10:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:10:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-12-13 13:10:42,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.51284046692607 [2022-12-13 13:10:42,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2022-12-13 13:10:42,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2022-12-13 13:10:42,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:42,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2022-12-13 13:10:42,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:42,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:42,459 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:42,460 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 140 flow. Second operand 5 states and 659 transitions. [2022-12-13 13:10:42,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 82 transitions, 458 flow [2022-12-13 13:10:42,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 445 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:42,464 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 211 flow [2022-12-13 13:10:42,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 13:10:42,464 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2022-12-13 13:10:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 211 flow [2022-12-13 13:10:42,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:42,465 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:42,465 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:42,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:10:42,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 332557398, now seen corresponding path program 1 times [2022-12-13 13:10:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959990903] [2022-12-13 13:10:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:42,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:42,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959990903] [2022-12-13 13:10:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959990903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:42,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:42,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:10:42,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192688799] [2022-12-13 13:10:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:42,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:10:42,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:10:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:10:42,604 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 257 [2022-12-13 13:10:42,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:42,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:42,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 257 [2022-12-13 13:10:42,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:43,293 INFO L130 PetriNetUnfolder]: 5167/7683 cut-off events. [2022-12-13 13:10:43,294 INFO L131 PetriNetUnfolder]: For 9127/9196 co-relation queries the response was YES. [2022-12-13 13:10:43,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26021 conditions, 7683 events. 5167/7683 cut-off events. For 9127/9196 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 44532 event pairs, 2251 based on Foata normal form. 98/7465 useless extension candidates. Maximal degree in co-relation 26002. Up to 3835 conditions per place. [2022-12-13 13:10:43,317 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 51 selfloop transitions, 5 changer transitions 6/66 dead transitions. [2022-12-13 13:10:43,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 446 flow [2022-12-13 13:10:43,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:10:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:10:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-12-13 13:10:43,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5265888456549935 [2022-12-13 13:10:43,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-12-13 13:10:43,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-12-13 13:10:43,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:43,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-12-13 13:10:43,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:43,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:43,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:43,321 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 211 flow. Second operand 3 states and 406 transitions. [2022-12-13 13:10:43,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 446 flow [2022-12-13 13:10:43,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:43,332 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 211 flow [2022-12-13 13:10:43,332 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 13:10:43,332 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-12-13 13:10:43,333 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 211 flow [2022-12-13 13:10:43,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:43,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:43,333 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:43,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:10:43,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -685127809, now seen corresponding path program 1 times [2022-12-13 13:10:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:43,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719612356] [2022-12-13 13:10:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:43,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719612356] [2022-12-13 13:10:43,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719612356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:43,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:43,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:10:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762734129] [2022-12-13 13:10:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:10:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:10:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:10:43,505 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 13:10:43,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:43,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:43,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 13:10:43,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:44,124 INFO L130 PetriNetUnfolder]: 3276/5115 cut-off events. [2022-12-13 13:10:44,124 INFO L131 PetriNetUnfolder]: For 5806/6191 co-relation queries the response was YES. [2022-12-13 13:10:44,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17300 conditions, 5115 events. 3276/5115 cut-off events. For 5806/6191 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 30864 event pairs, 376 based on Foata normal form. 549/5461 useless extension candidates. Maximal degree in co-relation 17280. Up to 2145 conditions per place. [2022-12-13 13:10:44,140 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 86 selfloop transitions, 18 changer transitions 2/113 dead transitions. [2022-12-13 13:10:44,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 113 transitions, 754 flow [2022-12-13 13:10:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:10:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:10:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2022-12-13 13:10:44,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5130628126737076 [2022-12-13 13:10:44,143 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2022-12-13 13:10:44,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2022-12-13 13:10:44,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:44,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2022-12-13 13:10:44,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,148 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,148 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 211 flow. Second operand 7 states and 923 transitions. [2022-12-13 13:10:44,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 113 transitions, 754 flow [2022-12-13 13:10:44,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 113 transitions, 727 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:44,158 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 335 flow [2022-12-13 13:10:44,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2022-12-13 13:10:44,159 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2022-12-13 13:10:44,159 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 335 flow [2022-12-13 13:10:44,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:44,160 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 13:10:44,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:10:44,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 510537512, now seen corresponding path program 1 times [2022-12-13 13:10:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:44,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806950897] [2022-12-13 13:10:44,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:44,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:44,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806950897] [2022-12-13 13:10:44,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806950897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:44,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:44,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:10:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864643530] [2022-12-13 13:10:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:44,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:10:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:44,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:10:44,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:10:44,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 13:10:44,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:44,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 13:10:44,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:44,866 INFO L130 PetriNetUnfolder]: 2943/4623 cut-off events. [2022-12-13 13:10:44,866 INFO L131 PetriNetUnfolder]: For 9422/9958 co-relation queries the response was YES. [2022-12-13 13:10:44,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18811 conditions, 4623 events. 2943/4623 cut-off events. For 9422/9958 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 27997 event pairs, 267 based on Foata normal form. 439/4871 useless extension candidates. Maximal degree in co-relation 18787. Up to 2005 conditions per place. [2022-12-13 13:10:44,883 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 94 selfloop transitions, 27 changer transitions 14/142 dead transitions. [2022-12-13 13:10:44,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 142 transitions, 1046 flow [2022-12-13 13:10:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:10:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:10:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions. [2022-12-13 13:10:44,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.512753999135322 [2022-12-13 13:10:44,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions. [2022-12-13 13:10:44,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions. [2022-12-13 13:10:44,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:44,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions. [2022-12-13 13:10:44,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.77777777777777) internal successors, (1186), 9 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,890 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:44,890 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 335 flow. Second operand 9 states and 1186 transitions. [2022-12-13 13:10:44,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 142 transitions, 1046 flow [2022-12-13 13:10:45,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 142 transitions, 997 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 13:10:45,057 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 462 flow [2022-12-13 13:10:45,057 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=462, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2022-12-13 13:10:45,058 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2022-12-13 13:10:45,058 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 462 flow [2022-12-13 13:10:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:45,058 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:45,058 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:45,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:10:45,058 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:45,059 INFO L85 PathProgramCache]: Analyzing trace with hash -476663275, now seen corresponding path program 1 times [2022-12-13 13:10:45,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:45,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202427916] [2022-12-13 13:10:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:45,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:45,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202427916] [2022-12-13 13:10:45,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202427916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:45,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:45,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:10:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984862347] [2022-12-13 13:10:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:45,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:10:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:10:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:10:45,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-12-13 13:10:45,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 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 13:10:45,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:45,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-12-13 13:10:45,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:45,892 INFO L130 PetriNetUnfolder]: 4436/7127 cut-off events. [2022-12-13 13:10:45,892 INFO L131 PetriNetUnfolder]: For 23691/23793 co-relation queries the response was YES. [2022-12-13 13:10:45,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29852 conditions, 7127 events. 4436/7127 cut-off events. For 23691/23793 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 46741 event pairs, 959 based on Foata normal form. 33/6970 useless extension candidates. Maximal degree in co-relation 29825. Up to 3777 conditions per place. [2022-12-13 13:10:45,911 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 67 selfloop transitions, 2 changer transitions 62/136 dead transitions. [2022-12-13 13:10:45,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 136 transitions, 1369 flow [2022-12-13 13:10:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:10:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:10:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2022-12-13 13:10:45,913 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252918287937743 [2022-12-13 13:10:45,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2022-12-13 13:10:45,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2022-12-13 13:10:45,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:45,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2022-12-13 13:10:45,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:45,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:45,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:45,918 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 462 flow. Second operand 4 states and 540 transitions. [2022-12-13 13:10:45,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 136 transitions, 1369 flow [2022-12-13 13:10:46,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 1108 flow, removed 94 selfloop flow, removed 4 redundant places. [2022-12-13 13:10:46,333 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 318 flow [2022-12-13 13:10:46,334 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2022-12-13 13:10:46,334 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2022-12-13 13:10:46,334 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 318 flow [2022-12-13 13:10:46,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 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 13:10:46,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:46,335 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:46,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:10:46,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1804212683, now seen corresponding path program 2 times [2022-12-13 13:10:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:46,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221812654] [2022-12-13 13:10:46,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:46,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:46,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:46,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221812654] [2022-12-13 13:10:46,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221812654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:46,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:10:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802757502] [2022-12-13 13:10:46,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:46,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:10:46,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:10:46,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:10:46,540 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 13:10:46,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:46,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:46,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 13:10:46,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:47,198 INFO L130 PetriNetUnfolder]: 2778/4610 cut-off events. [2022-12-13 13:10:47,198 INFO L131 PetriNetUnfolder]: For 7829/8103 co-relation queries the response was YES. [2022-12-13 13:10:47,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16263 conditions, 4610 events. 2778/4610 cut-off events. For 7829/8103 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 30352 event pairs, 303 based on Foata normal form. 235/4611 useless extension candidates. Maximal degree in co-relation 16234. Up to 963 conditions per place. [2022-12-13 13:10:47,208 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 62 selfloop transitions, 22 changer transitions 46/135 dead transitions. [2022-12-13 13:10:47,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 135 transitions, 966 flow [2022-12-13 13:10:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:10:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:10:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1417 transitions. [2022-12-13 13:10:47,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5012380615493456 [2022-12-13 13:10:47,210 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1417 transitions. [2022-12-13 13:10:47,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1417 transitions. [2022-12-13 13:10:47,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:47,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1417 transitions. [2022-12-13 13:10:47,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.8181818181818) internal successors, (1417), 11 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:47,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:47,215 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:47,215 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 318 flow. Second operand 11 states and 1417 transitions. [2022-12-13 13:10:47,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 135 transitions, 966 flow [2022-12-13 13:10:47,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 943 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 13:10:47,303 INFO L231 Difference]: Finished difference. Result has 76 places, 46 transitions, 337 flow [2022-12-13 13:10:47,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=337, PETRI_PLACES=76, PETRI_TRANSITIONS=46} [2022-12-13 13:10:47,303 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2022-12-13 13:10:47,303 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 46 transitions, 337 flow [2022-12-13 13:10:47,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:47,303 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:47,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:47,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:10:47,304 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:47,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -50908134, now seen corresponding path program 1 times [2022-12-13 13:10:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:47,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806664378] [2022-12-13 13:10:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806664378] [2022-12-13 13:10:47,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806664378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:47,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:47,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:10:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525821655] [2022-12-13 13:10:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:47,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:10:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:10:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:10:48,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 257 [2022-12-13 13:10:48,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 46 transitions, 337 flow. Second operand has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:48,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 257 [2022-12-13 13:10:48,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:48,639 INFO L130 PetriNetUnfolder]: 2808/4486 cut-off events. [2022-12-13 13:10:48,640 INFO L131 PetriNetUnfolder]: For 10130/10130 co-relation queries the response was YES. [2022-12-13 13:10:48,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17053 conditions, 4486 events. 2808/4486 cut-off events. For 10130/10130 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25673 event pairs, 246 based on Foata normal form. 1/4487 useless extension candidates. Maximal degree in co-relation 17027. Up to 2178 conditions per place. [2022-12-13 13:10:48,650 INFO L137 encePairwiseOnDemand]: 246/257 looper letters, 96 selfloop transitions, 32 changer transitions 103/231 dead transitions. [2022-12-13 13:10:48,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 231 transitions, 2063 flow [2022-12-13 13:10:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:10:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 13:10:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1451 transitions. [2022-12-13 13:10:48,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4704928664072633 [2022-12-13 13:10:48,654 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1451 transitions. [2022-12-13 13:10:48,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1451 transitions. [2022-12-13 13:10:48,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:48,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1451 transitions. [2022-12-13 13:10:48,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 120.91666666666667) internal successors, (1451), 12 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 257.0) internal successors, (3341), 13 states have internal predecessors, (3341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,662 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 257.0) internal successors, (3341), 13 states have internal predecessors, (3341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,663 INFO L175 Difference]: Start difference. First operand has 76 places, 46 transitions, 337 flow. Second operand 12 states and 1451 transitions. [2022-12-13 13:10:48,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 231 transitions, 2063 flow [2022-12-13 13:10:48,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 231 transitions, 1694 flow, removed 51 selfloop flow, removed 13 redundant places. [2022-12-13 13:10:48,722 INFO L231 Difference]: Finished difference. Result has 77 places, 71 transitions, 491 flow [2022-12-13 13:10:48,722 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=491, PETRI_PLACES=77, PETRI_TRANSITIONS=71} [2022-12-13 13:10:48,722 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-12-13 13:10:48,722 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 71 transitions, 491 flow [2022-12-13 13:10:48,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:48,722 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:48,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:10:48,723 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1587596782, now seen corresponding path program 2 times [2022-12-13 13:10:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:48,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429275010] [2022-12-13 13:10:48,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:48,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429275010] [2022-12-13 13:10:48,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429275010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:48,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:48,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:10:48,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923678921] [2022-12-13 13:10:48,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:48,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:10:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:10:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:10:48,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 13:10:48,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 71 transitions, 491 flow. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:48,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:48,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 13:10:48,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:49,116 INFO L130 PetriNetUnfolder]: 702/1196 cut-off events. [2022-12-13 13:10:49,116 INFO L131 PetriNetUnfolder]: For 3169/3169 co-relation queries the response was YES. [2022-12-13 13:10:49,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5038 conditions, 1196 events. 702/1196 cut-off events. For 3169/3169 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5462 event pairs, 110 based on Foata normal form. 1/1197 useless extension candidates. Maximal degree in co-relation 5008. Up to 589 conditions per place. [2022-12-13 13:10:49,119 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 72 selfloop transitions, 31 changer transitions 29/132 dead transitions. [2022-12-13 13:10:49,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1103 flow [2022-12-13 13:10:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:10:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:10:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2022-12-13 13:10:49,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49494163424124515 [2022-12-13 13:10:49,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2022-12-13 13:10:49,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2022-12-13 13:10:49,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:49,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2022-12-13 13:10:49,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,123 INFO L175 Difference]: Start difference. First operand has 77 places, 71 transitions, 491 flow. Second operand 5 states and 636 transitions. [2022-12-13 13:10:49,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1103 flow [2022-12-13 13:10:49,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 1055 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-13 13:10:49,132 INFO L231 Difference]: Finished difference. Result has 72 places, 78 transitions, 642 flow [2022-12-13 13:10:49,133 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=642, PETRI_PLACES=72, PETRI_TRANSITIONS=78} [2022-12-13 13:10:49,133 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2022-12-13 13:10:49,133 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 78 transitions, 642 flow [2022-12-13 13:10:49,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:49,133 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:49,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:10:49,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1395066922, now seen corresponding path program 3 times [2022-12-13 13:10:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:49,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620676966] [2022-12-13 13:10:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:49,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:49,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620676966] [2022-12-13 13:10:49,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620676966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:49,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:49,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:10:49,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172221627] [2022-12-13 13:10:49,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:49,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:10:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:10:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:10:49,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 13:10:49,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 78 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:49,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 13:10:49,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:49,483 INFO L130 PetriNetUnfolder]: 718/1254 cut-off events. [2022-12-13 13:10:49,483 INFO L131 PetriNetUnfolder]: For 4681/4681 co-relation queries the response was YES. [2022-12-13 13:10:49,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5821 conditions, 1254 events. 718/1254 cut-off events. For 4681/4681 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5944 event pairs, 79 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 5791. Up to 650 conditions per place. [2022-12-13 13:10:49,487 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 44 selfloop transitions, 5 changer transitions 84/133 dead transitions. [2022-12-13 13:10:49,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 133 transitions, 1239 flow [2022-12-13 13:10:49,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:10:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:10:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2022-12-13 13:10:49,489 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48378728923476005 [2022-12-13 13:10:49,489 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2022-12-13 13:10:49,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2022-12-13 13:10:49,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:49,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2022-12-13 13:10:49,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,491 INFO L175 Difference]: Start difference. First operand has 72 places, 78 transitions, 642 flow. Second operand 6 states and 746 transitions. [2022-12-13 13:10:49,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 133 transitions, 1239 flow [2022-12-13 13:10:49,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 133 transitions, 1231 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:10:49,505 INFO L231 Difference]: Finished difference. Result has 77 places, 37 transitions, 238 flow [2022-12-13 13:10:49,505 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=77, PETRI_TRANSITIONS=37} [2022-12-13 13:10:49,506 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-12-13 13:10:49,506 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 37 transitions, 238 flow [2022-12-13 13:10:49,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:49,506 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:49,506 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:49,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:10:49,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -54564298, now seen corresponding path program 4 times [2022-12-13 13:10:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:49,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291057955] [2022-12-13 13:10:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:10:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:10:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:10:50,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291057955] [2022-12-13 13:10:50,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291057955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:10:50,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:10:50,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:10:50,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695702905] [2022-12-13 13:10:50,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:10:50,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:10:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:10:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:10:50,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:10:50,050 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-12-13 13:10:50,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 37 transitions, 238 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:50,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:10:50,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-12-13 13:10:50,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:10:50,206 INFO L130 PetriNetUnfolder]: 152/314 cut-off events. [2022-12-13 13:10:50,206 INFO L131 PetriNetUnfolder]: For 1338/1338 co-relation queries the response was YES. [2022-12-13 13:10:50,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 314 events. 152/314 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1204 event pairs, 20 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 1396. Up to 121 conditions per place. [2022-12-13 13:10:50,207 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 36 selfloop transitions, 2 changer transitions 33/74 dead transitions. [2022-12-13 13:10:50,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 74 transitions, 605 flow [2022-12-13 13:10:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:10:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:10:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2022-12-13 13:10:50,209 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4773022049286641 [2022-12-13 13:10:50,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2022-12-13 13:10:50,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2022-12-13 13:10:50,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:10:50,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2022-12-13 13:10:50,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:50,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:50,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:50,214 INFO L175 Difference]: Start difference. First operand has 77 places, 37 transitions, 238 flow. Second operand 6 states and 736 transitions. [2022-12-13 13:10:50,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 74 transitions, 605 flow [2022-12-13 13:10:50,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 518 flow, removed 14 selfloop flow, removed 21 redundant places. [2022-12-13 13:10:50,218 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 187 flow [2022-12-13 13:10:50,218 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2022-12-13 13:10:50,219 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2022-12-13 13:10:50,219 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 187 flow [2022-12-13 13:10:50,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:10:50,220 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:10:50,220 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:50,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:10:50,220 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:10:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:10:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash 969558348, now seen corresponding path program 5 times [2022-12-13 13:10:50,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:10:50,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727526130] [2022-12-13 13:10:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:10:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:10:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:10:50,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:10:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:10:50,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:10:50,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:10:50,286 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 13:10:50,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 13:10:50,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 13:10:50,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 13:10:50,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 13:10:50,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 13:10:50,288 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 13:10:50,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:10:50,288 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:10:50,294 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:10:50,294 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:10:50,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:10:50 BasicIcfg [2022-12-13 13:10:50,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:10:50,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:10:50,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:10:50,338 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:10:50,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:10:36" (3/4) ... [2022-12-13 13:10:50,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:10:50,391 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:10:50,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:10:50,391 INFO L158 Benchmark]: Toolchain (without parser) took 15345.26ms. Allocated memory was 153.1MB in the beginning and 715.1MB in the end (delta: 562.0MB). Free memory was 123.0MB in the beginning and 437.6MB in the end (delta: -314.6MB). Peak memory consumption was 249.2MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,392 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:10:50,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.77ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 95.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.95ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 93.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,392 INFO L158 Benchmark]: Boogie Preprocessor took 28.68ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,392 INFO L158 Benchmark]: RCFGBuilder took 545.03ms. Allocated memory is still 153.1MB. Free memory was 91.4MB in the beginning and 104.4MB in the end (delta: -13.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,393 INFO L158 Benchmark]: TraceAbstraction took 14241.49ms. Allocated memory was 153.1MB in the beginning and 715.1MB in the end (delta: 562.0MB). Free memory was 103.3MB in the beginning and 452.3MB in the end (delta: -348.9MB). Peak memory consumption was 216.3MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,393 INFO L158 Benchmark]: Witness Printer took 52.64ms. Allocated memory is still 715.1MB. Free memory was 452.3MB in the beginning and 437.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 13:10:50,395 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.14ms. Allocated memory is still 104.9MB. Free memory is still 58.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.77ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 95.6MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.95ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 93.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.68ms. Allocated memory is still 153.1MB. Free memory was 93.4MB in the beginning and 91.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.03ms. Allocated memory is still 153.1MB. Free memory was 91.4MB in the beginning and 104.4MB in the end (delta: -13.0MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14241.49ms. Allocated memory was 153.1MB in the beginning and 715.1MB in the end (delta: 562.0MB). Free memory was 103.3MB in the beginning and 452.3MB in the end (delta: -348.9MB). Peak memory consumption was 216.3MB. Max. memory is 16.1GB. * Witness Printer took 52.64ms. Allocated memory is still 715.1MB. Free memory was 452.3MB in the beginning and 437.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 144 PlacesBefore, 40 PlacesAfterwards, 133 TransitionsBefore, 28 TransitionsAfterwards, 3040 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 6771 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3294, independent: 3099, independent conditional: 0, independent unconditional: 3099, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1682, independent: 1634, independent conditional: 0, independent unconditional: 1634, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3294, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1682, unknown conditional: 0, unknown unconditional: 1682] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1029, ((void *)0), P0, ((void *)0))=-2, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1030, ((void *)0), P1, ((void *)0))=-1, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1031, ((void *)0), P2, ((void *)0))=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1032, ((void *)0), P3, ((void *)0))=1, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 863]: 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: 859]: 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 9 procedures, 172 locations, 7 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: 14.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1602 IncrementalHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 74 mSDtfsCounter, 1602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=642occurred in iteration=11, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:10:50,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ff4fdcd-fe5c-4622-969f-da1628762c19/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