./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:42:47,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:42:47,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:42:47,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:42:47,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:42:47,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:42:47,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:42:47,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:42:47,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:42:47,774 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:42:47,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:42:47,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:42:47,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:42:47,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:42:47,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:42:47,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:42:47,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:42:47,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:42:47,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:42:47,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:42:47,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:42:47,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:42:47,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:42:47,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:42:47,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:42:47,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:42:47,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:42:47,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:42:47,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:42:47,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:42:47,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:42:47,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:42:47,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:42:47,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:42:47,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:42:47,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:42:47,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:42:47,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:42:47,846 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:42:47,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:42:47,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:42:47,851 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:42:47,903 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:42:47,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:42:47,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:42:47,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:42:47,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:42:47,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:42:47,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:42:47,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:42:47,907 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:42:47,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:42:47,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:42:47,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:42:47,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:42:47,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:42:47,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:42:47,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:42:47,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:42:47,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:42:47,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:42:47,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:42:47,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:42:47,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:42:47,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:42:47,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:42:47,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:42:47,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:42:47,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:42:47,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:42:47,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:42:47,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:42:47,916 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:42:47,916 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:42:47,917 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:42:47,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:42:47,917 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_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2022-11-25 16:42:48,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:42:48,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:42:48,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:42:48,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:42:48,364 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:42:48,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-11-25 16:42:51,983 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:42:52,298 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:42:52,299 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2022-11-25 16:42:52,316 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/data/d0da7a032/e47a1dbf035049248acd9244cb18de3f/FLAG10da6e146 [2022-11-25 16:42:52,341 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/data/d0da7a032/e47a1dbf035049248acd9244cb18de3f [2022-11-25 16:42:52,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:42:52,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:42:52,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:42:52,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:42:52,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:42:52,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:52" (1/1) ... [2022-11-25 16:42:52,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4273c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:52, skipping insertion in model container [2022-11-25 16:42:52,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:52" (1/1) ... [2022-11-25 16:42:52,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:42:52,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:42:52,621 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_d957f47e-4e2d-44ca-88d8-52caeab62ebc/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-11-25 16:42:52,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:52,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:52,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,023 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:42:53,054 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:42:53,078 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_d957f47e-4e2d-44ca-88d8-52caeab62ebc/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2022-11-25 16:42:53,128 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:42:53,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:42:53,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:42:53,255 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:42:53,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53 WrapperNode [2022-11-25 16:42:53,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:42:53,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:42:53,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:42:53,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:42:53,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,359 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-25 16:42:53,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:42:53,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:42:53,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:42:53,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:42:53,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,445 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:42:53,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:42:53,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:42:53,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:42:53,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (1/1) ... [2022-11-25 16:42:53,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:42:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:53,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:42:53,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:42:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:42:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:42:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:42:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:42:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:42:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:42:53,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:42:53,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:42:53,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:42:53,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:42:53,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:42:53,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:42:53,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:42:53,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:42:53,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:42:53,584 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:42:53,753 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:42:53,756 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:42:54,251 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:42:54,485 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:42:54,485 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:42:54,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:54 BoogieIcfgContainer [2022-11-25 16:42:54,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:42:54,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:42:54,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:42:54,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:42:54,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:42:52" (1/3) ... [2022-11-25 16:42:54,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023d648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:42:54, skipping insertion in model container [2022-11-25 16:42:54,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:53" (2/3) ... [2022-11-25 16:42:54,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3023d648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:42:54, skipping insertion in model container [2022-11-25 16:42:54,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:54" (3/3) ... [2022-11-25 16:42:54,507 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-11-25 16:42:54,522 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:42:54,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:42:54,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:42:54,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:42:54,671 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:42:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-25 16:42:54,852 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-25 16:42:54,853 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:42:54,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 16:42:54,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-25 16:42:54,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-25 16:42:54,869 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:42:54,885 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-11-25 16:42:54,889 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-11-25 16:42:54,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-11-25 16:42:54,920 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-25 16:42:54,921 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:42:54,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 16:42:54,924 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2022-11-25 16:43:00,979 INFO L134 LiptonReduction]: Checked pairs total: 5026 [2022-11-25 16:43:00,979 INFO L136 LiptonReduction]: Total number of compositions: 99 [2022-11-25 16:43:00,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:43:01,009 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;@261822e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:43:01,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 16:43:01,016 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 16:43:01,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:43:01,024 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:01,025 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 16:43:01,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 469356448, now seen corresponding path program 1 times [2022-11-25 16:43:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:01,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546712316] [2022-11-25 16:43:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:01,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:01,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546712316] [2022-11-25 16:43:01,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546712316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:01,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:01,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:43:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571440145] [2022-11-25 16:43:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:43:01,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:43:01,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:43:01,672 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 213 [2022-11-25 16:43:01,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:01,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:01,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 213 [2022-11-25 16:43:01,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:02,176 INFO L130 PetriNetUnfolder]: 855/1390 cut-off events. [2022-11-25 16:43:02,176 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 16:43:02,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1390 events. 855/1390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7264 event pairs, 141 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 2706. Up to 1027 conditions per place. [2022-11-25 16:43:02,199 INFO L137 encePairwiseOnDemand]: 209/213 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-11-25 16:43:02,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2022-11-25 16:43:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:43:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:43:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-25 16:43:02,233 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5258215962441315 [2022-11-25 16:43:02,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-25 16:43:02,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-25 16:43:02,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:02,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-25 16:43:02,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:02,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:02,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:02,262 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 336 transitions. [2022-11-25 16:43:02,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2022-11-25 16:43:02,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:43:02,269 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 16:43:02,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 16:43:02,277 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 16:43:02,278 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 16:43:02,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:02,279 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:02,279 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:02,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:43:02,280 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 884554987, now seen corresponding path program 1 times [2022-11-25 16:43:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:02,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183789957] [2022-11-25 16:43:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:03,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:03,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183789957] [2022-11-25 16:43:03,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183789957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:03,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:03,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:03,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555129077] [2022-11-25 16:43:03,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:03,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:03,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:03,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:03,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:03,238 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 213 [2022-11-25 16:43:03,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 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-11-25 16:43:03,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:03,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 213 [2022-11-25 16:43:03,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:04,053 INFO L130 PetriNetUnfolder]: 1135/1734 cut-off events. [2022-11-25 16:43:04,054 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-11-25 16:43:04,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1734 events. 1135/1734 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8142 event pairs, 175 based on Foata normal form. 95/1825 useless extension candidates. Maximal degree in co-relation 3628. Up to 1113 conditions per place. [2022-11-25 16:43:04,067 INFO L137 encePairwiseOnDemand]: 202/213 looper letters, 29 selfloop transitions, 9 changer transitions 25/65 dead transitions. [2022-11-25 16:43:04,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 65 transitions, 276 flow [2022-11-25 16:43:04,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:43:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:43:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 703 transitions. [2022-11-25 16:43:04,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47149564050972503 [2022-11-25 16:43:04,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 703 transitions. [2022-11-25 16:43:04,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 703 transitions. [2022-11-25 16:43:04,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:04,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 703 transitions. [2022-11-25 16:43:04,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.42857142857143) internal successors, (703), 7 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:04,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:04,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:04,085 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 7 states and 703 transitions. [2022-11-25 16:43:04,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 65 transitions, 276 flow [2022-11-25 16:43:04,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:04,090 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 121 flow [2022-11-25 16:43:04,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-11-25 16:43:04,092 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-11-25 16:43:04,092 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 121 flow [2022-11-25 16:43:04,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 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-11-25 16:43:04,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:04,094 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:04,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:43:04,094 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1651385614, now seen corresponding path program 1 times [2022-11-25 16:43:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:04,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255629533] [2022-11-25 16:43:04,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:04,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:04,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255629533] [2022-11-25 16:43:04,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255629533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:04,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:04,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75269252] [2022-11-25 16:43:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:04,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 213 [2022-11-25 16:43:04,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:04,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:04,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 213 [2022-11-25 16:43:04,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:05,948 INFO L130 PetriNetUnfolder]: 1496/2259 cut-off events. [2022-11-25 16:43:05,948 INFO L131 PetriNetUnfolder]: For 2806/2806 co-relation queries the response was YES. [2022-11-25 16:43:05,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7314 conditions, 2259 events. 1496/2259 cut-off events. For 2806/2806 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10964 event pairs, 162 based on Foata normal form. 110/2369 useless extension candidates. Maximal degree in co-relation 7299. Up to 1138 conditions per place. [2022-11-25 16:43:05,972 INFO L137 encePairwiseOnDemand]: 201/213 looper letters, 43 selfloop transitions, 24 changer transitions 38/106 dead transitions. [2022-11-25 16:43:05,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 106 transitions, 684 flow [2022-11-25 16:43:05,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:43:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:43:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 896 transitions. [2022-11-25 16:43:05,976 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46739697443922795 [2022-11-25 16:43:05,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 896 transitions. [2022-11-25 16:43:05,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 896 transitions. [2022-11-25 16:43:05,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:05,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 896 transitions. [2022-11-25 16:43:05,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.55555555555556) internal successors, (896), 9 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:05,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:05,987 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:05,988 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 121 flow. Second operand 9 states and 896 transitions. [2022-11-25 16:43:05,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 106 transitions, 684 flow [2022-11-25 16:43:06,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 106 transitions, 634 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-25 16:43:06,014 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 325 flow [2022-11-25 16:43:06,014 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=325, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-11-25 16:43:06,016 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2022-11-25 16:43:06,016 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 325 flow [2022-11-25 16:43:06,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:06,017 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:06,017 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:06,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:43:06,018 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:06,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1606670284, now seen corresponding path program 2 times [2022-11-25 16:43:06,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:06,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38873456] [2022-11-25 16:43:06,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:06,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:06,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38873456] [2022-11-25 16:43:06,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38873456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:06,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:06,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204350864] [2022-11-25 16:43:06,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:06,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:06,377 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:06,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 325 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:06,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:06,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:06,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:07,184 INFO L130 PetriNetUnfolder]: 1571/2390 cut-off events. [2022-11-25 16:43:07,185 INFO L131 PetriNetUnfolder]: For 9824/9874 co-relation queries the response was YES. [2022-11-25 16:43:07,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11042 conditions, 2390 events. 1571/2390 cut-off events. For 9824/9874 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11866 event pairs, 195 based on Foata normal form. 118/2472 useless extension candidates. Maximal degree in co-relation 11021. Up to 1347 conditions per place. [2022-11-25 16:43:07,207 INFO L137 encePairwiseOnDemand]: 208/213 looper letters, 39 selfloop transitions, 3 changer transitions 49/93 dead transitions. [2022-11-25 16:43:07,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 856 flow [2022-11-25 16:43:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2022-11-25 16:43:07,212 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4953051643192488 [2022-11-25 16:43:07,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 633 transitions. [2022-11-25 16:43:07,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions. [2022-11-25 16:43:07,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:07,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions. [2022-11-25 16:43:07,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:07,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:07,225 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:07,225 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 325 flow. Second operand 6 states and 633 transitions. [2022-11-25 16:43:07,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 856 flow [2022-11-25 16:43:07,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 93 transitions, 790 flow, removed 33 selfloop flow, removed 3 redundant places. [2022-11-25 16:43:07,263 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 198 flow [2022-11-25 16:43:07,263 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=198, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2022-11-25 16:43:07,265 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 16:43:07,266 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 198 flow [2022-11-25 16:43:07,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:07,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:07,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:07,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:43:07,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1440358670, now seen corresponding path program 1 times [2022-11-25 16:43:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:07,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219610917] [2022-11-25 16:43:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:07,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:08,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219610917] [2022-11-25 16:43:08,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219610917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:08,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:08,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10513583] [2022-11-25 16:43:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:08,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:43:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:43:08,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:43:08,518 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 213 [2022-11-25 16:43:08,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:08,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:08,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 213 [2022-11-25 16:43:08,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:09,401 INFO L130 PetriNetUnfolder]: 1388/2167 cut-off events. [2022-11-25 16:43:09,402 INFO L131 PetriNetUnfolder]: For 5270/5270 co-relation queries the response was YES. [2022-11-25 16:43:09,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8576 conditions, 2167 events. 1388/2167 cut-off events. For 5270/5270 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10279 event pairs, 204 based on Foata normal form. 114/2281 useless extension candidates. Maximal degree in co-relation 8561. Up to 989 conditions per place. [2022-11-25 16:43:09,417 INFO L137 encePairwiseOnDemand]: 203/213 looper letters, 53 selfloop transitions, 15 changer transitions 32/101 dead transitions. [2022-11-25 16:43:09,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 826 flow [2022-11-25 16:43:09,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:43:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 16:43:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2022-11-25 16:43:09,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45774647887323944 [2022-11-25 16:43:09,421 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2022-11-25 16:43:09,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2022-11-25 16:43:09,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:09,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2022-11-25 16:43:09,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.5) internal successors, (975), 10 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:09,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 213.0) internal successors, (2343), 11 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:09,430 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 213.0) internal successors, (2343), 11 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:09,430 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 198 flow. Second operand 10 states and 975 transitions. [2022-11-25 16:43:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 826 flow [2022-11-25 16:43:09,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 101 transitions, 642 flow, removed 45 selfloop flow, removed 12 redundant places. [2022-11-25 16:43:09,454 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 263 flow [2022-11-25 16:43:09,455 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=263, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-11-25 16:43:09,457 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-11-25 16:43:09,458 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 263 flow [2022-11-25 16:43:09,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:09,458 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:09,459 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:09,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:43:09,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash -552529715, now seen corresponding path program 1 times [2022-11-25 16:43:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:09,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463325190] [2022-11-25 16:43:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463325190] [2022-11-25 16:43:10,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463325190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:10,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:43:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503635754] [2022-11-25 16:43:10,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:10,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:43:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:43:10,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:43:10,263 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:10,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 263 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:10,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:10,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:10,870 INFO L130 PetriNetUnfolder]: 1181/1902 cut-off events. [2022-11-25 16:43:10,870 INFO L131 PetriNetUnfolder]: For 8168/8186 co-relation queries the response was YES. [2022-11-25 16:43:10,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7801 conditions, 1902 events. 1181/1902 cut-off events. For 8168/8186 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9121 event pairs, 538 based on Foata normal form. 100/1991 useless extension candidates. Maximal degree in co-relation 7786. Up to 1567 conditions per place. [2022-11-25 16:43:10,886 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 49 selfloop transitions, 12 changer transitions 16/81 dead transitions. [2022-11-25 16:43:10,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 669 flow [2022-11-25 16:43:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2022-11-25 16:43:10,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49061032863849763 [2022-11-25 16:43:10,890 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2022-11-25 16:43:10,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2022-11-25 16:43:10,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:10,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2022-11-25 16:43:10,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,897 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,897 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 263 flow. Second operand 6 states and 627 transitions. [2022-11-25 16:43:10,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 669 flow [2022-11-25 16:43:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 595 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-11-25 16:43:10,917 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 338 flow [2022-11-25 16:43:10,918 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-11-25 16:43:10,921 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-11-25 16:43:10,921 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 338 flow [2022-11-25 16:43:10,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:10,922 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:10,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:43:10,922 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:10,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2067804970, now seen corresponding path program 1 times [2022-11-25 16:43:10,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:10,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841862938] [2022-11-25 16:43:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:10,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:11,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:11,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841862938] [2022-11-25 16:43:11,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841862938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:11,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:11,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:11,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113686674] [2022-11-25 16:43:11,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:11,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:43:11,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:43:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:43:11,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 213 [2022-11-25 16:43:11,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:11,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:11,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 213 [2022-11-25 16:43:11,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:12,498 INFO L130 PetriNetUnfolder]: 1155/1847 cut-off events. [2022-11-25 16:43:12,498 INFO L131 PetriNetUnfolder]: For 6863/6888 co-relation queries the response was YES. [2022-11-25 16:43:12,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7969 conditions, 1847 events. 1155/1847 cut-off events. For 6863/6888 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8605 event pairs, 466 based on Foata normal form. 50/1896 useless extension candidates. Maximal degree in co-relation 7953. Up to 1608 conditions per place. [2022-11-25 16:43:12,523 INFO L137 encePairwiseOnDemand]: 204/213 looper letters, 55 selfloop transitions, 13 changer transitions 20/92 dead transitions. [2022-11-25 16:43:12,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 804 flow [2022-11-25 16:43:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:43:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:43:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2022-11-25 16:43:12,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4835680751173709 [2022-11-25 16:43:12,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2022-11-25 16:43:12,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2022-11-25 16:43:12,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:12,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2022-11-25 16:43:12,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:12,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:12,535 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:12,535 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 338 flow. Second operand 7 states and 721 transitions. [2022-11-25 16:43:12,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 804 flow [2022-11-25 16:43:12,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 92 transitions, 790 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-11-25 16:43:12,551 INFO L231 Difference]: Finished difference. Result has 60 places, 54 transitions, 456 flow [2022-11-25 16:43:12,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=60, PETRI_TRANSITIONS=54} [2022-11-25 16:43:12,552 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 26 predicate places. [2022-11-25 16:43:12,552 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 456 flow [2022-11-25 16:43:12,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:12,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:12,555 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:12,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:43:12,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:12,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash -328850976, now seen corresponding path program 2 times [2022-11-25 16:43:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:12,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547961174] [2022-11-25 16:43:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:12,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:13,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547961174] [2022-11-25 16:43:13,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547961174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:13,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:13,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432966872] [2022-11-25 16:43:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:13,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:43:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:13,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:43:13,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:43:13,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:13,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 456 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:13,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:13,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:13,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:14,122 INFO L130 PetriNetUnfolder]: 1154/1852 cut-off events. [2022-11-25 16:43:14,123 INFO L131 PetriNetUnfolder]: For 10337/10363 co-relation queries the response was YES. [2022-11-25 16:43:14,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9062 conditions, 1852 events. 1154/1852 cut-off events. For 10337/10363 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8658 event pairs, 479 based on Foata normal form. 51/1902 useless extension candidates. Maximal degree in co-relation 9042. Up to 1612 conditions per place. [2022-11-25 16:43:14,142 INFO L137 encePairwiseOnDemand]: 204/213 looper letters, 56 selfloop transitions, 17 changer transitions 14/91 dead transitions. [2022-11-25 16:43:14,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 91 transitions, 926 flow [2022-11-25 16:43:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2022-11-25 16:43:14,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49061032863849763 [2022-11-25 16:43:14,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2022-11-25 16:43:14,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2022-11-25 16:43:14,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:14,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2022-11-25 16:43:14,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:14,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:14,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:14,155 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 456 flow. Second operand 6 states and 627 transitions. [2022-11-25 16:43:14,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 91 transitions, 926 flow [2022-11-25 16:43:14,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 91 transitions, 882 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:14,175 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 574 flow [2022-11-25 16:43:14,175 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2022-11-25 16:43:14,178 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-11-25 16:43:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 574 flow [2022-11-25 16:43:14,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:14,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:14,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:14,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:43:14,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:14,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1964989786, now seen corresponding path program 3 times [2022-11-25 16:43:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:14,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23326287] [2022-11-25 16:43:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:14,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23326287] [2022-11-25 16:43:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23326287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:14,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:14,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551329894] [2022-11-25 16:43:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:14,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:43:14,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:43:14,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:43:14,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:14,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 574 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:14,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:14,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:14,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:15,625 INFO L130 PetriNetUnfolder]: 1346/2140 cut-off events. [2022-11-25 16:43:15,625 INFO L131 PetriNetUnfolder]: For 17840/17881 co-relation queries the response was YES. [2022-11-25 16:43:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11434 conditions, 2140 events. 1346/2140 cut-off events. For 17840/17881 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10487 event pairs, 630 based on Foata normal form. 111/2229 useless extension candidates. Maximal degree in co-relation 11413. Up to 1605 conditions per place. [2022-11-25 16:43:15,645 INFO L137 encePairwiseOnDemand]: 206/213 looper letters, 54 selfloop transitions, 20 changer transitions 20/98 dead transitions. [2022-11-25 16:43:15,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 1112 flow [2022-11-25 16:43:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:15,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:15,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2022-11-25 16:43:15,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48826291079812206 [2022-11-25 16:43:15,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 624 transitions. [2022-11-25 16:43:15,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 624 transitions. [2022-11-25 16:43:15,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:15,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 624 transitions. [2022-11-25 16:43:15,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:15,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:15,655 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:15,656 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 574 flow. Second operand 6 states and 624 transitions. [2022-11-25 16:43:15,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 1112 flow [2022-11-25 16:43:15,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 1070 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-11-25 16:43:15,683 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 695 flow [2022-11-25 16:43:15,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=695, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2022-11-25 16:43:15,684 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2022-11-25 16:43:15,684 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 695 flow [2022-11-25 16:43:15,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:15,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:15,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:15,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:43:15,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:15,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1581210683, now seen corresponding path program 1 times [2022-11-25 16:43:15,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:15,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917015170] [2022-11-25 16:43:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:15,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:15,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917015170] [2022-11-25 16:43:15,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917015170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:15,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:15,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:43:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731145322] [2022-11-25 16:43:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:15,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:43:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:15,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:43:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:43:15,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:15,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:15,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:15,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:16,419 INFO L130 PetriNetUnfolder]: 824/1380 cut-off events. [2022-11-25 16:43:16,420 INFO L131 PetriNetUnfolder]: For 21582/21700 co-relation queries the response was YES. [2022-11-25 16:43:16,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8798 conditions, 1380 events. 824/1380 cut-off events. For 21582/21700 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7024 event pairs, 152 based on Foata normal form. 239/1611 useless extension candidates. Maximal degree in co-relation 8774. Up to 832 conditions per place. [2022-11-25 16:43:16,433 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 60 selfloop transitions, 4 changer transitions 58/129 dead transitions. [2022-11-25 16:43:16,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 1710 flow [2022-11-25 16:43:16,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:43:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:43:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-11-25 16:43:16,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5004694835680751 [2022-11-25 16:43:16,437 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2022-11-25 16:43:16,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2022-11-25 16:43:16,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:16,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2022-11-25 16:43:16,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:16,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:16,442 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 213.0) internal successors, (1278), 6 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:16,442 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 695 flow. Second operand 5 states and 533 transitions. [2022-11-25 16:43:16,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 1710 flow [2022-11-25 16:43:16,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 1528 flow, removed 62 selfloop flow, removed 6 redundant places. [2022-11-25 16:43:16,469 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 523 flow [2022-11-25 16:43:16,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=523, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2022-11-25 16:43:16,470 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-11-25 16:43:16,470 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 523 flow [2022-11-25 16:43:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:16,471 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:16,471 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:43:16,472 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1174257711, now seen corresponding path program 1 times [2022-11-25 16:43:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577220663] [2022-11-25 16:43:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:16,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:16,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577220663] [2022-11-25 16:43:16,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577220663] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:16,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:16,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:43:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730977358] [2022-11-25 16:43:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:16,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:43:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:43:16,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:16,722 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:16,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 523 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:16,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:16,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:16,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:17,107 INFO L130 PetriNetUnfolder]: 386/707 cut-off events. [2022-11-25 16:43:17,108 INFO L131 PetriNetUnfolder]: For 9557/9607 co-relation queries the response was YES. [2022-11-25 16:43:17,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4361 conditions, 707 events. 386/707 cut-off events. For 9557/9607 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3337 event pairs, 40 based on Foata normal form. 122/821 useless extension candidates. Maximal degree in co-relation 4335. Up to 314 conditions per place. [2022-11-25 16:43:17,115 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 64 selfloop transitions, 7 changer transitions 38/116 dead transitions. [2022-11-25 16:43:17,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 1435 flow [2022-11-25 16:43:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:17,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:43:17,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 638 transitions. [2022-11-25 16:43:17,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49921752738654146 [2022-11-25 16:43:17,120 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 638 transitions. [2022-11-25 16:43:17,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 638 transitions. [2022-11-25 16:43:17,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:17,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 638 transitions. [2022-11-25 16:43:17,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.33333333333333) internal successors, (638), 6 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,128 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,128 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 523 flow. Second operand 6 states and 638 transitions. [2022-11-25 16:43:17,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 1435 flow [2022-11-25 16:43:17,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 1421 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-11-25 16:43:17,143 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 507 flow [2022-11-25 16:43:17,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2022-11-25 16:43:17,144 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2022-11-25 16:43:17,144 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 507 flow [2022-11-25 16:43:17,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:17,145 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-11-25 16:43:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:43:17,146 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash -975801972, now seen corresponding path program 1 times [2022-11-25 16:43:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226179512] [2022-11-25 16:43:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:17,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226179512] [2022-11-25 16:43:17,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226179512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:17,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:17,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:43:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748529605] [2022-11-25 16:43:17,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:17,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:43:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:17,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:43:17,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:43:17,491 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 213 [2022-11-25 16:43:17,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:43:17,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 213 [2022-11-25 16:43:17,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:43:17,786 INFO L130 PetriNetUnfolder]: 232/446 cut-off events. [2022-11-25 16:43:17,786 INFO L131 PetriNetUnfolder]: For 5289/5308 co-relation queries the response was YES. [2022-11-25 16:43:17,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2767 conditions, 446 events. 232/446 cut-off events. For 5289/5308 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1890 event pairs, 33 based on Foata normal form. 38/477 useless extension candidates. Maximal degree in co-relation 2739. Up to 170 conditions per place. [2022-11-25 16:43:17,790 INFO L137 encePairwiseOnDemand]: 207/213 looper letters, 42 selfloop transitions, 10 changer transitions 32/89 dead transitions. [2022-11-25 16:43:17,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 1081 flow [2022-11-25 16:43:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:43:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:43:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 725 transitions. [2022-11-25 16:43:17,796 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4862508383635144 [2022-11-25 16:43:17,796 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 725 transitions. [2022-11-25 16:43:17,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 725 transitions. [2022-11-25 16:43:17,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:43:17,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 725 transitions. [2022-11-25 16:43:17,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,803 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,804 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 507 flow. Second operand 7 states and 725 transitions. [2022-11-25 16:43:17,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 1081 flow [2022-11-25 16:43:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 89 transitions, 941 flow, removed 63 selfloop flow, removed 5 redundant places. [2022-11-25 16:43:17,820 INFO L231 Difference]: Finished difference. Result has 74 places, 40 transitions, 336 flow [2022-11-25 16:43:17,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=74, PETRI_TRANSITIONS=40} [2022-11-25 16:43:17,821 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2022-11-25 16:43:17,822 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 336 flow [2022-11-25 16:43:17,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:17,822 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:43:17,823 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:17,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:43:17,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 16:43:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:17,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1487865961, now seen corresponding path program 1 times [2022-11-25 16:43:17,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:17,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580037723] [2022-11-25 16:43:17,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:17,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:43:17,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:43:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:43:18,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:43:18,011 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:43:18,012 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 16:43:18,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 16:43:18,015 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 16:43:18,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 16:43:18,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 16:43:18,016 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 16:43:18,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:43:18,017 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:18,025 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:43:18,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:43:18,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:43:18 BasicIcfg [2022-11-25 16:43:18,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:43:18,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:43:18,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:43:18,122 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:43:18,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:54" (3/4) ... [2022-11-25 16:43:18,125 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:43:18,272 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:43:18,272 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:43:18,273 INFO L158 Benchmark]: Toolchain (without parser) took 25927.51ms. Allocated memory was 146.8MB in the beginning and 450.9MB in the end (delta: 304.1MB). Free memory was 100.4MB in the beginning and 208.7MB in the end (delta: -108.3MB). Peak memory consumption was 197.8MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,273 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 146.8MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:43:18,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 908.71ms. Allocated memory is still 146.8MB. Free memory was 100.1MB in the beginning and 73.8MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.05ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 73.8MB in the beginning and 148.0MB in the end (delta: -74.1MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,274 INFO L158 Benchmark]: Boogie Preprocessor took 90.15ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 147.6MB in the end (delta: 315.3kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,275 INFO L158 Benchmark]: RCFGBuilder took 1044.68ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 112.0MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,275 INFO L158 Benchmark]: TraceAbstraction took 23623.50ms. Allocated memory was 178.3MB in the beginning and 450.9MB in the end (delta: 272.6MB). Free memory was 111.2MB in the beginning and 219.2MB in the end (delta: -108.0MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,276 INFO L158 Benchmark]: Witness Printer took 150.25ms. Allocated memory is still 450.9MB. Free memory was 219.2MB in the beginning and 208.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 16:43:18,279 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.35ms. Allocated memory is still 146.8MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 908.71ms. Allocated memory is still 146.8MB. Free memory was 100.1MB in the beginning and 73.8MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.05ms. Allocated memory was 146.8MB in the beginning and 178.3MB in the end (delta: 31.5MB). Free memory was 73.8MB in the beginning and 148.0MB in the end (delta: -74.1MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.15ms. Allocated memory is still 178.3MB. Free memory was 147.9MB in the beginning and 147.6MB in the end (delta: 315.3kB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1044.68ms. Allocated memory is still 178.3MB. Free memory was 147.6MB in the beginning and 112.0MB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23623.50ms. Allocated memory was 178.3MB in the beginning and 450.9MB in the end (delta: 272.6MB). Free memory was 111.2MB in the beginning and 219.2MB in the end (delta: -108.0MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. * Witness Printer took 150.25ms. Allocated memory is still 450.9MB. Free memory was 219.2MB in the beginning and 208.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 119 PlacesBefore, 34 PlacesAfterwards, 111 TransitionsBefore, 25 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 5026 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2402, independent: 2257, independent conditional: 0, independent unconditional: 2257, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1472, independent: 1425, independent conditional: 0, independent unconditional: 1425, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1472, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 550, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 505, dependent conditional: 0, dependent unconditional: 505, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2402, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 1472, unknown conditional: 0, unknown unconditional: 1472] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2028, ((void *)0), P0, ((void *)0))=-1, t2028={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2029, ((void *)0), P1, ((void *)0))=0, t2028={5:0}, t2029={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2030, ((void *)0), P2, ((void *)0))=1, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, 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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028={5:0}, t2029={6:0}, t2030={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 819]: 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: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 577 mSDsluCounter, 329 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1644 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 76 mSDtfsCounter, 1644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=695occurred in iteration=9, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 16:43:18,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d957f47e-4e2d-44ca-88d8-52caeab62ebc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE