./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V --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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:31:22,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:31:22,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:31:22,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:31:22,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:31:22,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:31:22,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:31:22,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:31:22,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:31:22,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:31:22,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:31:22,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:31:22,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:31:22,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:31:22,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:31:22,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:31:22,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:31:22,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:31:22,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:31:22,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:31:22,340 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:31:22,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:31:22,346 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:31:22,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:31:22,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:31:22,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:31:22,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:31:22,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:31:22,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:31:22,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:31:22,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:31:22,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:31:22,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:31:22,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:31:22,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:31:22,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:31:22,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:31:22,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:31:22,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:31:22,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:31:22,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:31:22,371 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:31:22,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:31:22,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:31:22,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:31:22,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:31:22,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:31:22,436 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:31:22,436 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:31:22,437 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:31:22,437 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:31:22,437 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:31:22,438 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:31:22,439 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:31:22,439 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:31:22,439 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:31:22,440 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:31:22,440 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:31:22,440 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:31:22,441 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:31:22,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:31:22,442 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:31:22,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:31:22,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:31:22,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:31:22,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:31:22,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:31:22,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:31:22,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:31:22,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:31:22,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:31:22,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:31:22,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:31:22,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:31:22,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:31:22,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:31:22,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:31:22,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:31:22,449 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:31:22,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:31:22,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:31:22,450 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:31:22,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:31:22,450 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/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_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2021-11-23 03:31:22,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:31:22,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:31:22,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:31:22,859 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:31:22,860 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:31:22,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-11-23 03:31:22,965 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/data/cd9626137/b8561f40d8d6444db1501a15101acf84/FLAGf6cea1dc1 [2021-11-23 03:31:23,559 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:31:23,560 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-11-23 03:31:23,581 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/data/cd9626137/b8561f40d8d6444db1501a15101acf84/FLAGf6cea1dc1 [2021-11-23 03:31:23,855 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/data/cd9626137/b8561f40d8d6444db1501a15101acf84 [2021-11-23 03:31:23,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:31:23,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:31:23,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:31:23,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:31:23,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:31:23,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:23" (1/1) ... [2021-11-23 03:31:23,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40765ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:23, skipping insertion in model container [2021-11-23 03:31:23,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:31:23" (1/1) ... [2021-11-23 03:31:23,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:31:23,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:31:24,180 WARN L230 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_02099263-f160-4e85-b8db-db5a83acaa7e/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2021-11-23 03:31:24,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:31:24,251 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:31:24,271 WARN L230 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_02099263-f160-4e85-b8db-db5a83acaa7e/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2021-11-23 03:31:24,339 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:31:24,362 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:31:24,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24 WrapperNode [2021-11-23 03:31:24,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:31:24,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:31:24,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:31:24,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:31:24,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,418 INFO L137 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2021-11-23 03:31:24,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:31:24,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:31:24,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:31:24,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:31:24,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:31:24,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:31:24,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:31:24,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:31:24,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (1/1) ... [2021-11-23 03:31:24,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:31:24,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:24,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:31:24,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:31:24,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:31:24,595 INFO L130 BoogieDeclarations]: Found specification of procedure error [2021-11-23 03:31:24,596 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2021-11-23 03:31:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-23 03:31:24,596 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-23 03:31:24,596 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-11-23 03:31:24,596 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-11-23 03:31:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-11-23 03:31:24,597 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-11-23 03:31:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-11-23 03:31:24,597 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-11-23 03:31:24,597 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-11-23 03:31:24,598 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-11-23 03:31:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:31:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-11-23 03:31:24,598 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-11-23 03:31:24,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:31:24,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:31:24,599 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-23 03:31:24,599 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-23 03:31:24,686 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:31:24,689 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:31:25,085 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:31:25,206 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:31:25,208 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-23 03:31:25,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:25 BoogieIcfgContainer [2021-11-23 03:31:25,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:31:25,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:31:25,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:31:25,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:31:25,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:31:23" (1/3) ... [2021-11-23 03:31:25,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efe7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:25, skipping insertion in model container [2021-11-23 03:31:25,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:31:24" (2/3) ... [2021-11-23 03:31:25,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39efe7fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:31:25, skipping insertion in model container [2021-11-23 03:31:25,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:25" (3/3) ... [2021-11-23 03:31:25,226 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-11-23 03:31:25,237 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:31:25,237 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 03:31:25,314 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:31:25,349 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:31:25,350 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 03:31:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 52 states have internal predecessors, (71), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-23 03:31:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 03:31:25,400 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:25,401 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:25,401 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -675144144, now seen corresponding path program 1 times [2021-11-23 03:31:25,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:25,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644630177] [2021-11-23 03:31:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:25,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:25,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:25,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644630177] [2021-11-23 03:31:25,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644630177] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:25,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:25,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:31:25,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848648830] [2021-11-23 03:31:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:25,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:31:25,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:25,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:31:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:31:25,845 INFO L87 Difference]: Start difference. First operand has 72 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 52 states have internal predecessors, (71), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:31:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:26,207 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2021-11-23 03:31:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:31:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2021-11-23 03:31:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:26,222 INFO L225 Difference]: With dead ends: 200 [2021-11-23 03:31:26,222 INFO L226 Difference]: Without dead ends: 129 [2021-11-23 03:31:26,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:31:26,231 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:26,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 220 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:31:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-23 03:31:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2021-11-23 03:31:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2021-11-23 03:31:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2021-11-23 03:31:26,324 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 44 [2021-11-23 03:31:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:26,326 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2021-11-23 03:31:26,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:31:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2021-11-23 03:31:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 03:31:26,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:26,335 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:26,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:31:26,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:26,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:26,339 INFO L85 PathProgramCache]: Analyzing trace with hash 243830479, now seen corresponding path program 1 times [2021-11-23 03:31:26,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:26,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621491014] [2021-11-23 03:31:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:26,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:26,484 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:26,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621491014] [2021-11-23 03:31:26,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621491014] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:26,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:26,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:31:26,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990056333] [2021-11-23 03:31:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:26,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:31:26,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:31:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:31:26,490 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:31:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:27,263 INFO L93 Difference]: Finished difference Result 524 states and 656 transitions. [2021-11-23 03:31:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:31:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2021-11-23 03:31:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:27,272 INFO L225 Difference]: With dead ends: 524 [2021-11-23 03:31:27,273 INFO L226 Difference]: Without dead ends: 392 [2021-11-23 03:31:27,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:31:27,278 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 440 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:27,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 535 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-11-23 03:31:27,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2021-11-23 03:31:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2021-11-23 03:31:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 217 states have (on average 1.2488479262672811) internal successors, (271), 220 states have internal predecessors, (271), 49 states have call successors, (49), 38 states have call predecessors, (49), 41 states have return successors, (51), 50 states have call predecessors, (51), 47 states have call successors, (51) [2021-11-23 03:31:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 371 transitions. [2021-11-23 03:31:27,368 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 371 transitions. Word has length 44 [2021-11-23 03:31:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:27,369 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 371 transitions. [2021-11-23 03:31:27,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:31:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 371 transitions. [2021-11-23 03:31:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 03:31:27,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:27,372 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:27,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:31:27,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1396115267, now seen corresponding path program 1 times [2021-11-23 03:31:27,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:27,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523498646] [2021-11-23 03:31:27,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:27,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:27,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:27,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523498646] [2021-11-23 03:31:27,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523498646] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:27,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:27,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:31:27,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833892172] [2021-11-23 03:31:27,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:27,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:31:27,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:27,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:31:27,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:31:27,597 INFO L87 Difference]: Start difference. First operand 308 states and 371 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-23 03:31:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:28,103 INFO L93 Difference]: Finished difference Result 824 states and 987 transitions. [2021-11-23 03:31:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 03:31:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2021-11-23 03:31:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:28,115 INFO L225 Difference]: With dead ends: 824 [2021-11-23 03:31:28,115 INFO L226 Difference]: Without dead ends: 522 [2021-11-23 03:31:28,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:31:28,132 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 187 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:28,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 329 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:31:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-11-23 03:31:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 487. [2021-11-23 03:31:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 342 states have (on average 1.236842105263158) internal successors, (423), 346 states have internal predecessors, (423), 76 states have call successors, (76), 61 states have call predecessors, (76), 68 states have return successors, (82), 80 states have call predecessors, (82), 74 states have call successors, (82) [2021-11-23 03:31:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 581 transitions. [2021-11-23 03:31:28,228 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 581 transitions. Word has length 45 [2021-11-23 03:31:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:28,229 INFO L470 AbstractCegarLoop]: Abstraction has 487 states and 581 transitions. [2021-11-23 03:31:28,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-11-23 03:31:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 581 transitions. [2021-11-23 03:31:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 03:31:28,232 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:28,232 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:28,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 03:31:28,233 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 353713709, now seen corresponding path program 1 times [2021-11-23 03:31:28,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:28,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816738499] [2021-11-23 03:31:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:28,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:28,315 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:28,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816738499] [2021-11-23 03:31:28,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816738499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:28,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:28,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:31:28,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355130810] [2021-11-23 03:31:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:28,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:31:28,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:31:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:28,318 INFO L87 Difference]: Start difference. First operand 487 states and 581 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:31:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:28,430 INFO L93 Difference]: Finished difference Result 1051 states and 1251 transitions. [2021-11-23 03:31:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:31:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2021-11-23 03:31:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:28,439 INFO L225 Difference]: With dead ends: 1051 [2021-11-23 03:31:28,439 INFO L226 Difference]: Without dead ends: 619 [2021-11-23 03:31:28,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:28,442 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 67 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:28,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 142 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:28,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-11-23 03:31:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 514. [2021-11-23 03:31:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 365 states have (on average 1.2273972602739727) internal successors, (448), 369 states have internal predecessors, (448), 78 states have call successors, (78), 63 states have call predecessors, (78), 70 states have return successors, (84), 82 states have call predecessors, (84), 76 states have call successors, (84) [2021-11-23 03:31:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 610 transitions. [2021-11-23 03:31:28,509 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 610 transitions. Word has length 46 [2021-11-23 03:31:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:28,510 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 610 transitions. [2021-11-23 03:31:28,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:31:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 610 transitions. [2021-11-23 03:31:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-23 03:31:28,512 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:28,512 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:28,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:31:28,513 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1690232526, now seen corresponding path program 1 times [2021-11-23 03:31:28,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:28,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915952854] [2021-11-23 03:31:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:28,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:31:28,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:28,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915952854] [2021-11-23 03:31:28,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915952854] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:28,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:28,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:31:28,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993915808] [2021-11-23 03:31:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:28,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:31:28,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:31:28,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:28,576 INFO L87 Difference]: Start difference. First operand 514 states and 610 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:31:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:28,690 INFO L93 Difference]: Finished difference Result 704 states and 831 transitions. [2021-11-23 03:31:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:31:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2021-11-23 03:31:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:28,695 INFO L225 Difference]: With dead ends: 704 [2021-11-23 03:31:28,695 INFO L226 Difference]: Without dead ends: 431 [2021-11-23 03:31:28,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:28,698 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:28,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-11-23 03:31:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 322. [2021-11-23 03:31:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 225 states have (on average 1.1822222222222223) internal successors, (266), 227 states have internal predecessors, (266), 54 states have call successors, (54), 43 states have call predecessors, (54), 42 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-11-23 03:31:28,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2021-11-23 03:31:28,737 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 52 [2021-11-23 03:31:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:28,738 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2021-11-23 03:31:28,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:31:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2021-11-23 03:31:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-23 03:31:28,740 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:28,741 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:28,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:31:28,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1861310757, now seen corresponding path program 1 times [2021-11-23 03:31:28,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:28,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094521057] [2021-11-23 03:31:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:28,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:28,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:28,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094521057] [2021-11-23 03:31:28,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094521057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:28,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:28,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:31:28,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548499386] [2021-11-23 03:31:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:28,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:31:28,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:28,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:31:28,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:31:28,802 INFO L87 Difference]: Start difference. First operand 322 states and 372 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:31:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:28,963 INFO L93 Difference]: Finished difference Result 425 states and 488 transitions. [2021-11-23 03:31:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:31:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2021-11-23 03:31:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:28,967 INFO L225 Difference]: With dead ends: 425 [2021-11-23 03:31:28,968 INFO L226 Difference]: Without dead ends: 422 [2021-11-23 03:31:28,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:31:28,970 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 159 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:28,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 125 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:28,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-11-23 03:31:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 321. [2021-11-23 03:31:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 225 states have (on average 1.1688888888888889) internal successors, (263), 226 states have internal predecessors, (263), 53 states have call successors, (53), 43 states have call predecessors, (53), 42 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2021-11-23 03:31:29,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 368 transitions. [2021-11-23 03:31:29,018 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 368 transitions. Word has length 53 [2021-11-23 03:31:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:29,018 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 368 transitions. [2021-11-23 03:31:29,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:31:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 368 transitions. [2021-11-23 03:31:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-23 03:31:29,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:29,021 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 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] [2021-11-23 03:31:29,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 03:31:29,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:29,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1866410474, now seen corresponding path program 1 times [2021-11-23 03:31:29,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:29,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429514135] [2021-11-23 03:31:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:29,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:29,124 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429514135] [2021-11-23 03:31:29,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429514135] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:31:29,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124477300] [2021-11-23 03:31:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:29,125 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:29,127 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:31:29,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:31:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:29,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 03:31:29,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:31:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:29,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:31:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:30,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124477300] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:31:30,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1393953345] [2021-11-23 03:31:30,207 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2021-11-23 03:31:30,207 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:31:30,213 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:31:30,219 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:31:30,219 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:31:32,156 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 51 for LOIs [2021-11-23 03:31:32,168 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 71 for LOIs [2021-11-23 03:31:32,183 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 71 for LOIs [2021-11-23 03:31:32,197 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 78 for LOIs [2021-11-23 03:31:32,212 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 67 for LOIs [2021-11-23 03:31:32,224 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 75 for LOIs [2021-11-23 03:31:32,444 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 71 for LOIs [2021-11-23 03:31:32,475 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 71 for LOIs [2021-11-23 03:31:32,516 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:31:38,068 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8969#(and (= ~q_req_up~0 1) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~p_dw_pc~0 1) (= ~c_last_read~0 ~q_buf_0~0) (= ~c_dr_pc~0 0) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= |#NULL.base| 0))' at error location [2021-11-23 03:31:38,068 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:31:38,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:31:38,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2021-11-23 03:31:38,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105761322] [2021-11-23 03:31:38,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:31:38,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:31:38,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:31:38,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2021-11-23 03:31:38,072 INFO L87 Difference]: Start difference. First operand 321 states and 368 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-23 03:31:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:38,456 INFO L93 Difference]: Finished difference Result 894 states and 1023 transitions. [2021-11-23 03:31:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:31:38,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 54 [2021-11-23 03:31:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:38,473 INFO L225 Difference]: With dead ends: 894 [2021-11-23 03:31:38,473 INFO L226 Difference]: Without dead ends: 891 [2021-11-23 03:31:38,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2021-11-23 03:31:38,476 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 314 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:38,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 575 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:31:38,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-11-23 03:31:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 616. [2021-11-23 03:31:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 430 states have (on average 1.1767441860465115) internal successors, (506), 431 states have internal predecessors, (506), 101 states have call successors, (101), 85 states have call predecessors, (101), 84 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2021-11-23 03:31:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 707 transitions. [2021-11-23 03:31:38,549 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 707 transitions. Word has length 54 [2021-11-23 03:31:38,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:38,551 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 707 transitions. [2021-11-23 03:31:38,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2021-11-23 03:31:38,551 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 707 transitions. [2021-11-23 03:31:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-23 03:31:38,554 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:38,554 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:38,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:31:38,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:38,769 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash -135505893, now seen corresponding path program 2 times [2021-11-23 03:31:38,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:38,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150693889] [2021-11-23 03:31:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:38,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:31:38,813 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:38,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150693889] [2021-11-23 03:31:38,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150693889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:38,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:38,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:31:38,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385943155] [2021-11-23 03:31:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:38,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:31:38,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:31:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:38,816 INFO L87 Difference]: Start difference. First operand 616 states and 707 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:31:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:38,911 INFO L93 Difference]: Finished difference Result 1029 states and 1180 transitions. [2021-11-23 03:31:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:31:38,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 57 [2021-11-23 03:31:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:38,916 INFO L225 Difference]: With dead ends: 1029 [2021-11-23 03:31:38,916 INFO L226 Difference]: Without dead ends: 618 [2021-11-23 03:31:38,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:38,921 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:38,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:31:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-11-23 03:31:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2021-11-23 03:31:38,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 426 states have (on average 1.15962441314554) internal successors, (494), 427 states have internal predecessors, (494), 101 states have call successors, (101), 85 states have call predecessors, (101), 84 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2021-11-23 03:31:38,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 695 transitions. [2021-11-23 03:31:38,983 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 695 transitions. Word has length 57 [2021-11-23 03:31:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:38,983 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 695 transitions. [2021-11-23 03:31:38,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-23 03:31:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 695 transitions. [2021-11-23 03:31:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-23 03:31:38,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:38,985 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:38,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 03:31:38,986 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash 99384636, now seen corresponding path program 1 times [2021-11-23 03:31:38,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834890504] [2021-11-23 03:31:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:38,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:31:39,047 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:39,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834890504] [2021-11-23 03:31:39,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834890504] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:39,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:39,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:31:39,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059464022] [2021-11-23 03:31:39,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:39,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:31:39,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:31:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:39,050 INFO L87 Difference]: Start difference. First operand 612 states and 695 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:31:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:39,140 INFO L93 Difference]: Finished difference Result 1231 states and 1405 transitions. [2021-11-23 03:31:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:31:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2021-11-23 03:31:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:39,147 INFO L225 Difference]: With dead ends: 1231 [2021-11-23 03:31:39,147 INFO L226 Difference]: Without dead ends: 868 [2021-11-23 03:31:39,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:39,149 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:39,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 178 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:31:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2021-11-23 03:31:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 687. [2021-11-23 03:31:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 487 states have (on average 1.1683778234086242) internal successors, (569), 488 states have internal predecessors, (569), 108 states have call successors, (108), 92 states have call predecessors, (108), 91 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2021-11-23 03:31:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 784 transitions. [2021-11-23 03:31:39,213 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 784 transitions. Word has length 60 [2021-11-23 03:31:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:39,214 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 784 transitions. [2021-11-23 03:31:39,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:31:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 784 transitions. [2021-11-23 03:31:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-23 03:31:39,215 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:39,216 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:39,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 03:31:39,216 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:39,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1415932190, now seen corresponding path program 1 times [2021-11-23 03:31:39,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:39,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686171599] [2021-11-23 03:31:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:39,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:31:39,291 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:39,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686171599] [2021-11-23 03:31:39,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686171599] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:39,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:39,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-23 03:31:39,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563475543] [2021-11-23 03:31:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:39,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:31:39,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:39,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:31:39,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:31:39,292 INFO L87 Difference]: Start difference. First operand 687 states and 784 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 03:31:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:39,658 INFO L93 Difference]: Finished difference Result 1736 states and 1967 transitions. [2021-11-23 03:31:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-23 03:31:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 69 [2021-11-23 03:31:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:39,665 INFO L225 Difference]: With dead ends: 1736 [2021-11-23 03:31:39,666 INFO L226 Difference]: Without dead ends: 1055 [2021-11-23 03:31:39,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:31:39,669 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 169 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:39,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 306 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:31:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2021-11-23 03:31:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1006. [2021-11-23 03:31:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 701 states have (on average 1.1483594864479316) internal successors, (805), 702 states have internal predecessors, (805), 164 states have call successors, (164), 141 states have call predecessors, (164), 140 states have return successors, (163), 163 states have call predecessors, (163), 163 states have call successors, (163) [2021-11-23 03:31:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1132 transitions. [2021-11-23 03:31:39,767 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1132 transitions. Word has length 69 [2021-11-23 03:31:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:39,768 INFO L470 AbstractCegarLoop]: Abstraction has 1006 states and 1132 transitions. [2021-11-23 03:31:39,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-23 03:31:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1132 transitions. [2021-11-23 03:31:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-23 03:31:39,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:39,770 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:39,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-23 03:31:39,770 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -646125163, now seen corresponding path program 1 times [2021-11-23 03:31:39,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:39,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591055461] [2021-11-23 03:31:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:39,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:31:39,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:39,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591055461] [2021-11-23 03:31:39,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591055461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:39,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:31:39,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:31:39,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803258802] [2021-11-23 03:31:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:39,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:31:39,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:39,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:31:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:39,806 INFO L87 Difference]: Start difference. First operand 1006 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:31:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:39,945 INFO L93 Difference]: Finished difference Result 1972 states and 2226 transitions. [2021-11-23 03:31:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:31:39,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 70 [2021-11-23 03:31:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:39,956 INFO L225 Difference]: With dead ends: 1972 [2021-11-23 03:31:39,956 INFO L226 Difference]: Without dead ends: 1182 [2021-11-23 03:31:39,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:31:39,959 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 37 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:39,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:31:39,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2021-11-23 03:31:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1053. [2021-11-23 03:31:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 740 states have (on average 1.15) internal successors, (851), 741 states have internal predecessors, (851), 168 states have call successors, (168), 145 states have call predecessors, (168), 144 states have return successors, (167), 167 states have call predecessors, (167), 167 states have call successors, (167) [2021-11-23 03:31:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1186 transitions. [2021-11-23 03:31:40,060 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1186 transitions. Word has length 70 [2021-11-23 03:31:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:40,061 INFO L470 AbstractCegarLoop]: Abstraction has 1053 states and 1186 transitions. [2021-11-23 03:31:40,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-23 03:31:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1186 transitions. [2021-11-23 03:31:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:31:40,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:40,064 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:40,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 03:31:40,065 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 337037355, now seen corresponding path program 1 times [2021-11-23 03:31:40,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:40,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863355673] [2021-11-23 03:31:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:40,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-23 03:31:40,255 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863355673] [2021-11-23 03:31:40,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863355673] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:31:40,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148286598] [2021-11-23 03:31:40,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:40,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:40,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:31:40,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 03:31:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:40,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-23 03:31:40,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:31:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:31:40,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:31:40,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148286598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:40,531 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:31:40,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2021-11-23 03:31:40,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925963260] [2021-11-23 03:31:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:40,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:31:40,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:40,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:31:40,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:31:40,533 INFO L87 Difference]: Start difference. First operand 1053 states and 1186 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 03:31:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:40,722 INFO L93 Difference]: Finished difference Result 1917 states and 2191 transitions. [2021-11-23 03:31:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:31:40,723 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 101 [2021-11-23 03:31:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:40,728 INFO L225 Difference]: With dead ends: 1917 [2021-11-23 03:31:40,728 INFO L226 Difference]: Without dead ends: 870 [2021-11-23 03:31:40,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2021-11-23 03:31:40,732 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:40,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 514 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2021-11-23 03:31:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 685. [2021-11-23 03:31:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 503 states have (on average 1.1550695825049702) internal successors, (581), 504 states have internal predecessors, (581), 97 states have call successors, (97), 85 states have call predecessors, (97), 84 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2021-11-23 03:31:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 774 transitions. [2021-11-23 03:31:40,801 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 774 transitions. Word has length 101 [2021-11-23 03:31:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:40,802 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 774 transitions. [2021-11-23 03:31:40,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 03:31:40,803 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 774 transitions. [2021-11-23 03:31:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-11-23 03:31:40,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:40,805 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:40,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:31:41,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:41,024 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash -799495666, now seen corresponding path program 1 times [2021-11-23 03:31:41,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:41,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513436281] [2021-11-23 03:31:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:41,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 03:31:41,103 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513436281] [2021-11-23 03:31:41,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513436281] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:31:41,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813986310] [2021-11-23 03:31:41,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:41,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:41,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:31:41,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 03:31:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:41,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-23 03:31:41,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:31:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-23 03:31:41,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:31:41,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813986310] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:41,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:31:41,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-11-23 03:31:41,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418267016] [2021-11-23 03:31:41,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:41,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:31:41,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:41,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:31:41,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-23 03:31:41,419 INFO L87 Difference]: Start difference. First operand 685 states and 774 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 03:31:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:41,669 INFO L93 Difference]: Finished difference Result 1234 states and 1399 transitions. [2021-11-23 03:31:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:31:41,669 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 111 [2021-11-23 03:31:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:41,673 INFO L225 Difference]: With dead ends: 1234 [2021-11-23 03:31:41,674 INFO L226 Difference]: Without dead ends: 641 [2021-11-23 03:31:41,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:31:41,676 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 66 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:41,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 492 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2021-11-23 03:31:41,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 549. [2021-11-23 03:31:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 403 states have (on average 1.15136476426799) internal successors, (464), 404 states have internal predecessors, (464), 78 states have call successors, (78), 68 states have call predecessors, (78), 67 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2021-11-23 03:31:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 619 transitions. [2021-11-23 03:31:41,739 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 619 transitions. Word has length 111 [2021-11-23 03:31:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:41,739 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 619 transitions. [2021-11-23 03:31:41,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2021-11-23 03:31:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 619 transitions. [2021-11-23 03:31:41,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 03:31:41,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:41,744 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2021-11-23 03:31:41,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:31:41,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 03:31:41,957 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1284342463, now seen corresponding path program 1 times [2021-11-23 03:31:41,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486360712] [2021-11-23 03:31:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:41,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-11-23 03:31:42,038 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:42,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486360712] [2021-11-23 03:31:42,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486360712] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:31:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532043211] [2021-11-23 03:31:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:42,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:42,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:42,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:31:42,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 03:31:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:42,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 03:31:42,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:31:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 03:31:42,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:31:42,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532043211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:31:42,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:31:42,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-11-23 03:31:42,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154291001] [2021-11-23 03:31:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:31:42,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:31:42,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:31:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:31:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:31:42,440 INFO L87 Difference]: Start difference. First operand 549 states and 619 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-23 03:31:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:31:42,635 INFO L93 Difference]: Finished difference Result 1298 states and 1464 transitions. [2021-11-23 03:31:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:31:42,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2021-11-23 03:31:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:31:42,641 INFO L225 Difference]: With dead ends: 1298 [2021-11-23 03:31:42,642 INFO L226 Difference]: Without dead ends: 841 [2021-11-23 03:31:42,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-11-23 03:31:42,644 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 42 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:31:42,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 480 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:31:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-11-23 03:31:42,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 807. [2021-11-23 03:31:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 565 states have (on average 1.1398230088495576) internal successors, (644), 572 states have internal predecessors, (644), 126 states have call successors, (126), 110 states have call predecessors, (126), 115 states have return successors, (137), 125 states have call predecessors, (137), 125 states have call successors, (137) [2021-11-23 03:31:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 907 transitions. [2021-11-23 03:31:42,761 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 907 transitions. Word has length 112 [2021-11-23 03:31:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:31:42,761 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 907 transitions. [2021-11-23 03:31:42,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-23 03:31:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 907 transitions. [2021-11-23 03:31:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-23 03:31:42,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:31:42,764 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:31:42,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:31:42,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 03:31:42,989 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:31:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:31:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1807551347, now seen corresponding path program 1 times [2021-11-23 03:31:42,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:31:42,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474984053] [2021-11-23 03:31:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:42,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:31:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 03:31:43,428 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:31:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474984053] [2021-11-23 03:31:43,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474984053] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:31:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442117349] [2021-11-23 03:31:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:31:43,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:31:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:31:43,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:31:43,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 03:31:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:31:43,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-23 03:31:43,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:31:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:31:44,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:31:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 03:31:47,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442117349] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:31:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1616547923] [2021-11-23 03:31:47,174 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2021-11-23 03:31:47,174 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:31:47,175 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:31:47,176 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:31:47,176 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:32:04,263 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 57 for LOIs [2021-11-23 03:32:04,271 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 49 for LOIs [2021-11-23 03:32:04,280 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 53 for LOIs [2021-11-23 03:32:04,290 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 131 for LOIs [2021-11-23 03:32:04,372 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 23 for LOIs [2021-11-23 03:32:04,377 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 40 for LOIs [2021-11-23 03:32:04,595 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 40 for LOIs [2021-11-23 03:32:04,651 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 40 for LOIs [2021-11-23 03:32:04,712 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:32:14,003 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '36077#(and (= ~q_req_up~0 1) (<= 0 ~c_dr_pc~0) (or (and (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= |#NULL.base| 0)) (and (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 1) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= |#NULL.base| 0))) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (<= ~c_dr_pc~0 1) (<= |#NULL.offset| 0) (<= 1 ~c_dr_st~0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_st~0 1) (<= 1 ~c_num_read~0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2021-11-23 03:32:14,003 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:32:14,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:32:14,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 16] total 50 [2021-11-23 03:32:14,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358282700] [2021-11-23 03:32:14,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:32:14,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-11-23 03:32:14,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-11-23 03:32:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=9569, Unknown=0, NotChecked=0, Total=10302 [2021-11-23 03:32:14,010 INFO L87 Difference]: Start difference. First operand 807 states and 907 transitions. Second operand has 50 states, 32 states have (on average 6.03125) internal successors, (193), 37 states have internal predecessors, (193), 19 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 19 states have call predecessors, (46), 19 states have call successors, (46) [2021-11-23 03:32:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:26,618 INFO L93 Difference]: Finished difference Result 3361 states and 4006 transitions. [2021-11-23 03:32:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2021-11-23 03:32:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 32 states have (on average 6.03125) internal successors, (193), 37 states have internal predecessors, (193), 19 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 19 states have call predecessors, (46), 19 states have call successors, (46) Word has length 113 [2021-11-23 03:32:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:26,636 INFO L225 Difference]: With dead ends: 3361 [2021-11-23 03:32:26,636 INFO L226 Difference]: Without dead ends: 2646 [2021-11-23 03:32:26,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 274 SyntacticMatches, 17 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29340 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=6897, Invalid=64125, Unknown=0, NotChecked=0, Total=71022 [2021-11-23 03:32:26,658 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 3852 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 6388 mSolverCounterSat, 2581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3855 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 8969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2581 IncrementalHoareTripleChecker+Valid, 6388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:26,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3855 Valid, 2522 Invalid, 8969 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2581 Valid, 6388 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2021-11-23 03:32:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2021-11-23 03:32:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 1083. [2021-11-23 03:32:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 749 states have (on average 1.1415220293724966) internal successors, (855), 758 states have internal predecessors, (855), 171 states have call successors, (171), 147 states have call predecessors, (171), 162 states have return successors, (194), 178 states have call predecessors, (194), 170 states have call successors, (194) [2021-11-23 03:32:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1220 transitions. [2021-11-23 03:32:26,841 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1220 transitions. Word has length 113 [2021-11-23 03:32:26,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:26,842 INFO L470 AbstractCegarLoop]: Abstraction has 1083 states and 1220 transitions. [2021-11-23 03:32:26,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 32 states have (on average 6.03125) internal successors, (193), 37 states have internal predecessors, (193), 19 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 19 states have call predecessors, (46), 19 states have call successors, (46) [2021-11-23 03:32:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1220 transitions. [2021-11-23 03:32:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 03:32:26,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:26,845 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:26,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 03:32:27,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:32:27,073 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash 957768905, now seen corresponding path program 1 times [2021-11-23 03:32:27,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:27,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393742808] [2021-11-23 03:32:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:27,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 03:32:27,276 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:27,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393742808] [2021-11-23 03:32:27,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393742808] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:32:27,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799431785] [2021-11-23 03:32:27,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:27,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:32:27,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:32:27,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:32:27,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 03:32:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:27,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 03:32:27,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:32:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-23 03:32:27,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:32:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-23 03:32:27,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799431785] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 03:32:27,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 03:32:27,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2021-11-23 03:32:27,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737307659] [2021-11-23 03:32:27,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:32:27,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 03:32:27,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:27,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 03:32:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-11-23 03:32:27,948 INFO L87 Difference]: Start difference. First operand 1083 states and 1220 transitions. Second operand has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-23 03:32:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:32:28,484 INFO L93 Difference]: Finished difference Result 2407 states and 2768 transitions. [2021-11-23 03:32:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 03:32:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 114 [2021-11-23 03:32:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:32:28,496 INFO L225 Difference]: With dead ends: 2407 [2021-11-23 03:32:28,496 INFO L226 Difference]: Without dead ends: 1416 [2021-11-23 03:32:28,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2021-11-23 03:32:28,500 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 122 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:32:28,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 409 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:32:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2021-11-23 03:32:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1163. [2021-11-23 03:32:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 794 states have (on average 1.141057934508816) internal successors, (906), 806 states have internal predecessors, (906), 190 states have call successors, (190), 156 states have call predecessors, (190), 178 states have return successors, (234), 201 states have call predecessors, (234), 189 states have call successors, (234) [2021-11-23 03:32:28,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1330 transitions. [2021-11-23 03:32:28,713 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1330 transitions. Word has length 114 [2021-11-23 03:32:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:32:28,714 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 1330 transitions. [2021-11-23 03:32:28,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-23 03:32:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1330 transitions. [2021-11-23 03:32:28,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-11-23 03:32:28,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:32:28,719 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:32:28,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 03:32:28,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 03:32:28,933 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:32:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:32:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1090106568, now seen corresponding path program 1 times [2021-11-23 03:32:28,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:32:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086193682] [2021-11-23 03:32:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:28,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:32:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-11-23 03:32:29,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:32:29,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086193682] [2021-11-23 03:32:29,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086193682] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:32:29,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916943937] [2021-11-23 03:32:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:32:29,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:32:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:32:29,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:32:29,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 03:32:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:32:29,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 62 conjunts are in the unsatisfiable core [2021-11-23 03:32:29,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:32:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 03:32:30,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:32:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-11-23 03:32:32,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916943937] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:32:32,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409603825] [2021-11-23 03:32:32,304 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2021-11-23 03:32:32,304 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:32:32,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:32:32,305 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:32:32,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:32:36,035 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 54 for LOIs [2021-11-23 03:32:36,043 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 104 for LOIs [2021-11-23 03:32:36,191 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 108 for LOIs [2021-11-23 03:32:36,302 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 131 for LOIs [2021-11-23 03:32:36,382 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 49 for LOIs [2021-11-23 03:32:36,392 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 116 for LOIs [2021-11-23 03:32:36,761 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 78 for LOIs [2021-11-23 03:32:36,809 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 25 for LOIs [2021-11-23 03:32:36,838 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:32:46,690 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '49708#(and (= ~q_req_up~0 1) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~c_dr_pc~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (or (and (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= ~c_last_read~0 ~p_last_write~0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1))' at error location [2021-11-23 03:32:46,690 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:32:46,690 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:32:46,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 51 [2021-11-23 03:32:46,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333547345] [2021-11-23 03:32:46,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:32:46,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-11-23 03:32:46,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:32:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-11-23 03:32:46,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=10291, Unknown=0, NotChecked=0, Total=11130 [2021-11-23 03:32:46,694 INFO L87 Difference]: Start difference. First operand 1163 states and 1330 transitions. Second operand has 51 states, 35 states have (on average 6.114285714285714) internal successors, (214), 39 states have internal predecessors, (214), 22 states have call successors, (49), 16 states have call predecessors, (49), 23 states have return successors, (51), 22 states have call predecessors, (51), 22 states have call successors, (51) [2021-11-23 03:33:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:00,080 INFO L93 Difference]: Finished difference Result 4329 states and 5051 transitions. [2021-11-23 03:33:00,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2021-11-23 03:33:00,087 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 35 states have (on average 6.114285714285714) internal successors, (214), 39 states have internal predecessors, (214), 22 states have call successors, (49), 16 states have call predecessors, (49), 23 states have return successors, (51), 22 states have call predecessors, (51), 22 states have call successors, (51) Word has length 123 [2021-11-23 03:33:00,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:00,107 INFO L225 Difference]: With dead ends: 4329 [2021-11-23 03:33:00,107 INFO L226 Difference]: Without dead ends: 3258 [2021-11-23 03:33:00,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25875 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=6767, Invalid=56485, Unknown=0, NotChecked=0, Total=63252 [2021-11-23 03:33:00,119 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 3065 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 6817 mSolverCounterSat, 2784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3066 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 9601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2784 IncrementalHoareTripleChecker+Valid, 6817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:00,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3066 Valid, 1598 Invalid, 9601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2784 Valid, 6817 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2021-11-23 03:33:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2021-11-23 03:33:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 1630. [2021-11-23 03:33:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1132 states have (on average 1.1475265017667844) internal successors, (1299), 1148 states have internal predecessors, (1299), 252 states have call successors, (252), 207 states have call predecessors, (252), 245 states have return successors, (311), 275 states have call predecessors, (311), 251 states have call successors, (311) [2021-11-23 03:33:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1862 transitions. [2021-11-23 03:33:00,411 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1862 transitions. Word has length 123 [2021-11-23 03:33:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 1630 states and 1862 transitions. [2021-11-23 03:33:00,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 35 states have (on average 6.114285714285714) internal successors, (214), 39 states have internal predecessors, (214), 22 states have call successors, (49), 16 states have call predecessors, (49), 23 states have return successors, (51), 22 states have call predecessors, (51), 22 states have call successors, (51) [2021-11-23 03:33:00,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1862 transitions. [2021-11-23 03:33:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2021-11-23 03:33:00,415 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:00,415 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:00,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 03:33:00,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 03:33:00,689 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:00,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1472119423, now seen corresponding path program 1 times [2021-11-23 03:33:00,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:00,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662666856] [2021-11-23 03:33:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:00,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2021-11-23 03:33:00,789 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:00,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662666856] [2021-11-23 03:33:00,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662666856] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:33:00,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758604772] [2021-11-23 03:33:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:00,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:33:00,791 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:33:00,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 03:33:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:00,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-23 03:33:00,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:33:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-23 03:33:01,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:33:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-23 03:33:01,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758604772] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 03:33:01,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 03:33:01,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2021-11-23 03:33:01,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860973037] [2021-11-23 03:33:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:01,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-23 03:33:01,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-23 03:33:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-11-23 03:33:01,453 INFO L87 Difference]: Start difference. First operand 1630 states and 1862 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-23 03:33:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:01,863 INFO L93 Difference]: Finished difference Result 2605 states and 2969 transitions. [2021-11-23 03:33:01,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-23 03:33:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2021-11-23 03:33:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:01,871 INFO L225 Difference]: With dead ends: 2605 [2021-11-23 03:33:01,871 INFO L226 Difference]: Without dead ends: 1067 [2021-11-23 03:33:01,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2021-11-23 03:33:01,876 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 168 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:01,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 343 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:33:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-11-23 03:33:01,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 718. [2021-11-23 03:33:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 487 states have (on average 1.1026694045174539) internal successors, (537), 500 states have internal predecessors, (537), 116 states have call successors, (116), 96 states have call predecessors, (116), 114 states have return successors, (145), 122 states have call predecessors, (145), 115 states have call successors, (145) [2021-11-23 03:33:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 798 transitions. [2021-11-23 03:33:01,999 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 798 transitions. Word has length 124 [2021-11-23 03:33:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:02,000 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 798 transitions. [2021-11-23 03:33:02,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-23 03:33:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 798 transitions. [2021-11-23 03:33:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2021-11-23 03:33:02,004 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:33:02,005 INFO L514 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-11-23 03:33:02,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 03:33:02,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 03:33:02,233 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:33:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:33:02,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1677337614, now seen corresponding path program 1 times [2021-11-23 03:33:02,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:33:02,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963109569] [2021-11-23 03:33:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:02,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:33:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2021-11-23 03:33:02,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:33:02,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963109569] [2021-11-23 03:33:02,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963109569] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:33:02,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301327156] [2021-11-23 03:33:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:33:02,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:02,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:33:02,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:33:02,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 03:33:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:33:02,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 03:33:02,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:33:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-23 03:33:03,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:33:03,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301327156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:33:03,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:33:03,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-11-23 03:33:03,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141138738] [2021-11-23 03:33:03,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:33:03,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-23 03:33:03,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:33:03,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-23 03:33:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-11-23 03:33:03,052 INFO L87 Difference]: Start difference. First operand 718 states and 798 transitions. Second operand has 9 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-23 03:33:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:33:03,262 INFO L93 Difference]: Finished difference Result 965 states and 1070 transitions. [2021-11-23 03:33:03,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-23 03:33:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) Word has length 219 [2021-11-23 03:33:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:33:03,264 INFO L225 Difference]: With dead ends: 965 [2021-11-23 03:33:03,264 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 03:33:03,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-11-23 03:33:03,267 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 42 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:33:03,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 749 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:33:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 03:33:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 03:33:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 03:33:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 03:33:03,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2021-11-23 03:33:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:33:03,269 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 03:33:03,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2021-11-23 03:33:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 03:33:03,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 03:33:03,272 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 03:33:03,313 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 03:33:03,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:33:03,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 03:33:47,658 INFO L858 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2021-11-23 03:33:47,658 INFO L854 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse11 (= ~p_dw_i~0 1)) (.cse13 (= ~c_dr_pc~0 1)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse2 (= ~q_free~0 0)) (.cse3 (not .cse14)) (.cse4 (not .cse13)) (.cse5 (= ~q_read_ev~0 0)) (.cse7 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse12 .cse10 .cse13 .cse14 .cse11)) (.cse9 (= |old(~c_dr_st~0)| 0)) (.cse1 (not .cse12)) (.cse6 (not .cse11)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse8 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (= ~q_read_ev~0 1) .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8) (or (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse2) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse3 (= ~q_write_ev~0 0) .cse4 .cse5 .cse6 .cse7 .cse9 (= ~q_write_ev~0 1) .cse8) (or (not (= ~q_req_up~0 0)) (not .cse9) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse6 (not (= ~q_free~0 1)) (not .cse0) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse8)))) [2021-11-23 03:33:47,659 INFO L854 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse30 (= ~q_free~0 0))) (let ((.cse16 (= 1 ~c_dr_i~0)) (.cse21 (= ~p_dw_i~0 1)) (.cse18 (= ~c_dr_pc~0 1)) (.cse19 (= ~p_dw_pc~0 1)) (.cse17 (<= ~p_num_write~0 ~c_num_read~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~q_write_ev~0 1)) (.cse29 (= ~q_req_up~0 1)) (.cse3 (not .cse30)) (.cse27 (= ~q_write_ev~0 0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse12 (= ~p_dw_st~0 0)) (.cse0 (= |old(~p_dw_st~0)| 0))) (let ((.cse1 (= ~q_read_ev~0 1)) (.cse6 (or (not .cse12) .cse0)) (.cse24 (not .cse23)) (.cse15 (not .cse27)) (.cse5 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse20 (or (not .cse29) .cse3)) (.cse22 (not .cse28)) (.cse25 (and .cse29 .cse30)) (.cse2 (not .cse14)) (.cse26 (not .cse17)) (.cse4 (not .cse19)) (.cse7 (not .cse18)) (.cse8 (= ~q_read_ev~0 0)) (.cse9 (not .cse21)) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse13 (not .cse0)) (.cse10 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6) .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse10) (or (not (= ~q_req_up~0 0)) (not .cse11) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse5 .cse12) (not (= ~q_write_ev~0 2)) .cse9 (not (= ~q_free~0 1)) .cse13 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse10) (or (and .cse14 .cse15 .cse1 .cse5 .cse16 .cse17 .cse18 .cse19 .cse12 .cse20 .cse21 .cse22 .cse23) (and (not .cse1) .cse5 .cse6) .cse24 .cse25 .cse2 .cse26 .cse4 .cse27 .cse7 .cse8 .cse9 .cse11 .cse28 .cse10) (or .cse24 (and .cse14 .cse15 .cse5 .cse16 .cse17 .cse18 .cse19 .cse12 .cse20 .cse21 .cse22 .cse23) .cse25 .cse2 .cse26 .cse4 .cse27 .cse7 .cse8 .cse9 .cse11 .cse13 .cse28 .cse10))))) [2021-11-23 03:33:47,659 INFO L858 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2021-11-23 03:33:47,660 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 307 331) the Hoare annotation is: (let ((.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse11 (= ~p_dw_i~0 1)) (.cse13 (= ~c_dr_pc~0 1)) (.cse14 (= ~p_dw_pc~0 1))) (let ((.cse2 (= ~q_free~0 0)) (.cse3 (not .cse14)) (.cse4 (not .cse13)) (.cse5 (= ~q_read_ev~0 0)) (.cse7 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse12 .cse10 .cse13 .cse14 .cse11)) (.cse9 (= |old(~c_dr_st~0)| 0)) (.cse1 (not .cse12)) (.cse6 (not .cse11)) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse8 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (= ~q_read_ev~0 1) .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8) (or (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse2) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse3 (= ~q_write_ev~0 0) .cse4 .cse5 .cse6 .cse7 .cse9 (= ~q_write_ev~0 1) .cse8) (or (not (= ~q_req_up~0 0)) (not .cse9) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse6 (not (= ~q_free~0 1)) (not .cse0) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse8)))) [2021-11-23 03:33:47,662 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2021-11-23 03:33:47,662 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2021-11-23 03:33:47,662 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2021-11-23 03:33:47,662 INFO L854 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 0))) (let ((.cse8 (= ~q_read_ev~0 0)) (.cse6 (= ~c_dr_st~0 0)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse0 (= ~q_read_ev~0 1)) (.cse7 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse13 (and (= ~q_req_up~0 1) .cse2)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse3 (not (= ~p_dw_pc~0 1))) (.cse15 (= ~q_write_ev~0 0)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse5 (= ~q_write_ev~0 1)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (and (not .cse5) (or .cse6 .cse7)) .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse5) .cse10) (or (not (= ~q_req_up~0 0)) .cse11 .cse7 (not .cse6) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= ~q_write_ev~0 2)) .cse9 (not (= ~q_free~0 1)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse10) (or .cse6 .cse7 .cse0 .cse12 .cse13 .cse1 .cse14 .cse3 .cse15 .cse4 .cse8 .cse9 .cse5 .cse10) (or .cse6 .cse11 (not .cse0) .cse7 .cse12 .cse13 .cse1 .cse14 .cse3 .cse15 .cse4 .cse9 .cse5 .cse10)))) [2021-11-23 03:33:47,662 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2021-11-23 03:33:47,663 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-11-23 03:33:47,663 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2021-11-23 03:33:47,663 INFO L858 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2021-11-23 03:33:47,663 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2021-11-23 03:33:47,663 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 271 288) the Hoare annotation is: (let ((.cse4 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse0 (= ~p_dw_st~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse6 (= |old(~q_write_ev~0)| 1)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (and .cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse5 (not (= 1 ~c_dr_i~0)))) (and (or (not (= ~q_req_up~0 0)) (not .cse0) (not .cse1) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= |old(~q_read_ev~0)| 2)) .cse3 (not (= ~q_free~0 1)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse4 (= ~q_read_ev~0 2)) .cse5) (or .cse1 (= |old(~q_read_ev~0)| 1) .cse6 .cse2 .cse7 (not .cse8) .cse9 .cse0 .cse10 .cse3 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse5) (or .cse1 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse8) .cse6 .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse7 .cse9 .cse10 .cse3 (= |old(~q_write_ev~0)| 0) .cse5)))) [2021-11-23 03:33:47,663 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2021-11-23 03:33:47,664 INFO L854 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse7 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= |old(~q_read_ev~0)| 1)) (.cse2 (and .cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse3 (= |old(~q_write_ev~0)| 1)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse8 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse5 (= ~q_free~0 0)) (.cse10 (= |old(~q_read_ev~0)| 0)) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse10 .cse11) (or (not .cse7) (and .cse12 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse4 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= |old(~q_read_ev~0)| 2)) .cse9 (not (= ~q_free~0 1)) (not (= |old(~q_req_up~0)| 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse11) (or .cse0 .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse3 .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse6 .cse8 .cse9 (and (= |old(~q_req_up~0)| 1) .cse5) (= |old(~q_write_ev~0)| 0) .cse10 .cse11)))) [2021-11-23 03:33:47,664 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2021-11-23 03:33:47,664 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2021-11-23 03:33:47,665 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse22 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse19 (= ~p_dw_st~0 0)) (.cse23 (= ~q_req_up~0 1)) (.cse4 (= ~q_free~0 1)) (.cse17 (= |old(~q_read_ev~0)| 0)) (.cse24 (= ~q_free~0 0)) (.cse7 (= ~c_dr_st~0 0))) (let ((.cse8 (= |old(~q_read_ev~0)| 1)) (.cse1 (not .cse7)) (.cse18 (not .cse24)) (.cse20 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse21 (and (or .cse23 .cse17) (or .cse4 .cse17))) (.cse0 (not .cse19)) (.cse9 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse10 (and .cse23 .cse24)) (.cse11 (= |old(~q_write_ev~0)| 1)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse13 (and .cse5 .cse22)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= ~p_dw_i~0 1))) (.cse16 (= |old(~q_write_ev~0)| 0)) (.cse6 (not (= 1 ~c_dr_i~0)))) (and (or (not (= ~q_req_up~0 0)) .cse0 .cse1 (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= |old(~q_read_ev~0)| 2)) .cse3 (not .cse4) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse5 (= ~q_read_ev~0 2)) .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6) (or .cse7 .cse8 .cse11 .cse2 .cse13 .cse18 .cse14 .cse19 .cse15 .cse3 .cse20 .cse6 .cse21) (or .cse8 .cse1 .cse2 (and .cse22 (= ~q_write_ev~0 1)) .cse18 .cse14 (not .cse11) .cse19 .cse15 .cse3 .cse20 .cse6 .cse21) (or .cse7 .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse14 .cse15 .cse3 .cse16 .cse17 .cse6)))) [2021-11-23 03:33:47,665 INFO L854 garLoopResultBuilder]: At program point L415(line 415) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) [2021-11-23 03:33:47,665 INFO L858 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2021-11-23 03:33:47,665 INFO L854 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse20 (= ~q_write_ev~0 1)) (.cse18 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= ~q_free~0 1)) (.cse21 (not (= ~q_req_up~0 1))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse4 (= ~p_dw_st~0 0))) (let ((.cse16 (not .cse4)) (.cse6 (not (= ~q_read_ev~0 1))) (.cse17 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse19 (or (and .cse9 (not .cse2)) (and .cse21 .cse9))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (not (= ~q_write_ev~0 0))) (.cse8 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (or .cse21 (not .cse18))) (.cse5 (= ~p_dw_i~0 1)) (.cse14 (not .cse20)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse4 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse5 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse6 .cse1 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse14 .cse15) (and .cse0 .cse16 .cse6 .cse1 .cse17 .cse3 .cse18 .cse11 .cse12 .cse19 .cse5 .cse20) (and .cse16 .cse6 .cse1 .cse17 .cse8 .cse3 .cse18 .cse11 .cse12 .cse19 .cse5 .cse14) (and .cse1 .cse7 .cse8 .cse3 .cse9 .cse10 .cse11 .cse12 .cse4 .cse13 .cse5 .cse14 .cse15)))) [2021-11-23 03:33:47,666 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-11-23 03:33:47,666 INFO L858 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2021-11-23 03:33:47,666 INFO L858 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2021-11-23 03:33:47,666 INFO L858 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2021-11-23 03:33:47,666 INFO L854 garLoopResultBuilder]: At program point L392(line 392) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse12 (not (= ~q_req_up~0 1))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~q_write_ev~0 2)) (.cse15 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse17 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ~q_req_up~0 0) .cse4 .cse5 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse6 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse7 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse3 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 (or .cse12 (not .cse13)) .cse6 .cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse15 .cse7 .cse1 .cse16 .cse3 .cse13 .cse10 .cse11 .cse17 .cse4 .cse6) (and .cse15 .cse7 .cse1 .cse16 .cse8 .cse3 .cse13 .cse10 .cse11 .cse17 .cse6 .cse14)))) [2021-11-23 03:33:47,668 INFO L854 garLoopResultBuilder]: At program point L392-1(line 392) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse12 (not (= ~q_req_up~0 1))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~q_write_ev~0 2)) (.cse15 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse17 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ~q_req_up~0 0) .cse4 .cse5 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse6 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse7 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse3 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 (or .cse12 (not .cse13)) .cse6 .cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse15 .cse7 .cse1 .cse16 .cse3 .cse13 .cse10 .cse11 .cse17 .cse4 .cse6) (and .cse15 .cse7 .cse1 .cse16 .cse8 .cse3 .cse13 .cse10 .cse11 .cse17 .cse6 .cse14)))) [2021-11-23 03:33:47,668 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-11-23 03:33:47,668 INFO L854 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (or (= ~p_dw_pc~0 0) (= ~p_dw_pc~0 1)) [2021-11-23 03:33:47,669 INFO L858 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2021-11-23 03:33:47,669 INFO L854 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2021-11-23 03:33:47,669 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2021-11-23 03:33:47,669 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2021-11-23 03:33:47,669 INFO L854 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse9 (not (= ~q_read_ev~0 1))) (.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse2 (= ~q_free~0 1)) (.cse3 (= 1 ~c_dr_i~0)) (.cse11 (not (= ~q_read_ev~0 0))) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse8 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_write_ev~0 2) .cse6 (= ~q_read_ev~0 2) .cse7 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0) .cse8) (and .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse12 (= 2 ~p_dw_st~0) .cse7 .cse13 .cse8) (and (= ~q_req_up~0 1) (not .cse6) .cse9 .cse0 .cse1 .cse10 .cse2 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse13 .cse8))) [2021-11-23 03:33:47,670 INFO L854 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse3 (= ~p_dw_st~0 0)) (.cse5 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~q_free~0 1) .cse2 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse3 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse5 .cse1 (not (= ~q_write_ev~0 0)) .cse6 .cse2 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse10)) .cse4 .cse11 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not .cse3) .cse5 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse2 .cse10 .cse7 .cse8 .cse9 .cse4 .cse11 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))))) [2021-11-23 03:33:47,670 INFO L858 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2021-11-23 03:33:47,670 INFO L854 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse12 (not (= ~q_req_up~0 1))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~q_write_ev~0 2)) (.cse15 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse13 (= ~q_free~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse17 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ~q_req_up~0 0) .cse4 .cse5 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse6 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse7 .cse1 (not (= ~q_write_ev~0 0)) .cse8 .cse3 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 (or .cse12 (not .cse13)) .cse6 .cse14 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse15 .cse7 .cse1 .cse16 .cse3 .cse13 .cse10 .cse11 .cse17 .cse4 .cse6) (and .cse15 .cse7 .cse1 .cse16 .cse8 .cse3 .cse13 .cse10 .cse11 .cse17 .cse6 .cse14)))) [2021-11-23 03:33:47,670 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2021-11-23 03:33:47,670 INFO L858 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2021-11-23 03:33:47,671 INFO L854 garLoopResultBuilder]: At program point L172(lines 172 176) the Hoare annotation is: (and (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (= ~p_dw_pc~0 1)) (.cse7 (let ((.cse9 (not (= ~q_read_ev~0 0)))) (or (and .cse9 (not (= ~q_free~0 1))) (and (not (= ~q_req_up~0 1)) .cse9)))) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) (or (not (= |old(~q_req_up~0)| 1)) (= ~q_free~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ~p_dw_st~0) .cse8 (not (= ~q_write_ev~0 1))) (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_write_ev~0 2) .cse8))) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) [2021-11-23 03:33:47,671 INFO L854 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 0)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse11 (= ~c_dr_st~0 2)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (or .cse21 .cse12)) (.cse14 (= ~p_num_write~0 0)) (.cse16 (= ~q_free~0 1)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_st~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~q_free~0 0)) (.cse17 (= ~q_write_ev~0 2)) (.cse13 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_pc~0 0)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse2 (< ~c_num_read~0 ~p_num_write~0)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) (or .cse12 .cse13)) (and .cse14 .cse0 .cse15 .cse11 .cse1 .cse16 .cse4 (= ~q_req_up~0 0) .cse6 .cse7 .cse17 .cse13 .cse8 .cse18 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) .cse19) (and .cse3 .cse14 .cse0 .cse15 .cse1 .cse16 .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse17 .cse13 .cse20 .cse8 .cse18 .cse19) (and .cse21 .cse3 (= ~q_req_up~0 1) .cse0 .cse15 .cse1 .cse4 .cse5 .cse17 .cse13 .cse20 .cse8 (= ~p_num_write~0 1))))) [2021-11-23 03:33:47,671 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2021-11-23 03:33:47,672 INFO L854 garLoopResultBuilder]: At program point L412(line 412) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) [2021-11-23 03:33:47,672 INFO L854 garLoopResultBuilder]: At program point L412-1(line 412) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) [2021-11-23 03:33:47,672 INFO L858 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2021-11-23 03:33:47,672 INFO L858 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2021-11-23 03:33:47,672 INFO L858 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2021-11-23 03:33:47,672 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 03:33:47,673 INFO L854 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse3 (= ~p_dw_st~0 0)) (.cse5 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~q_free~0 1) .cse2 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse3 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse5 .cse1 (not (= ~q_write_ev~0 0)) .cse6 .cse2 .cse7 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse10)) .cse4 .cse11 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not .cse3) .cse5 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse2 .cse10 .cse7 .cse8 .cse9 .cse4 .cse11 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))))) [2021-11-23 03:33:47,673 INFO L858 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2021-11-23 03:33:47,675 INFO L854 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_read_ev~0 2)) (.cse7 (= ~p_dw_i~0 1))) (or (let ((.cse10 (= ~p_dw_pc~0 1))) (and .cse0 (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (or (= ~p_dw_pc~0 0) .cse10)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= ~c_dr_st~0 2) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11))) (and .cse2 (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse11 .cse7 (or (not (= |old(~q_req_up~0)| 1)) (= ~q_free~0 1) (= |old(~q_read_ev~0)| ~q_read_ev~0)) (= ~q_req_up~0 ~p_dw_pc~0)))) [2021-11-23 03:33:47,676 INFO L854 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse23 (= ~q_req_up~0 1))) (let ((.cse3 (= ~q_free~0 1)) (.cse19 (not .cse23)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse27 (= ~q_free~0 0))) (let ((.cse13 (not (= ~q_write_ev~0 0))) (.cse20 (not .cse27)) (.cse24 (= ~c_dr_st~0 2)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse25 (not .cse6)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (not .cse0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (= ~p_dw_pc~0 1)) (.cse28 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse9 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 (= ~q_req_up~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse14 .cse4 .cse15 .cse16 .cse17 .cse18 (or .cse19 .cse20) .cse9 .cse21 .cse22) (and .cse12 .cse15 (or (and .cse2 .cse13 .cse14 .cse4 .cse16 .cse17 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse23 .cse24 .cse2 .cse4 .cse16 .cse17 .cse20 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse24 .cse2 .cse4 .cse16 .cse17 .cse18 .cse6 (= |exists_runnable_thread_#res| 1) .cse9 .cse21 .cse22))) (and .cse25 .cse12 .cse2 .cse26 .cse4 .cse27 .cse17 .cse18 .cse28 .cse5 .cse9) (and (= ~p_dw_pc~0 0) .cse1 .cse24 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse4 .cse27 .cse18 .cse5 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse25 .cse12 .cse2 .cse26 .cse14 .cse4 .cse27 .cse17 .cse18 .cse28 .cse9 .cse21))))) [2021-11-23 03:33:47,676 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-11-23 03:33:47,676 INFO L854 garLoopResultBuilder]: At program point L414(line 414) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) [2021-11-23 03:33:47,676 INFO L854 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse10 (= ~c_dr_st~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_free~0 0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse6 (= 2 ~p_dw_st~0)) (.cse7 (= ~p_dw_i~0 1))) (or (and (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse1 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ~c_dr_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= ~q_write_ev~0 0)) .cse1 (not .cse10) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) (and .cse10 (= ~q_req_up~0 1) (= ~c_num_read~0 0) .cse0 .cse2 .cse3 .cse5 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse6 .cse7 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)))) [2021-11-23 03:33:47,676 INFO L854 garLoopResultBuilder]: At program point L414-1(line 414) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 1) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) [2021-11-23 03:33:47,676 INFO L854 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse23 (= ~q_req_up~0 1))) (let ((.cse3 (= ~q_free~0 1)) (.cse19 (not .cse23)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse27 (= ~q_free~0 0))) (let ((.cse13 (not (= ~q_write_ev~0 0))) (.cse20 (not .cse27)) (.cse24 (= ~c_dr_st~0 2)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse25 (not .cse6)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse14 (not .cse0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (= ~p_dw_pc~0 1)) (.cse28 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse9 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 (= ~q_req_up~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse13 .cse14 .cse4 .cse15 .cse16 .cse17 .cse18 (or .cse19 .cse20) .cse9 .cse21 .cse22) (and .cse12 .cse15 (or (and .cse2 .cse13 .cse14 .cse4 .cse16 .cse17 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse23 .cse24 .cse2 .cse4 .cse16 .cse17 .cse20 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse24 .cse2 .cse4 .cse16 .cse17 .cse18 .cse6 (= |exists_runnable_thread_#res| 1) .cse9 .cse21 .cse22))) (and .cse25 .cse12 .cse2 .cse26 .cse4 .cse27 .cse17 .cse18 .cse28 .cse5 .cse9) (and (= ~p_dw_pc~0 0) .cse1 .cse24 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse4 .cse27 .cse18 .cse5 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse25 .cse12 .cse2 .cse26 .cse14 .cse4 .cse27 .cse17 .cse18 .cse28 .cse9 .cse21))))) [2021-11-23 03:33:47,677 INFO L854 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2021-11-23 03:33:47,677 INFO L854 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse7 (= 2 ~p_dw_st~0)) (.cse1 (= ~c_num_read~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse0 (= ~q_req_up~0 1)) (.cse18 (= ~p_dw_st~0 0)) (.cse9 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse11 (= ~q_free~0 1)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse12 (not (= ~q_read_ev~0 0))) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~q_free~0 0) (<= ~p_num_write~0 1) .cse5 .cse6 (= ~c_dr_pc~0 0) .cse7 .cse8 (<= 1 ~p_num_write~0) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse7 .cse8 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse13 (let ((.cse17 (= ~p_dw_pc~0 0))) (or (and .cse17 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse17 (= ~c_dr_pc~0 1)))) (= ~q_write_ev~0 2) .cse18 .cse6 .cse8 .cse14 (= ~q_req_up~0 ~p_dw_pc~0) .cse16) (and .cse0 (not .cse18) .cse9 .cse2 .cse10 .cse11 .cse3 .cse4 .cse12 .cse13 .cse5 .cse8 .cse14 .cse15 .cse16))) [2021-11-23 03:33:47,677 INFO L854 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse3 (= ~p_dw_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~q_free~0 1) .cse2 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse3 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and (not .cse3) (not (= ~q_read_ev~0 1)) .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse2 .cse6 (not (= ~q_read_ev~0 0)) .cse7 .cse8 .cse4 .cse9) (and .cse1 (not (= ~q_write_ev~0 0)) .cse5 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse4 .cse9 (< ~c_num_read~0 (+ ~p_num_write~0 1)))))) [2021-11-23 03:33:47,677 INFO L854 garLoopResultBuilder]: At program point L431-1(line 431) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse3 (= ~p_dw_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse9 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse4 (= ~p_dw_i~0 1))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~q_free~0 1) .cse2 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse3 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and .cse1 (not (= ~q_write_ev~0 0)) .cse5 .cse2 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 (or (not (= ~q_req_up~0 1)) (not .cse9)) .cse4 (not (= ~q_write_ev~0 1)) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not .cse3) (not (= ~q_read_ev~0 1)) .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse5 .cse2 .cse9 .cse6 .cse7 .cse8 .cse4)))) [2021-11-23 03:33:47,677 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2021-11-23 03:33:47,677 INFO L858 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2021-11-23 03:33:47,677 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2021-11-23 03:33:47,678 INFO L854 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~q_read_ev~0 1)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (= ~q_free~0 0)) (.cse5 (not (= ~p_dw_pc~0 1))) (.cse6 (= ~p_dw_st~0 0)) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse8 (= ~q_read_ev~0 0)) (.cse9 (not (= ~p_dw_i~0 1))) (.cse2 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 (and (not .cse1) .cse2) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse3) .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse5 (and .cse1 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse6 (= ~q_write_ev~0 0) .cse7 .cse8 .cse9 (= ~q_write_ev~0 1) .cse10) (or (not (= ~q_req_up~0 0)) (not .cse6) (not .cse0) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse4 (not (= ~c_num_read~0 0)) (not (= ~c_dr_pc~0 ~p_dw_pc~0)) (not (= ~q_write_ev~0 2)) .cse9 (not (= ~q_free~0 1)) .cse2 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse10) (or .cse1 .cse4 (not .cse3) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse2 .cse10))) [2021-11-23 03:33:47,678 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2021-11-23 03:33:47,678 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2021-11-23 03:33:47,678 INFO L858 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2021-11-23 03:33:47,678 INFO L858 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-11-23 03:33:47,679 INFO L861 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2021-11-23 03:33:47,682 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:33:47,684 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 03:33:47,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:33:47 BoogieIcfgContainer [2021-11-23 03:33:47,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 03:33:47,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 03:33:47,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 03:33:47,801 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 03:33:47,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:31:25" (3/4) ... [2021-11-23 03:33:47,804 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 03:33:47,809 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-11-23 03:33:47,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-11-23 03:33:47,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-23 03:33:47,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-11-23 03:33:47,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-11-23 03:33:47,810 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-11-23 03:33:47,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-23 03:33:47,811 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2021-11-23 03:33:47,828 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2021-11-23 03:33:47,829 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-11-23 03:33:47,830 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-23 03:33:47,830 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 03:33:47,857 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_dr_st == 0 || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((!(p_dw_st == 0) || ((q_write_ev == \old(q_write_ev) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(c_num_read < p_num_write + 1)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) [2021-11-23 03:33:47,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((!(q_read_ev == 1) && !(q_read_ev == 0)) && ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || (((((((((((q_req_up == 1 && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && !(q_free == 0)) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && \result == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)))) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) || ((((((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) && c_num_read < p_num_write + 1)) || ((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1) && q_write_ev == p_dw_st)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-11-23 03:33:47,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && ((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || ((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1))) && (p_dw_pc == 1 || q_read_ev == 2)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && q_write_ev == 2) && q_read_ev == 2) && p_dw_i == 1) && ((!(\old(q_req_up) == 1) || q_free == 1) || \old(q_read_ev) == q_read_ev)) && q_req_up == p_dw_pc) [2021-11-23 03:33:47,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) && tmp___1 == 1 [2021-11-23 03:33:47,921 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 03:33:47,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 03:33:47,922 INFO L158 Benchmark]: Toolchain (without parser) took 144061.79ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 998.2MB). Free memory was 52.4MB in the beginning and 740.5MB in the end (delta: -688.1MB). Peak memory consumption was 309.7MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,922 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:33:47,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.35ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.1MB in the beginning and 86.4MB in the end (delta: -34.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.50ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 84.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,923 INFO L158 Benchmark]: Boogie Preprocessor took 38.00ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,928 INFO L158 Benchmark]: RCFGBuilder took 753.46ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 62.8MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,929 INFO L158 Benchmark]: TraceAbstraction took 142580.18ms. Allocated memory was 113.2MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 62.5MB in the beginning and 748.9MB in the end (delta: -686.4MB). Peak memory consumption was 669.0MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,929 INFO L158 Benchmark]: Witness Printer took 125.24ms. Allocated memory is still 1.1GB. Free memory was 748.9MB in the beginning and 740.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 03:33:47,935 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.37ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 59.8MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.35ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 52.1MB in the beginning and 86.4MB in the end (delta: -34.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.50ms. Allocated memory is still 113.2MB. Free memory was 86.4MB in the beginning and 84.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.00ms. Allocated memory is still 113.2MB. Free memory was 84.4MB in the beginning and 83.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.46ms. Allocated memory is still 113.2MB. Free memory was 82.8MB in the beginning and 62.8MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 142580.18ms. Allocated memory was 113.2MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 62.5MB in the beginning and 748.9MB in the end (delta: -686.4MB). Peak memory consumption was 669.0MB. Max. memory is 16.1GB. * Witness Printer took 125.24ms. Allocated memory is still 1.1GB. Free memory was 748.9MB in the beginning and 740.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 142.4s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 31.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9132 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9102 mSDsluCounter, 10020 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8895 mSDsCounter, 5883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16101 IncrementalHoareTripleChecker+Invalid, 21984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5883 mSolverCounterUnsat, 2227 mSDtfsCounter, 16101 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2517 GetRequests, 1758 SyntacticMatches, 33 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56611 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=17, InterpolantAutomatonStates: 444, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 5185 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 2389 PreInvPairs, 2506 NumberOfFragments, 5334 HoareAnnotationTreeSize, 2389 FomulaSimplifications, 48695 FormulaSimplificationTreeSizeReduction, 26.8s HoareSimplificationTime, 37 FomulaSimplificationsInter, 1819609 FormulaSimplificationTreeSizeReductionInter, 17.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 2682 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3177 ConstructedInterpolants, 0 QuantifiedInterpolants, 10041 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3939 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 1729/1995 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((q_req_up == 1 && c_num_read == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && p_num_write <= 1) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && p_dw_i == 1) && 1 <= p_num_write) && q_write_ev == p_dw_st) || (((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || (((((((((((((c_num_read == 0 && p_last_write == q_buf_0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && ((p_dw_pc == 0 && c_dr_pc == p_dw_pc) || (p_dw_pc == 0 && c_dr_pc == 1))) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) && c_num_read < p_num_write + 1)) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && p_dw_pc == 1) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) && c_num_read < p_num_write + 1) || (((((((((((((!(q_read_ev == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && c_dr_st == 2) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) && tmp___1 == 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && (((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1) || (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1))) && (p_dw_pc == 1 || q_read_ev == 2)) || (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && q_write_ev == 2) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && tmp___1 == 1) && q_req_up == p_dw_pc)) || (((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 0) && q_req_up == 1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && q_free == 0) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((q_read_ev == 1 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || (!(q_write_ev == 1) && (c_dr_st == 0 || __retres1 == 0))) || q_read_ev == 0) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i)) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || __retres1 == 0) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || __retres1 == 0) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || q_write_ev == 1) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || !(p_dw_st == 0)) || !(q_read_ev == 1)) || __retres1 == 0) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || q_write_ev == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || q_write_ev == 1) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: p_dw_pc == 0 || p_dw_pc == 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 || (!(q_read_ev == 1) && __retres1 == 0)) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || (q_read_ev == 1 && 1 <= __retres1)) || p_dw_st == 0) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || q_write_ev == 1) || !(1 == c_dr_i)) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || __retres1 == 0) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && ((((((((((q_read_ev == 1 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || __retres1 == 0) || !(1 == c_dr_i)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((!(q_read_ev == 1) && !(q_read_ev == 0)) && ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || (((((((((((q_req_up == 1 && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && !(q_free == 0)) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && \result == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)))) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) || ((((((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) && c_num_read < p_num_write + 1)) || ((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1) && q_write_ev == p_dw_st)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && ((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || ((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1))) && (p_dw_pc == 1 || q_read_ev == 2)) || ((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && q_write_ev == 2) && q_read_ev == 2) && p_dw_i == 1) && ((!(\old(q_req_up) == 1) || q_free == 1) || \old(q_read_ev) == q_read_ev)) && q_req_up == p_dw_pc) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((!(q_read_ev == 1) && !(q_read_ev == 0)) && (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1) || (((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1))) || ((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && p_dw_i == 1) && p_num_write == 1) && q_write_ev == p_dw_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((c_dr_st == 0 || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((!(p_dw_st == 0) || ((q_write_ev == \old(q_write_ev) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(1 == c_dr_i))) && (((((((((((((c_dr_st == 0 || \old(q_read_ev) == 1) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(c_num_read < p_num_write + 1)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && p_dw_i == 1) && !(q_write_ev == 1)) RESULT: Ultimate proved your program to be correct! [2021-11-23 03:33:48,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02099263-f160-4e85-b8db-db5a83acaa7e/bin/utaipan-EQgc7hIp5V/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 Result: TRUE