./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:16:38,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:16:38,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:16:38,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:16:38,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:16:38,973 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:16:38,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:16:38,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:16:38,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:16:38,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:16:38,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:16:38,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:16:38,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:16:38,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:16:38,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:16:38,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:16:38,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:16:38,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:16:38,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:16:38,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:16:38,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:16:38,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:16:38,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:16:38,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:16:38,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:16:38,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:16:38,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:16:38,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:16:39,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:16:39,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:16:39,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:16:39,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:16:39,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:16:39,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:16:39,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:16:39,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:16:39,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:16:39,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:16:39,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:16:39,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:16:39,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:16:39,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:16:39,029 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:16:39,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:16:39,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:16:39,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:16:39,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:16:39,030 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:16:39,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:16:39,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:16:39,031 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:16:39,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:16:39,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:16:39,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:16:39,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:16:39,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:16:39,034 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:16:39,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:16:39,035 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:16:39,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:16:39,035 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:16:39,035 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_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98fb631b7747d0724c093b074b80cf02851c21b4b9e1af2c5f1e3d032d6b592f [2022-12-13 13:16:39,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:16:39,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:16:39,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:16:39,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:16:39,241 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:16:39,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix007.opt.i [2022-12-13 13:16:41,784 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:16:41,954 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:16:41,954 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/sv-benchmarks/c/pthread-wmm/mix007.opt.i [2022-12-13 13:16:41,963 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/data/ec6ccd969/6169a30568144964a5b46f763923822d/FLAG3a0d490cd [2022-12-13 13:16:41,974 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/data/ec6ccd969/6169a30568144964a5b46f763923822d [2022-12-13 13:16:41,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:16:41,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:16:41,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:41,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:16:41,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:16:41,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:41" (1/1) ... [2022-12-13 13:16:41,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548782b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:41, skipping insertion in model container [2022-12-13 13:16:41,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:16:41" (1/1) ... [2022-12-13 13:16:41,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:16:42,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:16:42,132 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_fffbba00-73fa-4c72-9ffb-586c1014997d/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2022-12-13 13:16:42,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:42,281 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:16:42,289 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_fffbba00-73fa-4c72-9ffb-586c1014997d/sv-benchmarks/c/pthread-wmm/mix007.opt.i[944,957] [2022-12-13 13:16:42,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:16:42,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:16:42,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:16:42,350 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:16:42,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42 WrapperNode [2022-12-13 13:16:42,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:16:42,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:42,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:16:42,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:16:42,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,386 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 13:16:42,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:16:42,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:16:42,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:16:42,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:16:42,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,405 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:16:42,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:16:42,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:16:42,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:16:42,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (1/1) ... [2022-12-13 13:16:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:16:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:42,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:16:42,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:16:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:16:42,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:16:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:16:42,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:16:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:16:42,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:16:42,473 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 13:16:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 13:16:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:16:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:16:42,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:16:42,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:16:42,475 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:16:42,609 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:16:42,610 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:16:42,892 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:16:42,980 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:16:42,980 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:16:42,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:42 BoogieIcfgContainer [2022-12-13 13:16:42,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:16:42,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:16:42,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:16:42,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:16:42,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:16:41" (1/3) ... [2022-12-13 13:16:42,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3627ad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:42, skipping insertion in model container [2022-12-13 13:16:42,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:16:42" (2/3) ... [2022-12-13 13:16:42,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3627ad62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:16:42, skipping insertion in model container [2022-12-13 13:16:42,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:42" (3/3) ... [2022-12-13 13:16:42,991 INFO L112 eAbstractionObserver]: Analyzing ICFG mix007.opt.i [2022-12-13 13:16:42,998 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:16:43,006 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:16:43,006 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:16:43,006 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:16:43,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:16:43,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:16:43,133 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:16:43,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:16:43,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:16:43,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:16:43,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-12-13 13:16:43,145 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:16:43,155 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:16:43,158 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:16:43,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-12-13 13:16:43,189 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:16:43,189 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:16:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:16:43,192 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-13 13:16:46,265 INFO L134 LiptonReduction]: Checked pairs total: 7607 [2022-12-13 13:16:46,265 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-12-13 13:16:46,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:16:46,280 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;@5da87c4b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:16:46,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 13:16:46,283 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 13:16:46,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:16:46,284 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:46,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:46,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1376127878, now seen corresponding path program 1 times [2022-12-13 13:16:46,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:46,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130451467] [2022-12-13 13:16:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:46,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130451467] [2022-12-13 13:16:46,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130451467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:46,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:46,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:16:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564096737] [2022-12-13 13:16:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:46,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:16:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:16:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:16:46,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 256 [2022-12-13 13:16:46,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:46,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:46,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 256 [2022-12-13 13:16:46,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:47,087 INFO L130 PetriNetUnfolder]: 2594/3787 cut-off events. [2022-12-13 13:16:47,087 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 13:16:47,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 3787 events. 2594/3787 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20006 event pairs, 518 based on Foata normal form. 0/3594 useless extension candidates. Maximal degree in co-relation 7470. Up to 2797 conditions per place. [2022-12-13 13:16:47,104 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 13:16:47,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-12-13 13:16:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:16:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:16:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-12-13 13:16:47,114 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2022-12-13 13:16:47,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-12-13 13:16:47,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-12-13 13:16:47,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:47,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-12-13 13:16:47,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:47,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:47,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:47,129 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-12-13 13:16:47,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-12-13 13:16:47,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:16:47,136 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-12-13 13:16:47,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 13:16:47,141 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 13:16:47,141 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-12-13 13:16:47,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:47,142 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:47,142 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:47,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:16:47,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -390954963, now seen corresponding path program 1 times [2022-12-13 13:16:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:47,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565785318] [2022-12-13 13:16:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:47,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:47,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565785318] [2022-12-13 13:16:47,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565785318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:47,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:47,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:16:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16365655] [2022-12-13 13:16:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:47,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:16:47,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:47,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:16:47,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:16:47,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:16:47,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:47,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:47,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:16:47,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:48,258 INFO L130 PetriNetUnfolder]: 8243/11356 cut-off events. [2022-12-13 13:16:48,258 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-12-13 13:16:48,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23454 conditions, 11356 events. 8243/11356 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 56026 event pairs, 2847 based on Foata normal form. 248/11604 useless extension candidates. Maximal degree in co-relation 23444. Up to 8433 conditions per place. [2022-12-13 13:16:48,298 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 41 selfloop transitions, 8 changer transitions 0/49 dead transitions. [2022-12-13 13:16:48,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2022-12-13 13:16:48,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:16:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:16:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-12-13 13:16:48,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2022-12-13 13:16:48,302 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-12-13 13:16:48,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-12-13 13:16:48,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:48,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-12-13 13:16:48,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:48,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:48,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:48,304 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 389 transitions. [2022-12-13 13:16:48,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2022-12-13 13:16:48,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:16:48,311 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2022-12-13 13:16:48,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 13:16:48,311 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2022-12-13 13:16:48,311 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2022-12-13 13:16:48,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:48,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:48,312 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:48,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:16:48,312 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash 765296681, now seen corresponding path program 1 times [2022-12-13 13:16:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:48,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198324477] [2022-12-13 13:16:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:48,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:48,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198324477] [2022-12-13 13:16:48,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198324477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:48,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:48,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:16:48,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274353580] [2022-12-13 13:16:48,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:48,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:48,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:48,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:48,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:48,464 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:16:48,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:48,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:48,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:16:48,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:49,337 INFO L130 PetriNetUnfolder]: 7483/10332 cut-off events. [2022-12-13 13:16:49,337 INFO L131 PetriNetUnfolder]: For 3812/3812 co-relation queries the response was YES. [2022-12-13 13:16:49,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26408 conditions, 10332 events. 7483/10332 cut-off events. For 3812/3812 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 50821 event pairs, 1931 based on Foata normal form. 176/10508 useless extension candidates. Maximal degree in co-relation 26396. Up to 5349 conditions per place. [2022-12-13 13:16:49,384 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 13:16:49,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 330 flow [2022-12-13 13:16:49,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:16:49,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:16:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2022-12-13 13:16:49,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4970703125 [2022-12-13 13:16:49,387 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2022-12-13 13:16:49,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2022-12-13 13:16:49,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:49,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2022-12-13 13:16:49,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,390 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,390 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 509 transitions. [2022-12-13 13:16:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 330 flow [2022-12-13 13:16:49,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:16:49,413 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 164 flow [2022-12-13 13:16:49,413 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-13 13:16:49,413 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-13 13:16:49,413 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 164 flow [2022-12-13 13:16:49,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,414 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:49,414 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:16:49,414 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash -836249163, now seen corresponding path program 1 times [2022-12-13 13:16:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513977312] [2022-12-13 13:16:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:49,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:49,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:49,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513977312] [2022-12-13 13:16:49,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513977312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:49,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:49,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:16:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496207902] [2022-12-13 13:16:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:49,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:49,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:49,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:49,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:16:49,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:49,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:49,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:16:49,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:50,442 INFO L130 PetriNetUnfolder]: 7087/9792 cut-off events. [2022-12-13 13:16:50,442 INFO L131 PetriNetUnfolder]: For 7358/7358 co-relation queries the response was YES. [2022-12-13 13:16:50,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26571 conditions, 9792 events. 7087/9792 cut-off events. For 7358/7358 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 45906 event pairs, 2019 based on Foata normal form. 96/9888 useless extension candidates. Maximal degree in co-relation 26556. Up to 4989 conditions per place. [2022-12-13 13:16:50,471 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 50 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2022-12-13 13:16:50,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 388 flow [2022-12-13 13:16:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:16:50,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:16:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2022-12-13 13:16:50,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2022-12-13 13:16:50,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2022-12-13 13:16:50,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2022-12-13 13:16:50,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:50,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2022-12-13 13:16:50,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:50,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:50,475 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:50,475 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 164 flow. Second operand 4 states and 504 transitions. [2022-12-13 13:16:50,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 388 flow [2022-12-13 13:16:50,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:50,486 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 276 flow [2022-12-13 13:16:50,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-13 13:16:50,486 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-13 13:16:50,487 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 276 flow [2022-12-13 13:16:50,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:50,487 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:50,487 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:16:50,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1419951075, now seen corresponding path program 1 times [2022-12-13 13:16:50,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:50,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064802434] [2022-12-13 13:16:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:50,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064802434] [2022-12-13 13:16:50,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064802434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:50,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:50,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:50,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454080620] [2022-12-13 13:16:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:50,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:50,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:50,684 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:16:50,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:50,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:50,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:16:50,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:51,371 INFO L130 PetriNetUnfolder]: 4587/6869 cut-off events. [2022-12-13 13:16:51,372 INFO L131 PetriNetUnfolder]: For 8459/9103 co-relation queries the response was YES. [2022-12-13 13:16:51,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18651 conditions, 6869 events. 4587/6869 cut-off events. For 8459/9103 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 40821 event pairs, 804 based on Foata normal form. 601/7152 useless extension candidates. Maximal degree in co-relation 18632. Up to 4443 conditions per place. [2022-12-13 13:16:51,393 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 76 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2022-12-13 13:16:51,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 102 transitions, 738 flow [2022-12-13 13:16:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:16:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:16:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-12-13 13:16:51,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5109375 [2022-12-13 13:16:51,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-12-13 13:16:51,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-12-13 13:16:51,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:51,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-12-13 13:16:51,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,402 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 276 flow. Second operand 5 states and 654 transitions. [2022-12-13 13:16:51,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 102 transitions, 738 flow [2022-12-13 13:16:51,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 102 transitions, 725 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:51,412 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 347 flow [2022-12-13 13:16:51,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-13 13:16:51,413 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-12-13 13:16:51,413 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 347 flow [2022-12-13 13:16:51,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,413 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:51,413 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:51,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:16:51,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:51,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:51,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1128051867, now seen corresponding path program 1 times [2022-12-13 13:16:51,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:51,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78710929] [2022-12-13 13:16:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:51,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78710929] [2022-12-13 13:16:51,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78710929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:51,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:51,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960033493] [2022-12-13 13:16:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:51,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:51,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 13:16:51,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:51,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:51,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 13:16:51,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:52,806 INFO L130 PetriNetUnfolder]: 8058/11609 cut-off events. [2022-12-13 13:16:52,807 INFO L131 PetriNetUnfolder]: For 23476/23476 co-relation queries the response was YES. [2022-12-13 13:16:52,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43849 conditions, 11609 events. 8058/11609 cut-off events. For 23476/23476 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 64258 event pairs, 1233 based on Foata normal form. 84/11693 useless extension candidates. Maximal degree in co-relation 43826. Up to 5956 conditions per place. [2022-12-13 13:16:52,843 INFO L137 encePairwiseOnDemand]: 246/256 looper letters, 87 selfloop transitions, 38 changer transitions 18/143 dead transitions. [2022-12-13 13:16:52,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 143 transitions, 1130 flow [2022-12-13 13:16:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:16:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:16:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2022-12-13 13:16:52,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5015625 [2022-12-13 13:16:52,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2022-12-13 13:16:52,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2022-12-13 13:16:52,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:52,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2022-12-13 13:16:52,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,848 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 347 flow. Second operand 5 states and 642 transitions. [2022-12-13 13:16:52,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 143 transitions, 1130 flow [2022-12-13 13:16:52,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 143 transitions, 1115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:52,877 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 653 flow [2022-12-13 13:16:52,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-13 13:16:52,877 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2022-12-13 13:16:52,878 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 653 flow [2022-12-13 13:16:52,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:52,878 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:52,878 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:52,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:16:52,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 869243342, now seen corresponding path program 1 times [2022-12-13 13:16:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:52,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666350355] [2022-12-13 13:16:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:53,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666350355] [2022-12-13 13:16:53,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666350355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:53,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:53,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:16:53,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930670178] [2022-12-13 13:16:53,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:16:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:16:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:16:53,051 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:16:53,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 653 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:53,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:16:53,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:53,671 INFO L130 PetriNetUnfolder]: 3409/5371 cut-off events. [2022-12-13 13:16:53,671 INFO L131 PetriNetUnfolder]: For 13288/14469 co-relation queries the response was YES. [2022-12-13 13:16:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20819 conditions, 5371 events. 3409/5371 cut-off events. For 13288/14469 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 32547 event pairs, 300 based on Foata normal form. 689/5878 useless extension candidates. Maximal degree in co-relation 20792. Up to 2180 conditions per place. [2022-12-13 13:16:53,691 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 130 selfloop transitions, 14 changer transitions 2/175 dead transitions. [2022-12-13 13:16:53,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 175 transitions, 1807 flow [2022-12-13 13:16:53,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:16:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:16:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2022-12-13 13:16:53,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5123697916666666 [2022-12-13 13:16:53,693 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2022-12-13 13:16:53,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2022-12-13 13:16:53,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:53,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2022-12-13 13:16:53,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,696 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,696 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 653 flow. Second operand 6 states and 787 transitions. [2022-12-13 13:16:53,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 175 transitions, 1807 flow [2022-12-13 13:16:53,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 175 transitions, 1805 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:16:53,726 INFO L231 Difference]: Finished difference. Result has 65 places, 79 transitions, 771 flow [2022-12-13 13:16:53,726 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=771, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2022-12-13 13:16:53,727 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-12-13 13:16:53,727 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 771 flow [2022-12-13 13:16:53,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,727 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:53,727 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] [2022-12-13 13:16:53,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:16:53,727 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:53,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1261419043, now seen corresponding path program 1 times [2022-12-13 13:16:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:53,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65272085] [2022-12-13 13:16:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65272085] [2022-12-13 13:16:53,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65272085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:53,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:53,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:16:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196543924] [2022-12-13 13:16:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:53,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:16:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:53,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:16:53,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:16:53,879 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-12-13 13:16:53,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 79 transitions, 771 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:53,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:53,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-12-13 13:16:53,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:54,831 INFO L130 PetriNetUnfolder]: 5811/8806 cut-off events. [2022-12-13 13:16:54,831 INFO L131 PetriNetUnfolder]: For 40563/40563 co-relation queries the response was YES. [2022-12-13 13:16:54,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44021 conditions, 8806 events. 5811/8806 cut-off events. For 40563/40563 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 50245 event pairs, 876 based on Foata normal form. 40/8846 useless extension candidates. Maximal degree in co-relation 43990. Up to 3405 conditions per place. [2022-12-13 13:16:54,860 INFO L137 encePairwiseOnDemand]: 246/256 looper letters, 106 selfloop transitions, 35 changer transitions 48/189 dead transitions. [2022-12-13 13:16:54,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 189 transitions, 1977 flow [2022-12-13 13:16:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:16:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:16:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2022-12-13 13:16:54,862 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986979166666667 [2022-12-13 13:16:54,862 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2022-12-13 13:16:54,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2022-12-13 13:16:54,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:54,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2022-12-13 13:16:54,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 256.0) internal successors, (1792), 7 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:54,865 INFO L175 Difference]: Start difference. First operand has 65 places, 79 transitions, 771 flow. Second operand 6 states and 766 transitions. [2022-12-13 13:16:54,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 189 transitions, 1977 flow [2022-12-13 13:16:55,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 189 transitions, 1785 flow, removed 77 selfloop flow, removed 2 redundant places. [2022-12-13 13:16:55,128 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 728 flow [2022-12-13 13:16:55,128 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2022-12-13 13:16:55,128 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-12-13 13:16:55,128 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 728 flow [2022-12-13 13:16:55,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,129 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:55,129 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:55,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:16:55,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:55,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2010643441, now seen corresponding path program 1 times [2022-12-13 13:16:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:55,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787365569] [2022-12-13 13:16:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:55,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787365569] [2022-12-13 13:16:55,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787365569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:55,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:55,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:16:55,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42907648] [2022-12-13 13:16:55,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:55,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:16:55,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:55,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:16:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:16:55,298 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:16:55,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:55,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:16:55,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:55,876 INFO L130 PetriNetUnfolder]: 2257/3789 cut-off events. [2022-12-13 13:16:55,876 INFO L131 PetriNetUnfolder]: For 12718/13368 co-relation queries the response was YES. [2022-12-13 13:16:55,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 3789 events. 2257/3789 cut-off events. For 12718/13368 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 23654 event pairs, 225 based on Foata normal form. 440/4074 useless extension candidates. Maximal degree in co-relation 15955. Up to 1234 conditions per place. [2022-12-13 13:16:55,889 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 106 selfloop transitions, 18 changer transitions 26/176 dead transitions. [2022-12-13 13:16:55,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 176 transitions, 1982 flow [2022-12-13 13:16:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:16:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:16:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2022-12-13 13:16:55,891 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5122767857142857 [2022-12-13 13:16:55,891 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2022-12-13 13:16:55,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2022-12-13 13:16:55,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:55,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2022-12-13 13:16:55,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,894 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,894 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 728 flow. Second operand 7 states and 918 transitions. [2022-12-13 13:16:55,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 176 transitions, 1982 flow [2022-12-13 13:16:55,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 176 transitions, 1791 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-13 13:16:55,919 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 777 flow [2022-12-13 13:16:55,919 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=777, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2022-12-13 13:16:55,919 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-12-13 13:16:55,919 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 777 flow [2022-12-13 13:16:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:55,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:55,920 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:16:55,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -535416278, now seen corresponding path program 1 times [2022-12-13 13:16:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:55,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793364269] [2022-12-13 13:16:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:56,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793364269] [2022-12-13 13:16:56,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793364269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:56,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:56,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:16:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102006790] [2022-12-13 13:16:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:16:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:16:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:16:56,039 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 256 [2022-12-13 13:16:56,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 78 transitions, 777 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:56,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 256 [2022-12-13 13:16:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:56,649 INFO L130 PetriNetUnfolder]: 3153/5479 cut-off events. [2022-12-13 13:16:56,649 INFO L131 PetriNetUnfolder]: For 22615/22831 co-relation queries the response was YES. [2022-12-13 13:16:56,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25988 conditions, 5479 events. 3153/5479 cut-off events. For 22615/22831 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 36529 event pairs, 645 based on Foata normal form. 38/5446 useless extension candidates. Maximal degree in co-relation 25956. Up to 2563 conditions per place. [2022-12-13 13:16:56,667 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 81 selfloop transitions, 2 changer transitions 47/150 dead transitions. [2022-12-13 13:16:56,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1644 flow [2022-12-13 13:16:56,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:16:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:16:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2022-12-13 13:16:56,669 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2022-12-13 13:16:56,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2022-12-13 13:16:56,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2022-12-13 13:16:56,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:56,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2022-12-13 13:16:56,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,671 INFO L175 Difference]: Start difference. First operand has 70 places, 78 transitions, 777 flow. Second operand 4 states and 536 transitions. [2022-12-13 13:16:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1644 flow [2022-12-13 13:16:56,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1466 flow, removed 72 selfloop flow, removed 2 redundant places. [2022-12-13 13:16:56,870 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 671 flow [2022-12-13 13:16:56,870 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2022-12-13 13:16:56,870 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2022-12-13 13:16:56,871 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 671 flow [2022-12-13 13:16:56,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:56,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:56,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:56,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:16:56,871 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1391684130, now seen corresponding path program 1 times [2022-12-13 13:16:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:56,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423517409] [2022-12-13 13:16:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:56,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:57,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:57,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423517409] [2022-12-13 13:16:57,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423517409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:57,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:57,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:16:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685631406] [2022-12-13 13:16:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:57,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:16:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:57,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:16:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:16:57,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:16:57,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 671 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:57,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:16:57,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:57,612 INFO L130 PetriNetUnfolder]: 2416/4192 cut-off events. [2022-12-13 13:16:57,612 INFO L131 PetriNetUnfolder]: For 13037/13618 co-relation queries the response was YES. [2022-12-13 13:16:57,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17267 conditions, 4192 events. 2416/4192 cut-off events. For 13037/13618 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 28396 event pairs, 248 based on Foata normal form. 246/4242 useless extension candidates. Maximal degree in co-relation 17233. Up to 1213 conditions per place. [2022-12-13 13:16:57,626 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 43 selfloop transitions, 21 changer transitions 97/167 dead transitions. [2022-12-13 13:16:57,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 167 transitions, 1730 flow [2022-12-13 13:16:57,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:16:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:16:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1154 transitions. [2022-12-13 13:16:57,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008680555555556 [2022-12-13 13:16:57,628 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1154 transitions. [2022-12-13 13:16:57,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1154 transitions. [2022-12-13 13:16:57,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:57,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1154 transitions. [2022-12-13 13:16:57,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.22222222222223) internal successors, (1154), 9 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,632 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,632 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 671 flow. Second operand 9 states and 1154 transitions. [2022-12-13 13:16:57,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 167 transitions, 1730 flow [2022-12-13 13:16:57,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 167 transitions, 1671 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 13:16:57,742 INFO L231 Difference]: Finished difference. Result has 80 places, 48 transitions, 393 flow [2022-12-13 13:16:57,743 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=393, PETRI_PLACES=80, PETRI_TRANSITIONS=48} [2022-12-13 13:16:57,743 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2022-12-13 13:16:57,743 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 48 transitions, 393 flow [2022-12-13 13:16:57,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:57,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:57,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:16:57,744 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:57,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:57,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1503333127, now seen corresponding path program 1 times [2022-12-13 13:16:57,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:57,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303764367] [2022-12-13 13:16:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:57,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:57,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303764367] [2022-12-13 13:16:57,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303764367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:57,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:57,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:16:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973483847] [2022-12-13 13:16:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:57,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:16:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:16:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:16:57,852 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 256 [2022-12-13 13:16:57,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 48 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:57,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:57,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 256 [2022-12-13 13:16:57,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:58,038 INFO L130 PetriNetUnfolder]: 807/1510 cut-off events. [2022-12-13 13:16:58,038 INFO L131 PetriNetUnfolder]: For 5937/6017 co-relation queries the response was YES. [2022-12-13 13:16:58,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 1510 events. 807/1510 cut-off events. For 5937/6017 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8653 event pairs, 408 based on Foata normal form. 1/1464 useless extension candidates. Maximal degree in co-relation 6943. Up to 917 conditions per place. [2022-12-13 13:16:58,042 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 43 selfloop transitions, 2 changer transitions 24/72 dead transitions. [2022-12-13 13:16:58,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 737 flow [2022-12-13 13:16:58,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:16:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:16:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2022-12-13 13:16:58,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.515625 [2022-12-13 13:16:58,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2022-12-13 13:16:58,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2022-12-13 13:16:58,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:58,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2022-12-13 13:16:58,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,046 INFO L175 Difference]: Start difference. First operand has 80 places, 48 transitions, 393 flow. Second operand 3 states and 396 transitions. [2022-12-13 13:16:58,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 737 flow [2022-12-13 13:16:58,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 538 flow, removed 45 selfloop flow, removed 17 redundant places. [2022-12-13 13:16:58,067 INFO L231 Difference]: Finished difference. Result has 63 places, 38 transitions, 205 flow [2022-12-13 13:16:58,067 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=63, PETRI_TRANSITIONS=38} [2022-12-13 13:16:58,067 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2022-12-13 13:16:58,067 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 38 transitions, 205 flow [2022-12-13 13:16:58,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,068 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:58,068 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:16:58,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1291519295, now seen corresponding path program 2 times [2022-12-13 13:16:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431473874] [2022-12-13 13:16:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:16:58,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:58,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431473874] [2022-12-13 13:16:58,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431473874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:16:58,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:16:58,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:16:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632914409] [2022-12-13 13:16:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:16:58,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:16:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:16:58,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:16:58,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:16:58,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:16:58,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 38 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:16:58,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:16:58,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:16:58,896 INFO L130 PetriNetUnfolder]: 152/318 cut-off events. [2022-12-13 13:16:58,896 INFO L131 PetriNetUnfolder]: For 546/558 co-relation queries the response was YES. [2022-12-13 13:16:58,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 318 events. 152/318 cut-off events. For 546/558 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1257 event pairs, 20 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1207. Up to 104 conditions per place. [2022-12-13 13:16:58,897 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 34 selfloop transitions, 4 changer transitions 34/76 dead transitions. [2022-12-13 13:16:58,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 76 transitions, 564 flow [2022-12-13 13:16:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:16:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:16:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 985 transitions. [2022-12-13 13:16:58,899 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48095703125 [2022-12-13 13:16:58,899 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 985 transitions. [2022-12-13 13:16:58,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 985 transitions. [2022-12-13 13:16:58,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:16:58,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 985 transitions. [2022-12-13 13:16:58,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.125) internal successors, (985), 8 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,903 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,903 INFO L175 Difference]: Start difference. First operand has 63 places, 38 transitions, 205 flow. Second operand 8 states and 985 transitions. [2022-12-13 13:16:58,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 76 transitions, 564 flow [2022-12-13 13:16:58,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 521 flow, removed 10 selfloop flow, removed 10 redundant places. [2022-12-13 13:16:58,905 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 189 flow [2022-12-13 13:16:58,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2022-12-13 13:16:58,906 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-12-13 13:16:58,906 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 189 flow [2022-12-13 13:16:58,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:16:58,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:16:58,906 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:58,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:16:58,906 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:16:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:16:58,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1211657761, now seen corresponding path program 3 times [2022-12-13 13:16:58,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:16:58,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020922018] [2022-12-13 13:16:58,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:58,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:16:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:58,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:16:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:16:58,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:16:58,981 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:16:58,981 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 13:16:58,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 13:16:58,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 13:16:58,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 13:16:58,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 13:16:58,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 13:16:58,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 13:16:58,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:16:58,984 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:16:58,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:16:58,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:16:59,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:16:59 BasicIcfg [2022-12-13 13:16:59,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:16:59,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:16:59,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:16:59,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:16:59,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:16:42" (3/4) ... [2022-12-13 13:16:59,039 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:16:59,092 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:16:59,092 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:16:59,092 INFO L158 Benchmark]: Toolchain (without parser) took 17115.45ms. Allocated memory was 138.4MB in the beginning and 1.1GB in the end (delta: 964.7MB). Free memory was 94.9MB in the beginning and 481.8MB in the end (delta: -386.9MB). Peak memory consumption was 579.4MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,093 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 138.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:16:59,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.86ms. Allocated memory is still 138.4MB. Free memory was 94.9MB in the beginning and 66.6MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,093 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.36ms. Allocated memory is still 138.4MB. Free memory was 66.1MB in the beginning and 63.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,093 INFO L158 Benchmark]: Boogie Preprocessor took 21.91ms. Allocated memory is still 138.4MB. Free memory was 63.4MB in the beginning and 61.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,094 INFO L158 Benchmark]: RCFGBuilder took 573.16ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 61.4MB in the beginning and 109.5MB in the end (delta: -48.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,094 INFO L158 Benchmark]: TraceAbstraction took 16051.51ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 108.6MB in the beginning and 497.5MB in the end (delta: -388.9MB). Peak memory consumption was 547.3MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,094 INFO L158 Benchmark]: Witness Printer took 55.24ms. Allocated memory is still 1.1GB. Free memory was 497.5MB in the beginning and 481.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 13:16:59,096 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.11ms. Allocated memory is still 138.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.86ms. Allocated memory is still 138.4MB. Free memory was 94.9MB in the beginning and 66.6MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.36ms. Allocated memory is still 138.4MB. Free memory was 66.1MB in the beginning and 63.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.91ms. Allocated memory is still 138.4MB. Free memory was 63.4MB in the beginning and 61.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.16ms. Allocated memory was 138.4MB in the beginning and 167.8MB in the end (delta: 29.4MB). Free memory was 61.4MB in the beginning and 109.5MB in the end (delta: -48.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16051.51ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 935.3MB). Free memory was 108.6MB in the beginning and 497.5MB in the end (delta: -388.9MB). Peak memory consumption was 547.3MB. Max. memory is 16.1GB. * Witness Printer took 55.24ms. Allocated memory is still 1.1GB. Free memory was 497.5MB in the beginning and 481.8MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 144 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 29 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 7607 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3369, independent: 3155, independent conditional: 0, independent unconditional: 3155, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1671, independent: 1631, independent conditional: 0, independent unconditional: 1631, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3369, independent: 1524, independent conditional: 0, independent unconditional: 1524, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 1671, unknown conditional: 0, unknown unconditional: 1671] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t181; [L870] FCALL, FORK 0 pthread_create(&t181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t181, ((void *)0), P0, ((void *)0))=-3, t181={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t182; [L872] FCALL, FORK 0 pthread_create(&t182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t182, ((void *)0), P1, ((void *)0))=-2, t181={5:0}, t182={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t183; [L874] FCALL, FORK 0 pthread_create(&t183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t183, ((void *)0), P2, ((void *)0))=-1, t181={5:0}, t182={6:0}, t183={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t184; [L876] FCALL, FORK 0 pthread_create(&t184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t184, ((void *)0), P3, ((void *)0))=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t181={5:0}, t182={6:0}, t183={7:0}, t184={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 589 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1471 IncrementalHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 44 mSDtfsCounter, 1471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=777occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 1400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:16:59,113 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fffbba00-73fa-4c72-9ffb-586c1014997d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE