./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b 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_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix046.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- 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-8393723 [2022-11-19 07:41:10,023 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:41:10,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:41:10,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:41:10,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:41:10,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:41:10,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:41:10,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:41:10,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:41:10,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:41:10,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:41:10,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:41:10,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:41:10,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:41:10,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:41:10,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:41:10,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:41:10,070 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:41:10,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:41:10,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:41:10,076 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:41:10,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:41:10,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:41:10,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:41:10,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:41:10,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:41:10,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:41:10,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:41:10,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:41:10,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:41:10,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:41:10,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:41:10,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:41:10,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:41:10,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:41:10,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:41:10,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:41:10,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:41:10,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:41:10,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:41:10,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:41:10,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:41:10,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:41:10,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:41:10,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:41:10,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:41:10,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:41:10,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:41:10,149 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:41:10,150 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:41:10,150 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:41:10,150 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:41:10,151 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:41:10,152 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:41:10,152 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:41:10,152 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:41:10,152 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:41:10,152 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:41:10,153 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:41:10,153 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:41:10,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:41:10,154 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:41:10,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:41:10,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:41:10,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:41:10,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:41:10,155 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:41:10,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:41:10,155 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:41:10,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:41:10,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:41:10,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:41:10,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:41:10,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:41:10,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:10,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:41:10,157 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:41:10,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:41:10,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:41:10,158 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:41:10,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:41:10,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:41:10,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:41:10,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/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_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2022-11-19 07:41:10,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:41:10,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:41:10,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:41:10,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:41:10,496 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:41:10,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-19 07:41:10,583 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/data/b1b9157ff/66e5ad85c0144e59a9cc9c47b36b207d/FLAG3847415d0 [2022-11-19 07:41:11,208 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:41:11,208 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/sv-benchmarks/c/pthread-wmm/mix046.opt.i [2022-11-19 07:41:11,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/data/b1b9157ff/66e5ad85c0144e59a9cc9c47b36b207d/FLAG3847415d0 [2022-11-19 07:41:11,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/data/b1b9157ff/66e5ad85c0144e59a9cc9c47b36b207d [2022-11-19 07:41:11,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:41:11,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:41:11,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:11,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:41:11,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:41:11,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:11" (1/1) ... [2022-11-19 07:41:11,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234f5c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:11, skipping insertion in model container [2022-11-19 07:41:11,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:41:11" (1/1) ... [2022-11-19 07:41:11,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:41:11,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:41:11,720 WARN L234 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_9eda6468-35e4-4429-a7dc-5b862db6d53c/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-19 07:41:11,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:12,012 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:41:12,027 WARN L234 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_9eda6468-35e4-4429-a7dc-5b862db6d53c/sv-benchmarks/c/pthread-wmm/mix046.opt.i[944,957] [2022-11-19 07:41:12,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:41:12,171 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:41:12,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12 WrapperNode [2022-11-19 07:41:12,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:41:12,173 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:12,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:41:12,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:41:12,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,260 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-19 07:41:12,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:41:12,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:41:12,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:41:12,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:41:12,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:41:12,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:41:12,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:41:12,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:41:12,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (1/1) ... [2022-11-19 07:41:12,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:41:12,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:41:12,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:41:12,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:41:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:41:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:41:12,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:41:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:41:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:41:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:41:12,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:41:12,427 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:41:12,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:41:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:41:12,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:41:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:41:12,428 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:41:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:41:12,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:41:12,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:41:12,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:41:12,430 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:41:12,658 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:41:12,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:41:13,026 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:41:13,164 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:41:13,164 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:41:13,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:13 BoogieIcfgContainer [2022-11-19 07:41:13,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:41:13,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:41:13,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:41:13,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:41:13,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:41:11" (1/3) ... [2022-11-19 07:41:13,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ede166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:13, skipping insertion in model container [2022-11-19 07:41:13,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:12" (2/3) ... [2022-11-19 07:41:13,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ede166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:13, skipping insertion in model container [2022-11-19 07:41:13,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:13" (3/3) ... [2022-11-19 07:41:13,176 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2022-11-19 07:41:13,185 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 07:41:13,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:41:13,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:41:13,197 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:41:13,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:41:13,298 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:41:13,316 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-19 07:41:13,326 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 294 flow [2022-11-19 07:41:13,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-19 07:41:13,393 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-19 07:41:13,393 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:41:13,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-19 07:41:13,402 INFO L119 LiptonReduction]: Number of co-enabled transitions 3168 [2022-11-19 07:41:19,017 INFO L134 LiptonReduction]: Checked pairs total: 7945 [2022-11-19 07:41:19,017 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-19 07:41:19,026 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-11-19 07:41:19,222 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 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-19 07:41:19,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:41:19,247 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=FINITE_AUTOMATA, 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;@730374ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:41:19,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 07:41:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 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-19 07:41:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:41:19,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:19,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:19,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:19,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash 309705311, now seen corresponding path program 1 times [2022-11-19 07:41:19,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:19,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999253431] [2022-11-19 07:41:19,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:19,826 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-19 07:41:19,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999253431] [2022-11-19 07:41:19,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999253431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:19,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:19,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:41:19,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906530442] [2022-11-19 07:41:19,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:19,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:41:19,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:19,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:41:19,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:41:19,879 INFO L87 Difference]: Start difference. First operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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-19 07:41:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:20,112 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2022-11-19 07:41:20,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:41:20,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:41:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:20,167 INFO L225 Difference]: With dead ends: 2682 [2022-11-19 07:41:20,167 INFO L226 Difference]: Without dead ends: 2602 [2022-11-19 07:41:20,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:41:20,174 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:20,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-19 07:41:20,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2022-11-19 07:41:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 0 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-19 07:41:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2022-11-19 07:41:20,382 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2022-11-19 07:41:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:20,383 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2022-11-19 07:41:20,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 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-19 07:41:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2022-11-19 07:41:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:41:20,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:20,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:20,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:41:20,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash 844061757, now seen corresponding path program 1 times [2022-11-19 07:41:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:20,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322650533] [2022-11-19 07:41:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:20,986 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-19 07:41:20,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322650533] [2022-11-19 07:41:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322650533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:20,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:20,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:41:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779888896] [2022-11-19 07:41:20,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:20,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:41:20,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:41:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:20,990 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-19 07:41:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:21,497 INFO L93 Difference]: Finished difference Result 3722 states and 13680 transitions. [2022-11-19 07:41:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:21,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:41:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:21,521 INFO L225 Difference]: With dead ends: 3722 [2022-11-19 07:41:21,521 INFO L226 Difference]: Without dead ends: 3066 [2022-11-19 07:41:21,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:21,524 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:21,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 19 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:41:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-11-19 07:41:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 2426. [2022-11-19 07:41:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2426 states, 2425 states have (on average 3.7509278350515465) internal successors, (9096), 2425 states have internal predecessors, (9096), 0 states have call successors, (0), 0 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-19 07:41:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 9096 transitions. [2022-11-19 07:41:21,665 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 9096 transitions. Word has length 12 [2022-11-19 07:41:21,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:21,666 INFO L495 AbstractCegarLoop]: Abstraction has 2426 states and 9096 transitions. [2022-11-19 07:41:21,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 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-19 07:41:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 9096 transitions. [2022-11-19 07:41:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:41:21,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:21,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:21,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:41:21,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -607007113, now seen corresponding path program 1 times [2022-11-19 07:41:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:21,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617342925] [2022-11-19 07:41:21,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:21,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:21,966 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-19 07:41:21,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:21,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617342925] [2022-11-19 07:41:21,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617342925] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:21,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:21,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:41:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593781832] [2022-11-19 07:41:21,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:21,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:41:21,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:21,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:41:21,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:41:21,970 INFO L87 Difference]: Start difference. First operand 2426 states and 9096 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-19 07:41:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:22,132 INFO L93 Difference]: Finished difference Result 2682 states and 9816 transitions. [2022-11-19 07:41:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:41:22,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:41:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:22,149 INFO L225 Difference]: With dead ends: 2682 [2022-11-19 07:41:22,149 INFO L226 Difference]: Without dead ends: 2362 [2022-11-19 07:41:22,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:22,154 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:22,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-11-19 07:41:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-11-19 07:41:22,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 3.7306226175349426) internal successors, (8808), 2361 states have internal predecessors, (8808), 0 states have call successors, (0), 0 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-19 07:41:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 8808 transitions. [2022-11-19 07:41:22,251 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 8808 transitions. Word has length 14 [2022-11-19 07:41:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:22,253 INFO L495 AbstractCegarLoop]: Abstraction has 2362 states and 8808 transitions. [2022-11-19 07:41:22,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-19 07:41:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 8808 transitions. [2022-11-19 07:41:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:41:22,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:22,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:22,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:41:22,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:22,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1610444070, now seen corresponding path program 1 times [2022-11-19 07:41:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:22,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416114512] [2022-11-19 07:41:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:23,095 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-19 07:41:23,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:23,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416114512] [2022-11-19 07:41:23,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416114512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:23,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:23,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218789231] [2022-11-19 07:41:23,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:23,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:23,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:23,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:23,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:23,105 INFO L87 Difference]: Start difference. First operand 2362 states and 8808 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-19 07:41:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:23,325 INFO L93 Difference]: Finished difference Result 2554 states and 9296 transitions. [2022-11-19 07:41:23,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:41:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:41:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:23,341 INFO L225 Difference]: With dead ends: 2554 [2022-11-19 07:41:23,342 INFO L226 Difference]: Without dead ends: 2266 [2022-11-19 07:41:23,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:41:23,343 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:23,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 26 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-11-19 07:41:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2250. [2022-11-19 07:41:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2250 states, 2249 states have (on average 3.704757670075589) internal successors, (8332), 2249 states have internal predecessors, (8332), 0 states have call successors, (0), 0 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-19 07:41:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8332 transitions. [2022-11-19 07:41:23,426 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8332 transitions. Word has length 15 [2022-11-19 07:41:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:23,427 INFO L495 AbstractCegarLoop]: Abstraction has 2250 states and 8332 transitions. [2022-11-19 07:41:23,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-19 07:41:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8332 transitions. [2022-11-19 07:41:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:41:23,431 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:23,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:23,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:41:23,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:23,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1579025682, now seen corresponding path program 1 times [2022-11-19 07:41:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:23,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715110093] [2022-11-19 07:41:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:24,095 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-19 07:41:24,096 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:24,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715110093] [2022-11-19 07:41:24,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715110093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:24,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:24,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874357938] [2022-11-19 07:41:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:24,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:24,103 INFO L87 Difference]: Start difference. First operand 2250 states and 8332 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:24,405 INFO L93 Difference]: Finished difference Result 2858 states and 10536 transitions. [2022-11-19 07:41:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:24,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:41:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:24,444 INFO L225 Difference]: With dead ends: 2858 [2022-11-19 07:41:24,444 INFO L226 Difference]: Without dead ends: 2666 [2022-11-19 07:41:24,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:41:24,446 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 60 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:24,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 36 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2022-11-19 07:41:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2406. [2022-11-19 07:41:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 3.7322245322245324) internal successors, (8976), 2405 states have internal predecessors, (8976), 0 states have call successors, (0), 0 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-19 07:41:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 8976 transitions. [2022-11-19 07:41:24,565 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 8976 transitions. Word has length 16 [2022-11-19 07:41:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:24,566 INFO L495 AbstractCegarLoop]: Abstraction has 2406 states and 8976 transitions. [2022-11-19 07:41:24,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 8976 transitions. [2022-11-19 07:41:24,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:41:24,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:24,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:24,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:41:24,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1613881152, now seen corresponding path program 2 times [2022-11-19 07:41:24,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:24,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565545470] [2022-11-19 07:41:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:24,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:25,353 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-19 07:41:25,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:25,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565545470] [2022-11-19 07:41:25,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565545470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:25,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:25,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:41:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435907276] [2022-11-19 07:41:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:25,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:41:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:25,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:41:25,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:25,355 INFO L87 Difference]: Start difference. First operand 2406 states and 8976 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:25,767 INFO L93 Difference]: Finished difference Result 2870 states and 10536 transitions. [2022-11-19 07:41:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:41:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:25,782 INFO L225 Difference]: With dead ends: 2870 [2022-11-19 07:41:25,782 INFO L226 Difference]: Without dead ends: 2646 [2022-11-19 07:41:25,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:41:25,783 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:25,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 44 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2022-11-19 07:41:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2382. [2022-11-19 07:41:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 3.7060058798824023) internal successors, (8824), 2381 states have internal predecessors, (8824), 0 states have call successors, (0), 0 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-19 07:41:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 8824 transitions. [2022-11-19 07:41:25,878 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 8824 transitions. Word has length 16 [2022-11-19 07:41:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 2382 states and 8824 transitions. [2022-11-19 07:41:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 8824 transitions. [2022-11-19 07:41:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:41:25,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:25,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:25,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:41:25,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:25,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1041358980, now seen corresponding path program 3 times [2022-11-19 07:41:25,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:25,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453213223] [2022-11-19 07:41:25,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:25,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:26,902 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-19 07:41:26,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453213223] [2022-11-19 07:41:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453213223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:26,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:26,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:41:26,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819883445] [2022-11-19 07:41:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:26,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:41:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:26,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:41:26,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:41:26,905 INFO L87 Difference]: Start difference. First operand 2382 states and 8824 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:27,392 INFO L93 Difference]: Finished difference Result 3038 states and 11128 transitions. [2022-11-19 07:41:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:41:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:27,406 INFO L225 Difference]: With dead ends: 3038 [2022-11-19 07:41:27,406 INFO L226 Difference]: Without dead ends: 2782 [2022-11-19 07:41:27,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:41:27,408 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:27,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 40 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:41:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2782 states. [2022-11-19 07:41:27,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2782 to 2522. [2022-11-19 07:41:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2521 states have (on average 3.6921856406188023) internal successors, (9308), 2521 states have internal predecessors, (9308), 0 states have call successors, (0), 0 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-19 07:41:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 9308 transitions. [2022-11-19 07:41:27,528 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 9308 transitions. Word has length 16 [2022-11-19 07:41:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:27,528 INFO L495 AbstractCegarLoop]: Abstraction has 2522 states and 9308 transitions. [2022-11-19 07:41:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-19 07:41:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 9308 transitions. [2022-11-19 07:41:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:41:27,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:27,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:27,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:41:27,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1703225447, now seen corresponding path program 1 times [2022-11-19 07:41:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:27,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952212753] [2022-11-19 07:41:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:28,686 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-19 07:41:28,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:28,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952212753] [2022-11-19 07:41:28,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952212753] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:28,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:28,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:41:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962414142] [2022-11-19 07:41:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:28,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:41:28,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:41:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:41:28,688 INFO L87 Difference]: Start difference. First operand 2522 states and 9308 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-19 07:41:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:29,058 INFO L93 Difference]: Finished difference Result 2522 states and 9212 transitions. [2022-11-19 07:41:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:29,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:41:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:29,070 INFO L225 Difference]: With dead ends: 2522 [2022-11-19 07:41:29,070 INFO L226 Difference]: Without dead ends: 2394 [2022-11-19 07:41:29,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:41:29,072 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:29,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 51 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:41:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2022-11-19 07:41:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2082. [2022-11-19 07:41:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2082 states, 2081 states have (on average 3.686689091782797) internal successors, (7672), 2081 states have internal predecessors, (7672), 0 states have call successors, (0), 0 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-19 07:41:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 7672 transitions. [2022-11-19 07:41:29,146 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 7672 transitions. Word has length 17 [2022-11-19 07:41:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:29,146 INFO L495 AbstractCegarLoop]: Abstraction has 2082 states and 7672 transitions. [2022-11-19 07:41:29,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-19 07:41:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 7672 transitions. [2022-11-19 07:41:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:41:29,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:29,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:29,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:41:29,152 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1450977189, now seen corresponding path program 1 times [2022-11-19 07:41:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:29,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571115926] [2022-11-19 07:41:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:29,305 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-19 07:41:29,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:29,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571115926] [2022-11-19 07:41:29,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571115926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:29,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:41:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666944436] [2022-11-19 07:41:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:41:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:41:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:41:29,308 INFO L87 Difference]: Start difference. First operand 2082 states and 7672 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-19 07:41:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:29,394 INFO L93 Difference]: Finished difference Result 1624 states and 5413 transitions. [2022-11-19 07:41:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:41:29,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:41:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:29,402 INFO L225 Difference]: With dead ends: 1624 [2022-11-19 07:41:29,403 INFO L226 Difference]: Without dead ends: 1624 [2022-11-19 07:41:29,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:41:29,404 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:29,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-11-19 07:41:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2022-11-19 07:41:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1623 states have (on average 3.335181762168823) internal successors, (5413), 1623 states have internal predecessors, (5413), 0 states have call successors, (0), 0 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-19 07:41:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 5413 transitions. [2022-11-19 07:41:29,494 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 5413 transitions. Word has length 17 [2022-11-19 07:41:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:29,497 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 5413 transitions. [2022-11-19 07:41:29,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-19 07:41:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 5413 transitions. [2022-11-19 07:41:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:41:29,501 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:29,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:41:29,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 17505308, now seen corresponding path program 1 times [2022-11-19 07:41:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:29,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897783039] [2022-11-19 07:41:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:29,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:29,700 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-19 07:41:29,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:29,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897783039] [2022-11-19 07:41:29,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897783039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:29,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:29,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:41:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962027846] [2022-11-19 07:41:29,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:29,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:41:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:41:29,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:41:29,703 INFO L87 Difference]: Start difference. First operand 1624 states and 5413 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-19 07:41:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:29,800 INFO L93 Difference]: Finished difference Result 1042 states and 3130 transitions. [2022-11-19 07:41:29,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:41:29,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-19 07:41:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:29,804 INFO L225 Difference]: With dead ends: 1042 [2022-11-19 07:41:29,805 INFO L226 Difference]: Without dead ends: 1042 [2022-11-19 07:41:29,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:41:29,805 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:29,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 12 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-11-19 07:41:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2022-11-19 07:41:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 3.006724303554275) internal successors, (3130), 1041 states have internal predecessors, (3130), 0 states have call successors, (0), 0 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-19 07:41:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 3130 transitions. [2022-11-19 07:41:29,835 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 3130 transitions. Word has length 18 [2022-11-19 07:41:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:29,836 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 3130 transitions. [2022-11-19 07:41:29,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-19 07:41:29,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 3130 transitions. [2022-11-19 07:41:29,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:41:29,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:29,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:41:29,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash -440891370, now seen corresponding path program 1 times [2022-11-19 07:41:29,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:29,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447260024] [2022-11-19 07:41:29,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:29,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:30,232 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-19 07:41:30,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:30,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447260024] [2022-11-19 07:41:30,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447260024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:30,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:30,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:30,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369327750] [2022-11-19 07:41:30,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:30,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:41:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:30,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:41:30,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:30,234 INFO L87 Difference]: Start difference. First operand 1042 states and 3130 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-19 07:41:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:30,453 INFO L93 Difference]: Finished difference Result 1533 states and 4458 transitions. [2022-11-19 07:41:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:41:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 07:41:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:30,457 INFO L225 Difference]: With dead ends: 1533 [2022-11-19 07:41:30,458 INFO L226 Difference]: Without dead ends: 1056 [2022-11-19 07:41:30,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:30,459 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:30,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 21 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:41:30,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-19 07:41:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1022. [2022-11-19 07:41:30,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1021 states have (on average 2.8658178256611166) internal successors, (2926), 1021 states have internal predecessors, (2926), 0 states have call successors, (0), 0 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-19 07:41:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2926 transitions. [2022-11-19 07:41:30,491 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2926 transitions. Word has length 20 [2022-11-19 07:41:30,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:30,492 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 2926 transitions. [2022-11-19 07:41:30,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-19 07:41:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2926 transitions. [2022-11-19 07:41:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:41:30,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:30,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:30,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:41:30,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:30,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash -895196553, now seen corresponding path program 1 times [2022-11-19 07:41:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:30,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799008386] [2022-11-19 07:41:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:30,928 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-19 07:41:30,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:30,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799008386] [2022-11-19 07:41:30,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799008386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:30,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:30,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:41:30,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959258541] [2022-11-19 07:41:30,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:30,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:30,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:30,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:30,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:30,931 INFO L87 Difference]: Start difference. First operand 1022 states and 2926 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-19 07:41:31,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:31,373 INFO L93 Difference]: Finished difference Result 1495 states and 4187 transitions. [2022-11-19 07:41:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:41:31,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:41:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:31,377 INFO L225 Difference]: With dead ends: 1495 [2022-11-19 07:41:31,377 INFO L226 Difference]: Without dead ends: 701 [2022-11-19 07:41:31,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:41:31,378 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:31,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 28 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:41:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-11-19 07:41:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 632. [2022-11-19 07:41:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 2.6450079239302693) internal successors, (1669), 631 states have internal predecessors, (1669), 0 states have call successors, (0), 0 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-19 07:41:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1669 transitions. [2022-11-19 07:41:31,396 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1669 transitions. Word has length 21 [2022-11-19 07:41:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:31,396 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1669 transitions. [2022-11-19 07:41:31,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-19 07:41:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1669 transitions. [2022-11-19 07:41:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:41:31,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:31,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:31,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:41:31,399 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:31,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash 645834869, now seen corresponding path program 1 times [2022-11-19 07:41:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043777541] [2022-11-19 07:41:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:31,618 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-19 07:41:31,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:31,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043777541] [2022-11-19 07:41:31,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043777541] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:31,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:31,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:41:31,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557505607] [2022-11-19 07:41:31,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:31,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:41:31,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:41:31,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:31,620 INFO L87 Difference]: Start difference. First operand 632 states and 1669 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-19 07:41:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:31,724 INFO L93 Difference]: Finished difference Result 434 states and 1099 transitions. [2022-11-19 07:41:31,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:41:31,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:41:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:31,726 INFO L225 Difference]: With dead ends: 434 [2022-11-19 07:41:31,726 INFO L226 Difference]: Without dead ends: 434 [2022-11-19 07:41:31,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:41:31,727 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:31,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 15 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-19 07:41:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 418. [2022-11-19 07:41:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.529976019184652) internal successors, (1055), 417 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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-19 07:41:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1055 transitions. [2022-11-19 07:41:31,739 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1055 transitions. Word has length 21 [2022-11-19 07:41:31,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:31,741 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 1055 transitions. [2022-11-19 07:41:31,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 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-19 07:41:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1055 transitions. [2022-11-19 07:41:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:41:31,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:31,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:31,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:41:31,744 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1855478906, now seen corresponding path program 1 times [2022-11-19 07:41:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:31,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148486171] [2022-11-19 07:41:31,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:31,966 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-19 07:41:31,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:31,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148486171] [2022-11-19 07:41:31,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148486171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:31,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:31,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:41:31,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579550844] [2022-11-19 07:41:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:31,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:41:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:31,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:41:31,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:31,968 INFO L87 Difference]: Start difference. First operand 418 states and 1055 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 07:41:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:32,083 INFO L93 Difference]: Finished difference Result 372 states and 965 transitions. [2022-11-19 07:41:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:41:32,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 07:41:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:32,085 INFO L225 Difference]: With dead ends: 372 [2022-11-19 07:41:32,085 INFO L226 Difference]: Without dead ends: 236 [2022-11-19 07:41:32,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:41:32,102 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:32,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 14 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-11-19 07:41:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 220. [2022-11-19 07:41:32,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.470319634703196) internal successors, (541), 219 states have internal predecessors, (541), 0 states have call successors, (0), 0 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-19 07:41:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 541 transitions. [2022-11-19 07:41:32,119 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 541 transitions. Word has length 24 [2022-11-19 07:41:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:32,120 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 541 transitions. [2022-11-19 07:41:32,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-19 07:41:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 541 transitions. [2022-11-19 07:41:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:41:32,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:32,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:32,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:41:32,130 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1676565825, now seen corresponding path program 1 times [2022-11-19 07:41:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:32,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450677174] [2022-11-19 07:41:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:32,955 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-19 07:41:32,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:32,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450677174] [2022-11-19 07:41:32,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450677174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:32,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:32,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:41:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570989144] [2022-11-19 07:41:32,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:32,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:41:32,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:41:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:41:32,957 INFO L87 Difference]: Start difference. First operand 220 states and 541 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 07:41:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:33,529 INFO L93 Difference]: Finished difference Result 313 states and 773 transitions. [2022-11-19 07:41:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:41:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:41:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:33,530 INFO L225 Difference]: With dead ends: 313 [2022-11-19 07:41:33,530 INFO L226 Difference]: Without dead ends: 101 [2022-11-19 07:41:33,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:41:33,532 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:33,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 35 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:41:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-19 07:41:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2022-11-19 07:41:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 0 states have call successors, (0), 0 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-19 07:41:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2022-11-19 07:41:33,536 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2022-11-19 07:41:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:33,536 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2022-11-19 07:41:33,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 07:41:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2022-11-19 07:41:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:41:33,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:33,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:33,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:41:33,537 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash -2019417383, now seen corresponding path program 2 times [2022-11-19 07:41:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965484867] [2022-11-19 07:41:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:34,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:41:34,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:34,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965484867] [2022-11-19 07:41:34,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965484867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:41:34,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:41:34,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:41:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926634360] [2022-11-19 07:41:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:34,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:41:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:41:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:41:34,491 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 07:41:34,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:34,738 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2022-11-19 07:41:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:41:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-19 07:41:34,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:34,739 INFO L225 Difference]: With dead ends: 120 [2022-11-19 07:41:34,739 INFO L226 Difference]: Without dead ends: 65 [2022-11-19 07:41:34,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:41:34,740 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:34,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 16 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:41:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-19 07:41:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-19 07:41:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.921875) internal successors, (123), 64 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-19 07:41:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 123 transitions. [2022-11-19 07:41:34,743 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 123 transitions. Word has length 27 [2022-11-19 07:41:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:34,743 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 123 transitions. [2022-11-19 07:41:34,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-19 07:41:34,744 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 123 transitions. [2022-11-19 07:41:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:41:34,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:34,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:34,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:41:34,745 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 07:41:34,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1348405735, now seen corresponding path program 3 times [2022-11-19 07:41:34,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:34,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119365540] [2022-11-19 07:41:34,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:34,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:41:34,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:41:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:41:34,856 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:41:34,856 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:41:34,857 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 07:41:34,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 07:41:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 07:41:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 07:41:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 07:41:34,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 07:41:34,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 07:41:34,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:41:34,863 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:34,869 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:41:34,869 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:41:34,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:41:34 BasicIcfg [2022-11-19 07:41:34,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:41:34,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:41:34,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:41:34,955 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:41:34,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:13" (3/4) ... [2022-11-19 07:41:34,958 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 07:41:35,089 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:41:35,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:41:35,090 INFO L158 Benchmark]: Toolchain (without parser) took 23624.04ms. Allocated memory was 117.4MB in the beginning and 599.8MB in the end (delta: 482.3MB). Free memory was 80.6MB in the beginning and 287.3MB in the end (delta: -206.7MB). Peak memory consumption was 275.1MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,091 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory was 98.6MB in the beginning and 98.6MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:41:35,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 705.10ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 81.4MB in the end (delta: -988.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.55ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 78.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,093 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,093 INFO L158 Benchmark]: RCFGBuilder took 860.90ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 83.8MB in the end (delta: -7.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,093 INFO L158 Benchmark]: TraceAbstraction took 21784.70ms. Allocated memory was 117.4MB in the beginning and 599.8MB in the end (delta: 482.3MB). Free memory was 82.7MB in the beginning and 303.1MB in the end (delta: -220.4MB). Peak memory consumption was 260.9MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,094 INFO L158 Benchmark]: Witness Printer took 134.90ms. Allocated memory is still 599.8MB. Free memory was 303.1MB in the beginning and 287.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-19 07:41:35,102 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.21ms. Allocated memory is still 117.4MB. Free memory was 98.6MB in the beginning and 98.6MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 705.10ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 81.4MB in the end (delta: -988.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.55ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 78.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.90ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 83.8MB in the end (delta: -7.3MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21784.70ms. Allocated memory was 117.4MB in the beginning and 599.8MB in the end (delta: 482.3MB). Free memory was 82.7MB in the beginning and 303.1MB in the end (delta: -220.4MB). Peak memory consumption was 260.9MB. Max. memory is 16.1GB. * Witness Printer took 134.90ms. Allocated memory is still 599.8MB. Free memory was 303.1MB in the beginning and 287.3MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 148 PlacesBefore, 46 PlacesAfterwards, 137 TransitionsBefore, 34 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7945 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4307, independent: 4109, independent conditional: 0, independent unconditional: 4109, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2347, independent: 2294, independent conditional: 0, independent unconditional: 2294, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2347, independent: 2267, independent conditional: 0, independent unconditional: 2267, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4307, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 2347, unknown conditional: 0, unknown unconditional: 2347] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 240, Positive conditional cache size: 0, Positive unconditional cache size: 240, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L740] 0 _Bool z$r_buff1_thd4; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L747] 0 _Bool weak$$choice0; [L745] 0 int z$w_buff1; [L748] 0 _Bool weak$$choice2; [L712] 0 int __unbuffered_p0_EAX = 0; [L729] 0 _Bool z$flush_delayed; [L743] 0 int z$w_buff0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EBX = 0; [L734] 0 _Bool z$r_buff0_thd3; [L730] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd4; [L741] 0 _Bool z$read_delayed; [L718] 0 int a = 0; [L720] 0 int b = 0; [L742] 0 int *z$read_delayed_var; [L746] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L721] 0 _Bool main$tmp_guard0; [L744] 0 _Bool z$w_buff0_used; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1221, ((void *)0), P0, ((void *)0))=-3, t1221={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1222, ((void *)0), P1, ((void *)0))=-2, t1221={5:0}, t1222={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1223, ((void *)0), P2, ((void *)0))=-1, t1221={5:0}, t1222={6:0}, t1223={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1224, ((void *)0), P3, ((void *)0))=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221={5:0}, t1222={6:0}, t1223={7:0}, t1224={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 914 mSDsluCounter, 391 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2107 IncrementalHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 126 mSDtfsCounter, 2107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3162occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1895 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-19 07:41:35,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eda6468-35e4-4429-a7dc-5b862db6d53c/bin/utaipan-I9t0OCRTmS/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