./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R --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 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 --- 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-38b53e6 [2022-11-25 17:03:31,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:03:31,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:03:31,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:03:31,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:03:31,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:03:31,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:03:31,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:03:31,101 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:03:31,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:03:31,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:03:31,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:03:31,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:03:31,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:03:31,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:03:31,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:03:31,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:03:31,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:03:31,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:03:31,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:03:31,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:03:31,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:03:31,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:03:31,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:03:31,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:03:31,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:03:31,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:03:31,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:03:31,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:03:31,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:03:31,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:03:31,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:03:31,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:03:31,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:03:31,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:03:31,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:03:31,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:03:31,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:03:31,173 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:03:31,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:03:31,175 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:03:31,176 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:03:31,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:03:31,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:03:31,223 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:03:31,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:03:31,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:03:31,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:03:31,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:03:31,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:03:31,227 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:03:31,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:03:31,229 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:03:31,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:03:31,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:03:31,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:03:31,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:03:31,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:03:31,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:03:31,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:03:31,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:03:31,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:03:31,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:03:31,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:03:31,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:03:31,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:03:31,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:03:31,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:03:31,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:03:31,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:03:31,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:03:31,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:03:31,237 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:03:31,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:03:31,237 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:03:31,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:03:31,238 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_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/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_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R 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 -> 87c512ff7772c648d2c2d28b30bf4d136366c31440eeddc6ab833b392d36d780 [2022-11-25 17:03:31,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:03:31,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:03:31,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:03:31,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:03:31,637 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:03:31,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:03:35,004 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:03:35,384 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:03:35,388 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:03:35,407 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/data/e7cc50223/0901e78be40b4c1b8587bf8f743d01ac/FLAGc6e40015f [2022-11-25 17:03:35,431 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/data/e7cc50223/0901e78be40b4c1b8587bf8f743d01ac [2022-11-25 17:03:35,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:03:35,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:03:35,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:03:35,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:03:35,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:03:35,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:35" (1/1) ... [2022-11-25 17:03:35,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d26dfbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:35, skipping insertion in model container [2022-11-25 17:03:35,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:03:35" (1/1) ... [2022-11-25 17:03:35,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:03:35,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:03:35,732 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_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-25 17:03:35,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,963 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:35,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:35,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:03:36,016 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:03:36,036 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_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/sv-benchmarks/c/pthread-wmm/mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2022-11-25 17:03:36,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:03:36,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:03:36,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:03:36,195 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:03:36,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36 WrapperNode [2022-11-25 17:03:36,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:03:36,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:03:36,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:03:36,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:03:36,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,250 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2022-11-25 17:03:36,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:03:36,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:03:36,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:03:36,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:03:36,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:03:36,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:03:36,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:03:36,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:03:36,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (1/1) ... [2022-11-25 17:03:36,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:03:36,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:03:36,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:03:36,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:03:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:03:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:03:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:03:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:03:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:03:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:03:36,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:03:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:03:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:03:36,399 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:03:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:03:36,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:03:36,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:03:36,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:03:36,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:03:36,401 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:03:36,588 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:03:36,590 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:03:37,038 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:03:37,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:03:37,267 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:03:37,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:37 BoogieIcfgContainer [2022-11-25 17:03:37,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:03:37,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:03:37,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:03:37,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:03:37,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:03:35" (1/3) ... [2022-11-25 17:03:37,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a459cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:03:37, skipping insertion in model container [2022-11-25 17:03:37,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:03:36" (2/3) ... [2022-11-25 17:03:37,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a459cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:03:37, skipping insertion in model container [2022-11-25 17:03:37,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:37" (3/3) ... [2022-11-25 17:03:37,288 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2022-11-25 17:03:37,299 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:03:37,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:03:37,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 17:03:37,313 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:03:37,427 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:03:37,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-11-25 17:03:37,639 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-25 17:03:37,640 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:03:37,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 17:03:37,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2022-11-25 17:03:37,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2022-11-25 17:03:37,658 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:03:37,678 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2022-11-25 17:03:37,681 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2022-11-25 17:03:37,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2022-11-25 17:03:37,712 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-11-25 17:03:37,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:03:37,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 17:03:37,716 INFO L119 LiptonReduction]: Number of co-enabled transitions 2440 [2022-11-25 17:03:43,544 INFO L134 LiptonReduction]: Checked pairs total: 6731 [2022-11-25 17:03:43,545 INFO L136 LiptonReduction]: Total number of compositions: 105 [2022-11-25 17:03:43,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:03:43,575 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;@554cbb54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:03:43,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 17:03:43,581 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 17:03:43,581 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:03:43,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:43,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:03:43,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 511061, now seen corresponding path program 1 times [2022-11-25 17:03:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:43,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468868174] [2022-11-25 17:03:43,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:43,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:44,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:44,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468868174] [2022-11-25 17:03:44,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468868174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:44,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:44,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:03:44,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462297367] [2022-11-25 17:03:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:44,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:03:44,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:44,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:03:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:03:44,220 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 226 [2022-11-25 17:03:44,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:44,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:44,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 226 [2022-11-25 17:03:44,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:44,801 INFO L130 PetriNetUnfolder]: 1381/2070 cut-off events. [2022-11-25 17:03:44,802 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-25 17:03:44,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4159 conditions, 2070 events. 1381/2070 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9606 event pairs, 617 based on Foata normal form. 0/1966 useless extension candidates. Maximal degree in co-relation 4148. Up to 1729 conditions per place. [2022-11-25 17:03:44,829 INFO L137 encePairwiseOnDemand]: 222/226 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-11-25 17:03:44,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 173 flow [2022-11-25 17:03:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:03:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:03:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-11-25 17:03:44,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5339233038348082 [2022-11-25 17:03:44,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2022-11-25 17:03:44,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2022-11-25 17:03:44,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:44,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2022-11-25 17:03:44,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:44,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:44,877 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:44,879 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 362 transitions. [2022-11-25 17:03:44,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 173 flow [2022-11-25 17:03:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:03:44,885 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2022-11-25 17:03:44,888 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-11-25 17:03:44,893 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-11-25 17:03:44,894 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2022-11-25 17:03:44,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:44,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:44,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:44,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:03:44,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1210333300, now seen corresponding path program 1 times [2022-11-25 17:03:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005235765] [2022-11-25 17:03:44,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:44,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:45,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-11-25 17:03:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005235765] [2022-11-25 17:03:45,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005235765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:45,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:45,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:03:45,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009785057] [2022-11-25 17:03:45,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:45,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:45,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:45,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:45,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2022-11-25 17:03:45,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:45,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:45,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2022-11-25 17:03:45,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:46,505 INFO L130 PetriNetUnfolder]: 3613/5382 cut-off events. [2022-11-25 17:03:46,505 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-11-25 17:03:46,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11138 conditions, 5382 events. 3613/5382 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 27802 event pairs, 1078 based on Foata normal form. 282/5664 useless extension candidates. Maximal degree in co-relation 11128. Up to 3167 conditions per place. [2022-11-25 17:03:46,539 INFO L137 encePairwiseOnDemand]: 217/226 looper letters, 38 selfloop transitions, 7 changer transitions 29/74 dead transitions. [2022-11-25 17:03:46,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 74 transitions, 316 flow [2022-11-25 17:03:46,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:03:46,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2022-11-25 17:03:46,548 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4964601769911504 [2022-11-25 17:03:46,548 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 561 transitions. [2022-11-25 17:03:46,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 561 transitions. [2022-11-25 17:03:46,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:46,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 561 transitions. [2022-11-25 17:03:46,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:46,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:46,558 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:46,558 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 5 states and 561 transitions. [2022-11-25 17:03:46,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 74 transitions, 316 flow [2022-11-25 17:03:46,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 74 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:03:46,562 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2022-11-25 17:03:46,562 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-11-25 17:03:46,563 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-11-25 17:03:46,563 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2022-11-25 17:03:46,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:46,564 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:46,564 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:46,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:03:46,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:46,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:46,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1134310874, now seen corresponding path program 1 times [2022-11-25 17:03:46,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:46,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359520761] [2022-11-25 17:03:46,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:46,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:46,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:46,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359520761] [2022-11-25 17:03:46,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359520761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:46,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:46,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:03:46,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641390771] [2022-11-25 17:03:46,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:46,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:46,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:46,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:46,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:46,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 226 [2022-11-25 17:03:46,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:46,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:46,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 226 [2022-11-25 17:03:46,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:48,004 INFO L130 PetriNetUnfolder]: 3155/4754 cut-off events. [2022-11-25 17:03:48,004 INFO L131 PetriNetUnfolder]: For 3274/3274 co-relation queries the response was YES. [2022-11-25 17:03:48,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12898 conditions, 4754 events. 3155/4754 cut-off events. For 3274/3274 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24097 event pairs, 701 based on Foata normal form. 272/5026 useless extension candidates. Maximal degree in co-relation 12884. Up to 2145 conditions per place. [2022-11-25 17:03:48,035 INFO L137 encePairwiseOnDemand]: 218/226 looper letters, 46 selfloop transitions, 7 changer transitions 38/91 dead transitions. [2022-11-25 17:03:48,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 91 transitions, 518 flow [2022-11-25 17:03:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:03:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:03:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 764 transitions. [2022-11-25 17:03:48,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4829329962073325 [2022-11-25 17:03:48,039 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 764 transitions. [2022-11-25 17:03:48,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 764 transitions. [2022-11-25 17:03:48,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:48,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 764 transitions. [2022-11-25 17:03:48,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:48,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:48,047 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 226.0) internal successors, (1808), 8 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:48,047 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 7 states and 764 transitions. [2022-11-25 17:03:48,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 91 transitions, 518 flow [2022-11-25 17:03:48,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 91 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 17:03:48,074 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 168 flow [2022-11-25 17:03:48,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=168, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-11-25 17:03:48,076 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-11-25 17:03:48,076 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 168 flow [2022-11-25 17:03:48,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:48,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:48,077 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:48,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:03:48,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1504685652, now seen corresponding path program 1 times [2022-11-25 17:03:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56006860] [2022-11-25 17:03:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:48,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56006860] [2022-11-25 17:03:48,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56006860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:48,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:48,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:03:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122790216] [2022-11-25 17:03:48,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:48,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:48,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:48,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:48,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 226 [2022-11-25 17:03:48,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:48,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:48,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 226 [2022-11-25 17:03:48,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:49,197 INFO L130 PetriNetUnfolder]: 2107/3398 cut-off events. [2022-11-25 17:03:49,198 INFO L131 PetriNetUnfolder]: For 4370/4432 co-relation queries the response was YES. [2022-11-25 17:03:49,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 3398 events. 2107/3398 cut-off events. For 4370/4432 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18503 event pairs, 991 based on Foata normal form. 194/3552 useless extension candidates. Maximal degree in co-relation 9393. Up to 2089 conditions per place. [2022-11-25 17:03:49,227 INFO L137 encePairwiseOnDemand]: 222/226 looper letters, 35 selfloop transitions, 4 changer transitions 20/67 dead transitions. [2022-11-25 17:03:49,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 404 flow [2022-11-25 17:03:49,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:03:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-11-25 17:03:49,231 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.511504424778761 [2022-11-25 17:03:49,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2022-11-25 17:03:49,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2022-11-25 17:03:49,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:49,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2022-11-25 17:03:49,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,238 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,238 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 168 flow. Second operand 5 states and 578 transitions. [2022-11-25 17:03:49,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 404 flow [2022-11-25 17:03:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 391 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 17:03:49,269 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 173 flow [2022-11-25 17:03:49,269 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-11-25 17:03:49,271 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2022-11-25 17:03:49,272 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 173 flow [2022-11-25 17:03:49,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,273 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:49,273 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:49,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:03:49,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:49,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1783606865, now seen corresponding path program 1 times [2022-11-25 17:03:49,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120412225] [2022-11-25 17:03:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:49,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:49,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120412225] [2022-11-25 17:03:49,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120412225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:49,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:49,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:03:49,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560710203] [2022-11-25 17:03:49,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:49,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:03:49,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:49,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:03:49,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:03:49,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 226 [2022-11-25 17:03:49,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:49,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 226 [2022-11-25 17:03:49,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:49,850 INFO L130 PetriNetUnfolder]: 950/1636 cut-off events. [2022-11-25 17:03:49,851 INFO L131 PetriNetUnfolder]: For 1599/1761 co-relation queries the response was YES. [2022-11-25 17:03:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4613 conditions, 1636 events. 950/1636 cut-off events. For 1599/1761 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8470 event pairs, 255 based on Foata normal form. 98/1704 useless extension candidates. Maximal degree in co-relation 4591. Up to 1241 conditions per place. [2022-11-25 17:03:49,866 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 40 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2022-11-25 17:03:49,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 342 flow [2022-11-25 17:03:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:03:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:03:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-11-25 17:03:49,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5147492625368731 [2022-11-25 17:03:49,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-11-25 17:03:49,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-11-25 17:03:49,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:49,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-11-25 17:03:49,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,874 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 173 flow. Second operand 3 states and 349 transitions. [2022-11-25 17:03:49,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 342 flow [2022-11-25 17:03:49,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 320 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 17:03:49,882 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 183 flow [2022-11-25 17:03:49,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-25 17:03:49,883 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-11-25 17:03:49,884 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 183 flow [2022-11-25 17:03:49,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:49,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:49,885 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:49,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:03:49,885 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:49,886 INFO L85 PathProgramCache]: Analyzing trace with hash 148647566, now seen corresponding path program 1 times [2022-11-25 17:03:49,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:49,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999655178] [2022-11-25 17:03:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999655178] [2022-11-25 17:03:50,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999655178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:50,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:50,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:03:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663937015] [2022-11-25 17:03:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:50,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:03:50,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:50,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:03:50,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:03:50,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 226 [2022-11-25 17:03:50,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:50,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 226 [2022-11-25 17:03:50,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:50,354 INFO L130 PetriNetUnfolder]: 455/864 cut-off events. [2022-11-25 17:03:50,354 INFO L131 PetriNetUnfolder]: For 536/589 co-relation queries the response was YES. [2022-11-25 17:03:50,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2711 conditions, 864 events. 455/864 cut-off events. For 536/589 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4230 event pairs, 146 based on Foata normal form. 92/935 useless extension candidates. Maximal degree in co-relation 2692. Up to 304 conditions per place. [2022-11-25 17:03:50,361 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 53 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2022-11-25 17:03:50,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 440 flow [2022-11-25 17:03:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:03:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:03:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-11-25 17:03:50,364 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5154867256637168 [2022-11-25 17:03:50,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2022-11-25 17:03:50,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2022-11-25 17:03:50,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:50,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2022-11-25 17:03:50,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,369 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,369 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 183 flow. Second operand 4 states and 466 transitions. [2022-11-25 17:03:50,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 440 flow [2022-11-25 17:03:50,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 68 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:03:50,373 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 219 flow [2022-11-25 17:03:50,374 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-11-25 17:03:50,375 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2022-11-25 17:03:50,375 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 219 flow [2022-11-25 17:03:50,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,375 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:50,376 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:50,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:03:50,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2145015396, now seen corresponding path program 1 times [2022-11-25 17:03:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383293829] [2022-11-25 17:03:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:50,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383293829] [2022-11-25 17:03:50,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383293829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:50,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:50,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:03:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097334194] [2022-11-25 17:03:50,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:50,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:50,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 226 [2022-11-25 17:03:50,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:50,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 226 [2022-11-25 17:03:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:50,930 INFO L130 PetriNetUnfolder]: 393/729 cut-off events. [2022-11-25 17:03:50,930 INFO L131 PetriNetUnfolder]: For 869/915 co-relation queries the response was YES. [2022-11-25 17:03:50,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 729 events. 393/729 cut-off events. For 869/915 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3530 event pairs, 136 based on Foata normal form. 27/735 useless extension candidates. Maximal degree in co-relation 2418. Up to 304 conditions per place. [2022-11-25 17:03:50,943 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 49 selfloop transitions, 10 changer transitions 1/68 dead transitions. [2022-11-25 17:03:50,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 464 flow [2022-11-25 17:03:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:03:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions. [2022-11-25 17:03:50,947 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.504424778761062 [2022-11-25 17:03:50,947 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions. [2022-11-25 17:03:50,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions. [2022-11-25 17:03:50,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:50,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions. [2022-11-25 17:03:50,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,953 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,953 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 219 flow. Second operand 5 states and 570 transitions. [2022-11-25 17:03:50,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 464 flow [2022-11-25 17:03:50,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 432 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-25 17:03:50,960 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 220 flow [2022-11-25 17:03:50,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-11-25 17:03:50,961 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-11-25 17:03:50,961 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 220 flow [2022-11-25 17:03:50,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:50,962 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:50,962 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:50,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:03:50,962 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:50,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2218765, now seen corresponding path program 1 times [2022-11-25 17:03:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608694392] [2022-11-25 17:03:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:52,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608694392] [2022-11-25 17:03:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608694392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:52,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:03:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786573977] [2022-11-25 17:03:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:52,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:03:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:03:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:03:52,391 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2022-11-25 17:03:52,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:52,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:52,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2022-11-25 17:03:52,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:53,100 INFO L130 PetriNetUnfolder]: 570/988 cut-off events. [2022-11-25 17:03:53,100 INFO L131 PetriNetUnfolder]: For 1531/1531 co-relation queries the response was YES. [2022-11-25 17:03:53,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 988 events. 570/988 cut-off events. For 1531/1531 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4539 event pairs, 33 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 3423. Up to 334 conditions per place. [2022-11-25 17:03:53,106 INFO L137 encePairwiseOnDemand]: 214/226 looper letters, 64 selfloop transitions, 19 changer transitions 32/115 dead transitions. [2022-11-25 17:03:53,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 115 transitions, 842 flow [2022-11-25 17:03:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:03:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:03:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 919 transitions. [2022-11-25 17:03:53,111 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45181907571288105 [2022-11-25 17:03:53,111 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 919 transitions. [2022-11-25 17:03:53,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 919 transitions. [2022-11-25 17:03:53,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:53,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 919 transitions. [2022-11-25 17:03:53,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.11111111111111) internal successors, (919), 9 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,122 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,122 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 220 flow. Second operand 9 states and 919 transitions. [2022-11-25 17:03:53,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 115 transitions, 842 flow [2022-11-25 17:03:53,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 115 transitions, 748 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-11-25 17:03:53,134 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 271 flow [2022-11-25 17:03:53,134 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-11-25 17:03:53,138 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-11-25 17:03:53,138 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 271 flow [2022-11-25 17:03:53,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.0) internal successors, (760), 8 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:53,139 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:03:53,140 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:53,141 INFO L85 PathProgramCache]: Analyzing trace with hash -892481803, now seen corresponding path program 2 times [2022-11-25 17:03:53,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:53,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499140637] [2022-11-25 17:03:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:03:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:03:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:03:53,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499140637] [2022-11-25 17:03:53,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499140637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:03:53,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:03:53,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:03:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349976803] [2022-11-25 17:03:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:03:53,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:03:53,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:03:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:03:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:03:53,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 226 [2022-11-25 17:03:53,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:03:53,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 226 [2022-11-25 17:03:53,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:03:53,808 INFO L130 PetriNetUnfolder]: 440/851 cut-off events. [2022-11-25 17:03:53,808 INFO L131 PetriNetUnfolder]: For 1198/1199 co-relation queries the response was YES. [2022-11-25 17:03:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 851 events. 440/851 cut-off events. For 1198/1199 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4317 event pairs, 88 based on Foata normal form. 1/852 useless extension candidates. Maximal degree in co-relation 2888. Up to 437 conditions per place. [2022-11-25 17:03:53,812 INFO L137 encePairwiseOnDemand]: 222/226 looper letters, 36 selfloop transitions, 1 changer transitions 42/83 dead transitions. [2022-11-25 17:03:53,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 614 flow [2022-11-25 17:03:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:03:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:03:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2022-11-25 17:03:53,815 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49734513274336284 [2022-11-25 17:03:53,815 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2022-11-25 17:03:53,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2022-11-25 17:03:53,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:03:53,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2022-11-25 17:03:53,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 226.0) internal successors, (1356), 6 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,823 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 271 flow. Second operand 5 states and 562 transitions. [2022-11-25 17:03:53,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 614 flow [2022-11-25 17:03:53,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 589 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 17:03:53,832 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 196 flow [2022-11-25 17:03:53,832 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2022-11-25 17:03:53,833 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2022-11-25 17:03:53,833 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 196 flow [2022-11-25 17:03:53,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:03:53,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:03:53,836 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:53,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:03:53,838 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 17:03:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:03:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 392184843, now seen corresponding path program 3 times [2022-11-25 17:03:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:03:53,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210814799] [2022-11-25 17:03:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:03:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:03:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:03:53,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:03:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:03:54,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:03:54,020 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:03:54,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 17:03:54,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 17:03:54,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 17:03:54,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 17:03:54,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 17:03:54,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 17:03:54,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:03:54,029 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:03:54,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:03:54,038 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:03:54,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:03:54 BasicIcfg [2022-11-25 17:03:54,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:03:54,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:03:54,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:03:54,176 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:03:54,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:03:37" (3/4) ... [2022-11-25 17:03:54,179 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:03:54,341 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:03:54,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:03:54,342 INFO L158 Benchmark]: Toolchain (without parser) took 18904.48ms. Allocated memory was 180.4MB in the beginning and 377.5MB in the end (delta: 197.1MB). Free memory was 132.3MB in the beginning and 337.0MB in the end (delta: -204.6MB). Peak memory consumption was 178.8MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,342 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 134.2MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:03:54,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.34ms. Allocated memory is still 180.4MB. Free memory was 132.3MB in the beginning and 105.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.31ms. Allocated memory is still 180.4MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,343 INFO L158 Benchmark]: Boogie Preprocessor took 48.78ms. Allocated memory is still 180.4MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,344 INFO L158 Benchmark]: RCFGBuilder took 970.74ms. Allocated memory is still 180.4MB. Free memory was 100.9MB in the beginning and 65.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,344 INFO L158 Benchmark]: TraceAbstraction took 16900.00ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 64.8MB in the beginning and 102.2MB in the end (delta: -37.4MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,345 INFO L158 Benchmark]: Witness Printer took 165.88ms. Allocated memory was 314.6MB in the beginning and 377.5MB in the end (delta: 62.9MB). Free memory was 102.2MB in the beginning and 337.0MB in the end (delta: -234.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-11-25 17:03:54,348 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.41ms. Allocated memory is still 134.2MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.34ms. Allocated memory is still 180.4MB. Free memory was 132.3MB in the beginning and 105.1MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.31ms. Allocated memory is still 180.4MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.78ms. Allocated memory is still 180.4MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 970.74ms. Allocated memory is still 180.4MB. Free memory was 100.9MB in the beginning and 65.2MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16900.00ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 64.8MB in the beginning and 102.2MB in the end (delta: -37.4MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. * Witness Printer took 165.88ms. Allocated memory was 314.6MB in the beginning and 377.5MB in the end (delta: 62.9MB). Free memory was 102.2MB in the beginning and 337.0MB in the end (delta: -234.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 126 PlacesBefore, 36 PlacesAfterwards, 118 TransitionsBefore, 27 TransitionsAfterwards, 2440 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 6731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3413, independent: 3213, independent conditional: 0, independent unconditional: 3213, dependent: 200, dependent conditional: 0, dependent unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1806, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1806, independent: 1727, independent conditional: 0, independent unconditional: 1727, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 527, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3413, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1806, unknown conditional: 0, unknown unconditional: 1806] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t633; [L849] FCALL, FORK 0 pthread_create(&t633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t633, ((void *)0), P0, ((void *)0))=-1, t633={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t634; [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t634, ((void *)0), P1, ((void *)0))=0, t633={5:0}, t634={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 [L764] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L852] 0 pthread_t t635; [L767] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t635, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t635, ((void *)0), P2, ((void *)0))=1, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L787] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L804] 3 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2] [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2] [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t633={5:0}, t634={6:0}, t635={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2] [L866] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 467 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 49 mSDtfsCounter, 1171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=8, InterpolantAutomatonStates: 46, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-11-25 17:03:54,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ade04bae-e8a5-478e-9ca8-87bf24ff16fb/bin/uautomizer-ZsLfNo2U6R/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