./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.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_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/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_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/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_ab42f956-356e-4551-8a47-c88d42c2dd7f/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 d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf --- 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 22:36:08,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:36:08,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:36:08,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:36:08,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:36:08,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:36:08,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:36:08,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:36:08,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:36:08,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:36:08,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:36:08,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:36:08,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:36:08,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:36:08,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:36:08,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:36:08,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:36:08,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:36:08,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:36:08,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:36:08,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:36:08,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:36:08,926 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:36:08,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:36:08,929 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:36:08,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:36:08,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:36:08,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:36:08,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:36:08,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:36:08,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:36:08,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:36:08,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:36:08,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:36:08,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:36:08,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:36:08,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:36:08,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:36:08,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:36:08,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:36:08,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:36:08,937 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:36:08,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:36:08,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:36:08,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:36:08,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:36:08,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:36:08,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:36:08,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:36:08,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:36:08,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:36:08,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:36:08,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:36:08,957 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:36:08,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:36:08,958 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:36:08,958 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:36:08,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:36:08,958 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:36:08,958 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_ab42f956-356e-4551-8a47-c88d42c2dd7f/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_ab42f956-356e-4551-8a47-c88d42c2dd7f/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 -> d52a8576f41904f21a1a217cd81ed2d36ac8928d5a02d745a0c93a101e2535cf [2022-12-13 22:36:09,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:36:09,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:36:09,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:36:09,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:36:09,152 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:36:09,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 22:36:11,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:36:11,912 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:36:11,912 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/sv-benchmarks/c/pthread-wmm/safe020_rmo.i [2022-12-13 22:36:11,922 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/data/09151c901/279267b1a1954d3db13850ca8669c97b/FLAGe2339269f [2022-12-13 22:36:11,934 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/data/09151c901/279267b1a1954d3db13850ca8669c97b [2022-12-13 22:36:11,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:36:11,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:36:11,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:36:11,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:36:11,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:36:11,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:36:11" (1/1) ... [2022-12-13 22:36:11,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d86afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:11, skipping insertion in model container [2022-12-13 22:36:11,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:36:11" (1/1) ... [2022-12-13 22:36:11,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:36:11,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:36:12,112 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_ab42f956-356e-4551-8a47-c88d42c2dd7f/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 22:36:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:36:12,258 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:36:12,267 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_ab42f956-356e-4551-8a47-c88d42c2dd7f/sv-benchmarks/c/pthread-wmm/safe020_rmo.i[988,1001] [2022-12-13 22:36:12,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 22:36:12,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 22:36:12,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:36:12,329 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:36:12,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12 WrapperNode [2022-12-13 22:36:12,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:36:12,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:36:12,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:36:12,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:36:12,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,363 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2022-12-13 22:36:12,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:36:12,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:36:12,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:36:12,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:36:12,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,384 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:36:12,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:36:12,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:36:12,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:36:12,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (1/1) ... [2022-12-13 22:36:12,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:36:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:36:12,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:36:12,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:36:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 22:36:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 22:36:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 22:36:12,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 22:36:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 22:36:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 22:36:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 22:36:12,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:36:12,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:36:12,451 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 22:36:12,565 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:36:12,567 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:36:12,887 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:36:13,016 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:36:13,016 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:36:13,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:36:13 BoogieIcfgContainer [2022-12-13 22:36:13,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:36:13,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:36:13,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:36:13,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:36:13,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:36:11" (1/3) ... [2022-12-13 22:36:13,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3b797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:36:13, skipping insertion in model container [2022-12-13 22:36:13,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:36:12" (2/3) ... [2022-12-13 22:36:13,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b3b797b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:36:13, skipping insertion in model container [2022-12-13 22:36:13,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:36:13" (3/3) ... [2022-12-13 22:36:13,024 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2022-12-13 22:36:13,031 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 22:36:13,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:36:13,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 22:36:13,039 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 22:36:13,084 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 22:36:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-12-13 22:36:13,149 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-13 22:36:13,150 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:36:13,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 22:36:13,154 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 130 transitions, 275 flow [2022-12-13 22:36:13,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 113 transitions, 235 flow [2022-12-13 22:36:13,160 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 22:36:13,167 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 113 transitions, 235 flow [2022-12-13 22:36:13,169 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 113 transitions, 235 flow [2022-12-13 22:36:13,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 113 transitions, 235 flow [2022-12-13 22:36:13,201 INFO L130 PetriNetUnfolder]: 1/113 cut-off events. [2022-12-13 22:36:13,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:36:13,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 1/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 22:36:13,202 INFO L119 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-13 22:36:18,033 INFO L134 LiptonReduction]: Checked pairs total: 3023 [2022-12-13 22:36:18,033 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 22:36:18,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:36:18,047 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;@55ead1f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:36:18,047 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 22:36:18,052 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 22:36:18,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 22:36:18,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:18,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:18,053 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:18,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1549416671, now seen corresponding path program 1 times [2022-12-13 22:36:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:18,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029257944] [2022-12-13 22:36:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,421 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 22:36:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:18,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029257944] [2022-12-13 22:36:18,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029257944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:18,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:18,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:36:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170038678] [2022-12-13 22:36:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:18,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:36:18,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:18,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:36:18,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:36:18,454 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 228 [2022-12-13 22:36:18,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 22:36:18,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:18,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 228 [2022-12-13 22:36:18,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:18,691 INFO L130 PetriNetUnfolder]: 689/1042 cut-off events. [2022-12-13 22:36:18,691 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 22:36:18,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 1042 events. 689/1042 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4076 event pairs, 185 based on Foata normal form. 8/1050 useless extension candidates. Maximal degree in co-relation 2120. Up to 979 conditions per place. [2022-12-13 22:36:18,697 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 28 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-13 22:36:18,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 139 flow [2022-12-13 22:36:18,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:36:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:36:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-12-13 22:36:18,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5511695906432749 [2022-12-13 22:36:18,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-12-13 22:36:18,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-12-13 22:36:18,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:18,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-12-13 22:36:18,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 22:36:18,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:18,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:18,719 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 377 transitions. [2022-12-13 22:36:18,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 139 flow [2022-12-13 22:36:18,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 22:36:18,722 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2022-12-13 22:36:18,724 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-13 22:36:18,726 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-13 22:36:18,726 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2022-12-13 22:36:18,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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 22:36:18,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:18,727 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:18,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:36:18,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:18,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash 787275528, now seen corresponding path program 1 times [2022-12-13 22:36:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:18,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491623639] [2022-12-13 22:36:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:18,920 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 22:36:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:18,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491623639] [2022-12-13 22:36:18,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491623639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:18,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:18,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 22:36:18,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362128812] [2022-12-13 22:36:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:18,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:36:18,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:18,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:36:18,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:36:18,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 228 [2022-12-13 22:36:18,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 22:36:18,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:18,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 228 [2022-12-13 22:36:18,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:19,102 INFO L130 PetriNetUnfolder]: 568/909 cut-off events. [2022-12-13 22:36:19,102 INFO L131 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-12-13 22:36:19,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 909 events. 568/909 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3621 event pairs, 155 based on Foata normal form. 12/921 useless extension candidates. Maximal degree in co-relation 2042. Up to 650 conditions per place. [2022-12-13 22:36:19,106 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-13 22:36:19,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 136 flow [2022-12-13 22:36:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:36:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:36:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-12-13 22:36:19,108 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5570175438596491 [2022-12-13 22:36:19,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2022-12-13 22:36:19,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2022-12-13 22:36:19,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:19,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2022-12-13 22:36:19,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 22:36:19,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:19,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:19,111 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 381 transitions. [2022-12-13 22:36:19,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 136 flow [2022-12-13 22:36:19,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 22:36:19,112 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2022-12-13 22:36:19,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 22:36:19,113 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-13 22:36:19,113 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2022-12-13 22:36:19,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 22:36:19,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:19,113 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:19,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:36:19,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:19,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1911828742, now seen corresponding path program 1 times [2022-12-13 22:36:19,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:19,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884643325] [2022-12-13 22:36:19,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:19,898 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 22:36:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:19,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884643325] [2022-12-13 22:36:19,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884643325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:19,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:19,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:36:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908895631] [2022-12-13 22:36:19,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:19,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:36:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:19,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:36:19,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:36:19,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 228 [2022-12-13 22:36:19,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 22:36:19,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:19,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 228 [2022-12-13 22:36:19,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:20,235 INFO L130 PetriNetUnfolder]: 549/883 cut-off events. [2022-12-13 22:36:20,236 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-13 22:36:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 883 events. 549/883 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3591 event pairs, 240 based on Foata normal form. 7/890 useless extension candidates. Maximal degree in co-relation 2083. Up to 762 conditions per place. [2022-12-13 22:36:20,239 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 31 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-13 22:36:20,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 191 flow [2022-12-13 22:36:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:36:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:36:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-12-13 22:36:20,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2022-12-13 22:36:20,241 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2022-12-13 22:36:20,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2022-12-13 22:36:20,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:20,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2022-12-13 22:36:20,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 22:36:20,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 22:36:20,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 22:36:20,244 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 4 states and 464 transitions. [2022-12-13 22:36:20,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 191 flow [2022-12-13 22:36:20,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 22:36:20,246 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 102 flow [2022-12-13 22:36:20,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-13 22:36:20,247 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-13 22:36:20,247 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 102 flow [2022-12-13 22:36:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 22:36:20,247 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:20,247 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:20,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:36:20,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -862905944, now seen corresponding path program 1 times [2022-12-13 22:36:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:20,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485074571] [2022-12-13 22:36:20,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:20,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:20,834 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 22:36:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:20,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485074571] [2022-12-13 22:36:20,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485074571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:20,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:20,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:36:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360189639] [2022-12-13 22:36:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:36:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:20,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:36:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:36:20,898 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 228 [2022-12-13 22:36:20,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 22:36:20,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:20,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 228 [2022-12-13 22:36:20,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:21,284 INFO L130 PetriNetUnfolder]: 863/1393 cut-off events. [2022-12-13 22:36:21,284 INFO L131 PetriNetUnfolder]: For 848/865 co-relation queries the response was YES. [2022-12-13 22:36:21,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3614 conditions, 1393 events. 863/1393 cut-off events. For 848/865 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6662 event pairs, 313 based on Foata normal form. 19/1384 useless extension candidates. Maximal degree in co-relation 3599. Up to 971 conditions per place. [2022-12-13 22:36:21,290 INFO L137 encePairwiseOnDemand]: 218/228 looper letters, 31 selfloop transitions, 15 changer transitions 0/48 dead transitions. [2022-12-13 22:36:21,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 260 flow [2022-12-13 22:36:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:36:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:36:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2022-12-13 22:36:21,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5184210526315789 [2022-12-13 22:36:21,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2022-12-13 22:36:21,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2022-12-13 22:36:21,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:21,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2022-12-13 22:36:21,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 22:36:21,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:21,297 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:21,297 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 102 flow. Second operand 5 states and 591 transitions. [2022-12-13 22:36:21,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 260 flow [2022-12-13 22:36:21,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 22:36:21,301 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 209 flow [2022-12-13 22:36:21,301 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-13 22:36:21,302 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-13 22:36:21,302 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 209 flow [2022-12-13 22:36:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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 22:36:21,303 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:21,303 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:21,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:36:21,303 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1256029882, now seen corresponding path program 2 times [2022-12-13 22:36:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:21,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883733764] [2022-12-13 22:36:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:22,230 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 22:36:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:22,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883733764] [2022-12-13 22:36:22,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883733764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:22,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:22,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:36:22,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512962067] [2022-12-13 22:36:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:36:22,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:22,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:36:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:36:22,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 228 [2022-12-13 22:36:22,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 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 22:36:22,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:22,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 228 [2022-12-13 22:36:22,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:22,775 INFO L130 PetriNetUnfolder]: 850/1390 cut-off events. [2022-12-13 22:36:22,775 INFO L131 PetriNetUnfolder]: For 2115/2133 co-relation queries the response was YES. [2022-12-13 22:36:22,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4527 conditions, 1390 events. 850/1390 cut-off events. For 2115/2133 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6641 event pairs, 258 based on Foata normal form. 6/1386 useless extension candidates. Maximal degree in co-relation 4507. Up to 1044 conditions per place. [2022-12-13 22:36:22,781 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 59 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2022-12-13 22:36:22,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 533 flow [2022-12-13 22:36:22,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:36:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:36:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 684 transitions. [2022-12-13 22:36:22,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 22:36:22,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 684 transitions. [2022-12-13 22:36:22,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 684 transitions. [2022-12-13 22:36:22,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:22,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 684 transitions. [2022-12-13 22:36:22,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 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 22:36:22,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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 22:36:22,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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 22:36:22,787 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 209 flow. Second operand 6 states and 684 transitions. [2022-12-13 22:36:22,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 533 flow [2022-12-13 22:36:22,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 530 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 22:36:22,790 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 304 flow [2022-12-13 22:36:22,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-13 22:36:22,791 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-13 22:36:22,791 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 304 flow [2022-12-13 22:36:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 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 22:36:22,792 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:22,792 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:22,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:36:22,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -309230362, now seen corresponding path program 1 times [2022-12-13 22:36:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:22,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172297821] [2022-12-13 22:36:22,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:22,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:22,905 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 22:36:22,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172297821] [2022-12-13 22:36:22,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172297821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:22,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:22,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:36:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942989027] [2022-12-13 22:36:22,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:22,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:36:22,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:36:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:36:22,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 228 [2022-12-13 22:36:22,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 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 22:36:22,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:22,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 228 [2022-12-13 22:36:22,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:23,159 INFO L130 PetriNetUnfolder]: 685/1172 cut-off events. [2022-12-13 22:36:23,159 INFO L131 PetriNetUnfolder]: For 2790/2804 co-relation queries the response was YES. [2022-12-13 22:36:23,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4212 conditions, 1172 events. 685/1172 cut-off events. For 2790/2804 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5776 event pairs, 108 based on Foata normal form. 113/1273 useless extension candidates. Maximal degree in co-relation 4189. Up to 479 conditions per place. [2022-12-13 22:36:23,164 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 85 selfloop transitions, 5 changer transitions 1/93 dead transitions. [2022-12-13 22:36:23,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 822 flow [2022-12-13 22:36:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:36:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 22:36:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2022-12-13 22:36:23,166 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5383771929824561 [2022-12-13 22:36:23,166 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2022-12-13 22:36:23,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2022-12-13 22:36:23,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:23,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2022-12-13 22:36:23,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:36:23,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 22:36:23,168 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 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 22:36:23,168 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 304 flow. Second operand 4 states and 491 transitions. [2022-12-13 22:36:23,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 822 flow [2022-12-13 22:36:23,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 762 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 22:36:23,175 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 320 flow [2022-12-13 22:36:23,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=320, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-13 22:36:23,176 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2022-12-13 22:36:23,176 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 320 flow [2022-12-13 22:36:23,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 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 22:36:23,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:23,176 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:23,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:36:23,177 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:23,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:23,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1840457927, now seen corresponding path program 1 times [2022-12-13 22:36:23,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:23,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066713838] [2022-12-13 22:36:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:23,749 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 22:36:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:23,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066713838] [2022-12-13 22:36:23,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066713838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:23,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:23,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:36:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031027580] [2022-12-13 22:36:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:36:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:36:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:36:23,808 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 228 [2022-12-13 22:36:23,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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 22:36:23,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:23,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 228 [2022-12-13 22:36:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:24,146 INFO L130 PetriNetUnfolder]: 628/1094 cut-off events. [2022-12-13 22:36:24,146 INFO L131 PetriNetUnfolder]: For 2832/2835 co-relation queries the response was YES. [2022-12-13 22:36:24,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 1094 events. 628/1094 cut-off events. For 2832/2835 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5313 event pairs, 218 based on Foata normal form. 10/1097 useless extension candidates. Maximal degree in co-relation 4419. Up to 888 conditions per place. [2022-12-13 22:36:24,152 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 50 selfloop transitions, 21 changer transitions 0/73 dead transitions. [2022-12-13 22:36:24,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 624 flow [2022-12-13 22:36:24,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:36:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:36:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2022-12-13 22:36:24,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5096491228070176 [2022-12-13 22:36:24,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2022-12-13 22:36:24,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2022-12-13 22:36:24,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:24,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2022-12-13 22:36:24,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 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 22:36:24,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:24,163 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:24,163 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 320 flow. Second operand 5 states and 581 transitions. [2022-12-13 22:36:24,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 624 flow [2022-12-13 22:36:24,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 600 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 22:36:24,170 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 468 flow [2022-12-13 22:36:24,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2022-12-13 22:36:24,170 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2022-12-13 22:36:24,171 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 468 flow [2022-12-13 22:36:24,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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 22:36:24,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:24,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:24,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:36:24,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash 157391821, now seen corresponding path program 1 times [2022-12-13 22:36:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:24,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153290687] [2022-12-13 22:36:24,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:24,306 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 22:36:24,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:24,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153290687] [2022-12-13 22:36:24,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153290687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:24,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:24,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:36:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129071403] [2022-12-13 22:36:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:24,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:36:24,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:36:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:36:24,315 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 228 [2022-12-13 22:36:24,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 468 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 22:36:24,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:24,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 228 [2022-12-13 22:36:24,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:24,554 INFO L130 PetriNetUnfolder]: 438/796 cut-off events. [2022-12-13 22:36:24,554 INFO L131 PetriNetUnfolder]: For 2707/2709 co-relation queries the response was YES. [2022-12-13 22:36:24,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3379 conditions, 796 events. 438/796 cut-off events. For 2707/2709 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3784 event pairs, 40 based on Foata normal form. 89/881 useless extension candidates. Maximal degree in co-relation 3351. Up to 354 conditions per place. [2022-12-13 22:36:24,558 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 113 selfloop transitions, 8 changer transitions 1/124 dead transitions. [2022-12-13 22:36:24,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 124 transitions, 1227 flow [2022-12-13 22:36:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:36:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:36:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-12-13 22:36:24,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5385964912280702 [2022-12-13 22:36:24,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2022-12-13 22:36:24,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2022-12-13 22:36:24,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:24,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2022-12-13 22:36:24,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 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 22:36:24,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:24,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:24,564 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 468 flow. Second operand 5 states and 614 transitions. [2022-12-13 22:36:24,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 124 transitions, 1227 flow [2022-12-13 22:36:24,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 124 transitions, 1200 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 22:36:24,569 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 483 flow [2022-12-13 22:36:24,570 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=483, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2022-12-13 22:36:24,570 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-13 22:36:24,570 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 483 flow [2022-12-13 22:36:24,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 22:36:24,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:24,571 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:36:24,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:24,572 INFO L85 PathProgramCache]: Analyzing trace with hash 341909129, now seen corresponding path program 1 times [2022-12-13 22:36:24,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:24,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356775253] [2022-12-13 22:36:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:24,742 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 22:36:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:24,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356775253] [2022-12-13 22:36:24,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356775253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:24,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:24,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:36:24,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099672989] [2022-12-13 22:36:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:24,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:36:24,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:36:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:36:24,753 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 228 [2022-12-13 22:36:24,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 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 22:36:24,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:24,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 228 [2022-12-13 22:36:24,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:24,931 INFO L130 PetriNetUnfolder]: 273/515 cut-off events. [2022-12-13 22:36:24,931 INFO L131 PetriNetUnfolder]: For 1907/1909 co-relation queries the response was YES. [2022-12-13 22:36:24,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2459 conditions, 515 events. 273/515 cut-off events. For 1907/1909 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2267 event pairs, 34 based on Foata normal form. 25/538 useless extension candidates. Maximal degree in co-relation 2430. Up to 205 conditions per place. [2022-12-13 22:36:24,934 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 89 selfloop transitions, 11 changer transitions 1/103 dead transitions. [2022-12-13 22:36:24,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 1040 flow [2022-12-13 22:36:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:36:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 22:36:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2022-12-13 22:36:24,935 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5241228070175439 [2022-12-13 22:36:24,935 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2022-12-13 22:36:24,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2022-12-13 22:36:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:24,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2022-12-13 22:36:24,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 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 22:36:24,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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 22:36:24,938 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 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 22:36:24,938 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 483 flow. Second operand 6 states and 717 transitions. [2022-12-13 22:36:24,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 1040 flow [2022-12-13 22:36:24,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 975 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-12-13 22:36:24,943 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 437 flow [2022-12-13 22:36:24,947 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2022-12-13 22:36:24,948 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2022-12-13 22:36:24,948 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 437 flow [2022-12-13 22:36:24,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 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 22:36:24,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:24,948 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 22:36:24,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:36:24,949 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -326554065, now seen corresponding path program 1 times [2022-12-13 22:36:24,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:24,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741115853] [2022-12-13 22:36:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:24,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:25,090 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 22:36:25,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:25,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741115853] [2022-12-13 22:36:25,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741115853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:25,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:25,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:36:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506784089] [2022-12-13 22:36:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:25,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:36:25,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:36:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:36:25,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 228 [2022-12-13 22:36:25,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 22:36:25,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:25,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 228 [2022-12-13 22:36:25,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:25,254 INFO L130 PetriNetUnfolder]: 366/675 cut-off events. [2022-12-13 22:36:25,254 INFO L131 PetriNetUnfolder]: For 2343/2343 co-relation queries the response was YES. [2022-12-13 22:36:25,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 675 events. 366/675 cut-off events. For 2343/2343 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3093 event pairs, 108 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 3212. Up to 419 conditions per place. [2022-12-13 22:36:25,256 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 49 selfloop transitions, 2 changer transitions 35/86 dead transitions. [2022-12-13 22:36:25,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 894 flow [2022-12-13 22:36:25,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:36:25,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 22:36:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2022-12-13 22:36:25,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5482456140350878 [2022-12-13 22:36:25,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2022-12-13 22:36:25,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2022-12-13 22:36:25,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:25,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2022-12-13 22:36:25,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 22:36:25,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:25,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 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 22:36:25,260 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 437 flow. Second operand 3 states and 375 transitions. [2022-12-13 22:36:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 894 flow [2022-12-13 22:36:25,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 762 flow, removed 30 selfloop flow, removed 9 redundant places. [2022-12-13 22:36:25,265 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 270 flow [2022-12-13 22:36:25,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 22:36:25,265 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2022-12-13 22:36:25,265 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 270 flow [2022-12-13 22:36:25,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 22:36:25,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:25,266 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 22:36:25,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:36:25,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -708007485, now seen corresponding path program 2 times [2022-12-13 22:36:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:25,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99424604] [2022-12-13 22:36:25,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:26,394 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 22:36:26,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99424604] [2022-12-13 22:36:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99424604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:26,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:26,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:36:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24154299] [2022-12-13 22:36:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:26,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:36:26,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:26,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:36:26,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:36:26,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 228 [2022-12-13 22:36:26,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 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 22:36:26,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:26,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 228 [2022-12-13 22:36:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:26,745 INFO L130 PetriNetUnfolder]: 124/260 cut-off events. [2022-12-13 22:36:26,745 INFO L131 PetriNetUnfolder]: For 504/506 co-relation queries the response was YES. [2022-12-13 22:36:26,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 260 events. 124/260 cut-off events. For 504/506 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1001 event pairs, 29 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 1027. Up to 118 conditions per place. [2022-12-13 22:36:26,746 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 38 selfloop transitions, 15 changer transitions 11/65 dead transitions. [2022-12-13 22:36:26,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 513 flow [2022-12-13 22:36:26,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:36:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:36:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2022-12-13 22:36:26,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-13 22:36:26,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2022-12-13 22:36:26,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2022-12-13 22:36:26,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:26,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2022-12-13 22:36:26,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 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 22:36:26,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:26,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:26,751 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 270 flow. Second operand 5 states and 585 transitions. [2022-12-13 22:36:26,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 513 flow [2022-12-13 22:36:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 448 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-12-13 22:36:26,753 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 285 flow [2022-12-13 22:36:26,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-13 22:36:26,753 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 18 predicate places. [2022-12-13 22:36:26,753 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 285 flow [2022-12-13 22:36:26,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 0 states have call successors, (0), 0 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 22:36:26,754 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:26,754 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 22:36:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:36:26,754 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:26,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1048117199, now seen corresponding path program 3 times [2022-12-13 22:36:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253468326] [2022-12-13 22:36:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:36:27,942 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 22:36:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:36:27,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253468326] [2022-12-13 22:36:27,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253468326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:36:27,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:36:27,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:36:27,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866874037] [2022-12-13 22:36:27,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:36:27,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 22:36:27,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:36:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 22:36:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:36:28,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 228 [2022-12-13 22:36:28,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 285 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 22:36:28,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 22:36:28,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 228 [2022-12-13 22:36:28,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 22:36:28,330 INFO L130 PetriNetUnfolder]: 99/208 cut-off events. [2022-12-13 22:36:28,330 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2022-12-13 22:36:28,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 208 events. 99/208 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 739 event pairs, 20 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 810. Up to 104 conditions per place. [2022-12-13 22:36:28,331 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 26 selfloop transitions, 7 changer transitions 24/58 dead transitions. [2022-12-13 22:36:28,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 462 flow [2022-12-13 22:36:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:36:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 22:36:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-12-13 22:36:28,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008771929824561 [2022-12-13 22:36:28,333 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2022-12-13 22:36:28,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2022-12-13 22:36:28,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 22:36:28,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2022-12-13 22:36:28,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 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 22:36:28,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:28,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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 22:36:28,336 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 285 flow. Second operand 5 states and 571 transitions. [2022-12-13 22:36:28,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 462 flow [2022-12-13 22:36:28,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 438 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 22:36:28,338 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 193 flow [2022-12-13 22:36:28,338 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2022-12-13 22:36:28,338 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2022-12-13 22:36:28,338 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 193 flow [2022-12-13 22:36:28,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 22:36:28,339 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 22:36:28,339 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 22:36:28,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:36:28,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 22:36:28,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:36:28,339 INFO L85 PathProgramCache]: Analyzing trace with hash -583093093, now seen corresponding path program 4 times [2022-12-13 22:36:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:36:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27876988] [2022-12-13 22:36:28,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:36:28,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:36:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:36:28,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 22:36:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 22:36:28,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 22:36:28,432 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 22:36:28,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 22:36:28,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 22:36:28,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 22:36:28,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 22:36:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:36:28,435 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:36:28,439 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 22:36:28,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:36:28,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:36:28 BasicIcfg [2022-12-13 22:36:28,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:36:28,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:36:28,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:36:28,484 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:36:28,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:36:13" (3/4) ... [2022-12-13 22:36:28,486 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 22:36:28,539 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:36:28,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:36:28,540 INFO L158 Benchmark]: Toolchain (without parser) took 16603.22ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 113.7MB in the beginning and 107.1MB in the end (delta: 6.7MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,540 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:36:28,540 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.70ms. Allocated memory is still 148.9MB. Free memory was 113.7MB in the beginning and 86.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,541 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.94ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 83.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:36:28,541 INFO L158 Benchmark]: Boogie Preprocessor took 25.07ms. Allocated memory is still 148.9MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,541 INFO L158 Benchmark]: RCFGBuilder took 629.38ms. Allocated memory is still 148.9MB. Free memory was 81.9MB in the beginning and 81.2MB in the end (delta: 663.1kB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,541 INFO L158 Benchmark]: TraceAbstraction took 15464.10ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 81.2MB in the beginning and 121.8MB in the end (delta: -40.6MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,542 INFO L158 Benchmark]: Witness Printer took 55.45ms. Allocated memory is still 314.6MB. Free memory was 121.8MB in the beginning and 107.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:36:28,543 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.70ms. Allocated memory is still 148.9MB. Free memory was 113.7MB in the beginning and 86.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.94ms. Allocated memory is still 148.9MB. Free memory was 86.6MB in the beginning and 83.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.07ms. Allocated memory is still 148.9MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 629.38ms. Allocated memory is still 148.9MB. Free memory was 81.9MB in the beginning and 81.2MB in the end (delta: 663.1kB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15464.10ms. Allocated memory was 148.9MB in the beginning and 314.6MB in the end (delta: 165.7MB). Free memory was 81.2MB in the beginning and 121.8MB in the end (delta: -40.6MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Witness Printer took 55.45ms. Allocated memory is still 314.6MB. Free memory was 121.8MB in the beginning and 107.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 122 PlacesBefore, 29 PlacesAfterwards, 113 TransitionsBefore, 19 TransitionsAfterwards, 1214 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 3023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1271, independent: 1118, independent conditional: 0, independent unconditional: 1118, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 641, independent: 601, independent conditional: 0, independent unconditional: 601, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1271, independent: 517, independent conditional: 0, independent unconditional: 517, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 641, unknown conditional: 0, unknown unconditional: 641] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2269, ((void *)0), P0, ((void *)0))=-1, t2269={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2270; [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2270, ((void *)0), P1, ((void *)0))=0, t2269={7:0}, t2270={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2271; [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2271, ((void *)0), P2, ((void *)0))=1, t2269={7:0}, t2270={5:0}, t2271={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269={7:0}, t2270={5:0}, t2271={8:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 852]: 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: 854]: 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: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 767 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 310 mSDsCounter, 250 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1447 IncrementalHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 250 mSolverCounterUnsat, 54 mSDtfsCounter, 1447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred in iteration=8, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 2560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 22:36:28,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab42f956-356e-4551-8a47-c88d42c2dd7f/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