./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/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_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:34:58,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:34:58,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:34:58,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:34:58,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:34:58,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:34:58,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:34:58,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:34:58,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:34:58,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:34:58,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:34:58,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:34:58,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:34:58,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:34:58,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:34:58,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:34:58,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:34:58,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:34:58,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:34:58,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:34:58,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:34:58,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:34:58,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:34:58,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:34:58,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:34:58,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:34:58,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:34:58,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:34:58,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:34:58,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:34:58,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:34:58,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:34:58,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:34:58,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:34:58,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:34:58,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:34:58,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:34:58,697 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:34:58,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:34:58,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:34:58,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:34:58,699 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:34:58,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:34:58,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:34:58,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:34:58,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:34:58,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:34:58,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:34:58,725 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:34:58,726 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:34:58,726 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:34:58,726 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:34:58,726 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:34:58,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:34:58,727 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:34:58,727 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:34:58,727 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:34:58,727 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:34:58,727 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:34:58,728 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:34:58,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:34:58,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:34:58,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:34:58,730 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:34:58,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:34:58,730 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:34:58,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:34:58,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:34:58,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:34:58,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:34:58,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:34:58,731 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:34:58,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:34:58,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/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_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh 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 [2022-12-14 13:34:58,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:34:58,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:34:58,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:34:58,977 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:34:58,978 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:34:58,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-12-14 13:35:01,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:35:01,689 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:35:01,689 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-12-14 13:35:01,695 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/data/c7a3929dd/5714b46287ca46ab8a4c3c198d1d3310/FLAG5d5039720 [2022-12-14 13:35:01,708 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/data/c7a3929dd/5714b46287ca46ab8a4c3c198d1d3310 [2022-12-14 13:35:01,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:35:01,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:35:01,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:35:01,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:35:01,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:35:01,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45202649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01, skipping insertion in model container [2022-12-14 13:35:01,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:35:01,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:35:01,848 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-12-14 13:35:01,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:35:01,888 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:35:01,897 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-12-14 13:35:01,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:35:01,924 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:35:01,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01 WrapperNode [2022-12-14 13:35:01,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:35:01,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:35:01,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:35:01,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:35:01,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,953 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2022-12-14 13:35:01,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:35:01,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:35:01,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:35:01,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:35:01,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:35:01,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:35:01,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:35:01,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:35:01,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (1/1) ... [2022-12-14 13:35:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:35:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:02,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:35:02,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:35:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:35:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 13:35:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-14 13:35:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-14 13:35:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-14 13:35:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 13:35:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-14 13:35:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-14 13:35:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:35:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-14 13:35:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-14 13:35:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:35:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:35:02,049 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-14 13:35:02,049 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-14 13:35:02,108 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:35:02,110 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:35:02,364 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:35:02,469 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:35:02,469 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 13:35:02,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:02 BoogieIcfgContainer [2022-12-14 13:35:02,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:35:02,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:35:02,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:35:02,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:35:02,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:35:01" (1/3) ... [2022-12-14 13:35:02,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5617b422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:02, skipping insertion in model container [2022-12-14 13:35:02,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:35:01" (2/3) ... [2022-12-14 13:35:02,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5617b422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:35:02, skipping insertion in model container [2022-12-14 13:35:02,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:02" (3/3) ... [2022-12-14 13:35:02,482 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2022-12-14 13:35:02,498 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:35:02,498 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:35:02,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:35:02,546 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@34454081, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:35:02,546 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 13:35:02,549 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) [2022-12-14 13:35:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 13:35:02,557 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:02,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:02,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1931162233, now seen corresponding path program 1 times [2022-12-14 13:35:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894852376] [2022-12-14 13:35:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:02,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894852376] [2022-12-14 13:35:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894852376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:02,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:02,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000913654] [2022-12-14 13:35:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:02,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:02,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:02,846 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) [2022-12-14 13:35:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:03,004 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2022-12-14 13:35:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:35:03,006 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 [2022-12-14 13:35:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:03,012 INFO L225 Difference]: With dead ends: 200 [2022-12-14 13:35:03,012 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 13:35:03,015 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:03,017 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:03,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 220 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 13:35:03,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2022-12-14 13:35:03,049 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) [2022-12-14 13:35:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-12-14 13:35:03,051 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 44 [2022-12-14 13:35:03,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:03,052 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-12-14 13:35:03,052 INFO L496 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) [2022-12-14 13:35:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-12-14 13:35:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-12-14 13:35:03,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:03,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:03,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:35:03,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1444830440, now seen corresponding path program 1 times [2022-12-14 13:35:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:03,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948878770] [2022-12-14 13:35:03,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:03,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:03,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948878770] [2022-12-14 13:35:03,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948878770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:03,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:03,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 13:35:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119829939] [2022-12-14 13:35:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:03,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:03,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:35:03,138 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) [2022-12-14 13:35:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:03,520 INFO L93 Difference]: Finished difference Result 524 states and 656 transitions. [2022-12-14 13:35:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:35:03,520 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 [2022-12-14 13:35:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:03,525 INFO L225 Difference]: With dead ends: 524 [2022-12-14 13:35:03,525 INFO L226 Difference]: Without dead ends: 392 [2022-12-14 13:35:03,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:35:03,528 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 440 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:03,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 535 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:35:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-12-14 13:35:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2022-12-14 13:35:03,573 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) [2022-12-14 13:35:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 371 transitions. [2022-12-14 13:35:03,576 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 371 transitions. Word has length 44 [2022-12-14 13:35:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:03,576 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 371 transitions. [2022-12-14 13:35:03,576 INFO L496 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) [2022-12-14 13:35:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 371 transitions. [2022-12-14 13:35:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 13:35:03,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:03,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:03,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:35:03,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2147229394, now seen corresponding path program 1 times [2022-12-14 13:35:03,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:03,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123523844] [2022-12-14 13:35:03,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:03,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:03,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:03,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123523844] [2022-12-14 13:35:03,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123523844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:03,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:03,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 13:35:03,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130529063] [2022-12-14 13:35:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:03,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:35:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:35:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:35:03,773 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) [2022-12-14 13:35:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:04,086 INFO L93 Difference]: Finished difference Result 824 states and 987 transitions. [2022-12-14 13:35:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:35:04,087 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 [2022-12-14 13:35:04,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:04,090 INFO L225 Difference]: With dead ends: 824 [2022-12-14 13:35:04,090 INFO L226 Difference]: Without dead ends: 522 [2022-12-14 13:35:04,092 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:04,094 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 190 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:04,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 298 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-12-14 13:35:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 487. [2022-12-14 13:35:04,143 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) [2022-12-14 13:35:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 581 transitions. [2022-12-14 13:35:04,145 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 581 transitions. Word has length 45 [2022-12-14 13:35:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:04,146 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 581 transitions. [2022-12-14 13:35:04,146 INFO L496 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) [2022-12-14 13:35:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 581 transitions. [2022-12-14 13:35:04,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 13:35:04,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:04,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:35:04,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:35:04,147 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:04,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1471751496, now seen corresponding path program 1 times [2022-12-14 13:35:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:04,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113705190] [2022-12-14 13:35:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:04,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:04,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113705190] [2022-12-14 13:35:04,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113705190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:04,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:04,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:04,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139036809] [2022-12-14 13:35:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:04,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:04,179 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) [2022-12-14 13:35:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:04,274 INFO L93 Difference]: Finished difference Result 1051 states and 1251 transitions. [2022-12-14 13:35:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:04,275 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 [2022-12-14 13:35:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:04,278 INFO L225 Difference]: With dead ends: 1051 [2022-12-14 13:35:04,278 INFO L226 Difference]: Without dead ends: 619 [2022-12-14 13:35:04,280 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:04,281 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 67 mSDsluCounter, 52 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:04,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 142 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-12-14 13:35:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 514. [2022-12-14 13:35:04,342 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) [2022-12-14 13:35:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 610 transitions. [2022-12-14 13:35:04,344 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 610 transitions. Word has length 46 [2022-12-14 13:35:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:04,344 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 610 transitions. [2022-12-14 13:35:04,345 INFO L496 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) [2022-12-14 13:35:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 610 transitions. [2022-12-14 13:35:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-14 13:35:04,346 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:04,346 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:04,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:35:04,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:04,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1253290619, now seen corresponding path program 1 times [2022-12-14 13:35:04,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:04,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420739210] [2022-12-14 13:35:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:35:04,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420739210] [2022-12-14 13:35:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420739210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:04,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:04,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386937557] [2022-12-14 13:35:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:04,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:04,392 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) [2022-12-14 13:35:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:04,455 INFO L93 Difference]: Finished difference Result 704 states and 831 transitions. [2022-12-14 13:35:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:04,456 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 [2022-12-14 13:35:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:04,457 INFO L225 Difference]: With dead ends: 704 [2022-12-14 13:35:04,457 INFO L226 Difference]: Without dead ends: 431 [2022-12-14 13:35:04,458 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:04,458 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 60 mSDsluCounter, 61 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:04,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 149 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-12-14 13:35:04,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 322. [2022-12-14 13:35:04,486 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) [2022-12-14 13:35:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2022-12-14 13:35:04,488 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 52 [2022-12-14 13:35:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:04,489 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2022-12-14 13:35:04,489 INFO L496 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) [2022-12-14 13:35:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2022-12-14 13:35:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 13:35:04,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:04,491 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:04,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:35:04,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -749148176, now seen corresponding path program 1 times [2022-12-14 13:35:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292254421] [2022-12-14 13:35:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:04,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:04,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292254421] [2022-12-14 13:35:04,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292254421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:04,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:04,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:35:04,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069981762] [2022-12-14 13:35:04,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:04,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:35:04,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:04,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:35:04,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:35:04,558 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) [2022-12-14 13:35:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:04,683 INFO L93 Difference]: Finished difference Result 425 states and 488 transitions. [2022-12-14 13:35:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:35:04,684 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 [2022-12-14 13:35:04,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:04,686 INFO L225 Difference]: With dead ends: 425 [2022-12-14 13:35:04,686 INFO L226 Difference]: Without dead ends: 422 [2022-12-14 13:35:04,686 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:04,687 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 159 mSDsluCounter, 40 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 [2022-12-14 13:35:04,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 125 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-12-14 13:35:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 321. [2022-12-14 13:35:04,721 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) [2022-12-14 13:35:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 368 transitions. [2022-12-14 13:35:04,723 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 368 transitions. Word has length 53 [2022-12-14 13:35:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:04,724 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 368 transitions. [2022-12-14 13:35:04,724 INFO L496 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) [2022-12-14 13:35:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 368 transitions. [2022-12-14 13:35:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-14 13:35:04,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:04,725 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:04,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:35:04,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:04,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:04,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1749108831, now seen corresponding path program 1 times [2022-12-14 13:35:04,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:04,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995434564] [2022-12-14 13:35:04,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:04,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:04,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:04,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995434564] [2022-12-14 13:35:04,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995434564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:04,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344145811] [2022-12-14 13:35:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:04,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:04,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:35:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:04,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 13:35:04,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:05,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:35:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:05,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344145811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:35:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1235147573] [2022-12-14 13:35:05,307 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-12-14 13:35:05,307 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:35:05,311 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:35:05,316 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:35:05,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:35:06,270 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 39 for LOIs [2022-12-14 13:35:06,274 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 71 for LOIs [2022-12-14 13:35:06,286 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 71 for LOIs [2022-12-14 13:35:06,297 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 78 for LOIs [2022-12-14 13:35:06,312 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 67 for LOIs [2022-12-14 13:35:06,320 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 75 for LOIs [2022-12-14 13:35:06,473 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 71 for LOIs [2022-12-14 13:35:06,488 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 71 for LOIs [2022-12-14 13:35:06,501 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:35:10,790 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 [2022-12-14 13:35:10,791 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:35:10,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:35:10,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-12-14 13:35:10,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025183352] [2022-12-14 13:35:10,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:35:10,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 13:35:10,793 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) [2022-12-14 13:35:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:11,111 INFO L93 Difference]: Finished difference Result 894 states and 1023 transitions. [2022-12-14 13:35:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:35:11,111 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 [2022-12-14 13:35:11,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:11,118 INFO L225 Difference]: With dead ends: 894 [2022-12-14 13:35:11,118 INFO L226 Difference]: Without dead ends: 891 [2022-12-14 13:35:11,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2022-12-14 13:35:11,120 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 299 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:11,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 575 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-12-14 13:35:11,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 616. [2022-12-14 13:35:11,204 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) [2022-12-14 13:35:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 707 transitions. [2022-12-14 13:35:11,207 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 707 transitions. Word has length 54 [2022-12-14 13:35:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:11,208 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 707 transitions. [2022-12-14 13:35:11,208 INFO L496 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) [2022-12-14 13:35:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 707 transitions. [2022-12-14 13:35:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 13:35:11,209 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:11,210 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:11,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:35:11,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:11,411 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:11,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1705638224, now seen corresponding path program 2 times [2022-12-14 13:35:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:11,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760980371] [2022-12-14 13:35:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:11,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:35:11,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:11,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760980371] [2022-12-14 13:35:11,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760980371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:11,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:11,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074541432] [2022-12-14 13:35:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:11,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:11,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:11,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:11,447 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) [2022-12-14 13:35:11,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:11,549 INFO L93 Difference]: Finished difference Result 1029 states and 1180 transitions. [2022-12-14 13:35:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:11,549 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 [2022-12-14 13:35:11,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:11,552 INFO L225 Difference]: With dead ends: 1029 [2022-12-14 13:35:11,552 INFO L226 Difference]: Without dead ends: 618 [2022-12-14 13:35:11,553 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:11,554 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 66 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 [2022-12-14 13:35:11,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:11,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-12-14 13:35:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2022-12-14 13:35:11,630 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) [2022-12-14 13:35:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 695 transitions. [2022-12-14 13:35:11,633 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 695 transitions. Word has length 57 [2022-12-14 13:35:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:11,633 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 695 transitions. [2022-12-14 13:35:11,634 INFO L496 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) [2022-12-14 13:35:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 695 transitions. [2022-12-14 13:35:11,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 13:35:11,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:11,635 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:35:11,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:11,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash -561189429, now seen corresponding path program 1 times [2022-12-14 13:35:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:11,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982310374] [2022-12-14 13:35:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:11,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:35:11,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:11,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982310374] [2022-12-14 13:35:11,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982310374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:11,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:11,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41823578] [2022-12-14 13:35:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:11,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:11,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:11,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:11,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:11,683 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) [2022-12-14 13:35:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:11,818 INFO L93 Difference]: Finished difference Result 1231 states and 1405 transitions. [2022-12-14 13:35:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:11,819 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 [2022-12-14 13:35:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:11,822 INFO L225 Difference]: With dead ends: 1231 [2022-12-14 13:35:11,822 INFO L226 Difference]: Without dead ends: 868 [2022-12-14 13:35:11,824 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:11,824 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 42 mSDsluCounter, 69 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 [2022-12-14 13:35:11,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 178 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-12-14 13:35:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 687. [2022-12-14 13:35:11,882 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) [2022-12-14 13:35:11,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 784 transitions. [2022-12-14 13:35:11,885 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 784 transitions. Word has length 60 [2022-12-14 13:35:11,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:11,885 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 784 transitions. [2022-12-14 13:35:11,885 INFO L496 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) [2022-12-14 13:35:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 784 transitions. [2022-12-14 13:35:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-14 13:35:11,886 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:11,887 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:11,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:35:11,887 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:11,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:11,887 INFO L85 PathProgramCache]: Analyzing trace with hash -432176331, now seen corresponding path program 1 times [2022-12-14 13:35:11,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:11,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095989699] [2022-12-14 13:35:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:35:12,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:12,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095989699] [2022-12-14 13:35:12,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095989699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:12,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:12,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 13:35:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30942928] [2022-12-14 13:35:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:12,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:35:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:12,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:35:12,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:35:12,017 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) [2022-12-14 13:35:12,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:12,379 INFO L93 Difference]: Finished difference Result 1736 states and 1967 transitions. [2022-12-14 13:35:12,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:35:12,380 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 [2022-12-14 13:35:12,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:12,384 INFO L225 Difference]: With dead ends: 1736 [2022-12-14 13:35:12,384 INFO L226 Difference]: Without dead ends: 1055 [2022-12-14 13:35:12,386 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:12,386 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 172 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:12,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 280 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:35:12,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-12-14 13:35:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1006. [2022-12-14 13:35:12,519 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) [2022-12-14 13:35:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1132 transitions. [2022-12-14 13:35:12,523 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1132 transitions. Word has length 69 [2022-12-14 13:35:12,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:12,523 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1132 transitions. [2022-12-14 13:35:12,524 INFO L496 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) [2022-12-14 13:35:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1132 transitions. [2022-12-14 13:35:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 13:35:12,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:12,525 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:12,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:35:12,525 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:12,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1809828446, now seen corresponding path program 1 times [2022-12-14 13:35:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:12,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304060828] [2022-12-14 13:35:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:35:12,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:12,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304060828] [2022-12-14 13:35:12,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304060828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:12,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:35:12,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:35:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34257623] [2022-12-14 13:35:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:35:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:12,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:35:12,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:35:12,576 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) [2022-12-14 13:35:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:12,757 INFO L93 Difference]: Finished difference Result 1972 states and 2226 transitions. [2022-12-14 13:35:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:35:12,758 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 [2022-12-14 13:35:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:12,762 INFO L225 Difference]: With dead ends: 1972 [2022-12-14 13:35:12,763 INFO L226 Difference]: Without dead ends: 1182 [2022-12-14 13:35:12,764 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:12,765 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 37 mSDsluCounter, 69 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 [2022-12-14 13:35:12,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 172 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-12-14 13:35:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1053. [2022-12-14 13:35:12,922 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) [2022-12-14 13:35:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1186 transitions. [2022-12-14 13:35:12,928 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1186 transitions. Word has length 70 [2022-12-14 13:35:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:12,928 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1186 transitions. [2022-12-14 13:35:12,928 INFO L496 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) [2022-12-14 13:35:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1186 transitions. [2022-12-14 13:35:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 13:35:12,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:12,930 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:12,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:35:12,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1344657702, now seen corresponding path program 1 times [2022-12-14 13:35:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:12,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347996229] [2022-12-14 13:35:12,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-14 13:35:13,241 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347996229] [2022-12-14 13:35:13,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347996229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:13,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138222703] [2022-12-14 13:35:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:13,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:13,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:13,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:13,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:35:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:13,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:35:13,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:35:13,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:35:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138222703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:13,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:35:13,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-12-14 13:35:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521988857] [2022-12-14 13:35:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:13,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:35:13,363 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) [2022-12-14 13:35:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:13,535 INFO L93 Difference]: Finished difference Result 1917 states and 2191 transitions. [2022-12-14 13:35:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:35:13,536 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 [2022-12-14 13:35:13,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:13,539 INFO L225 Difference]: With dead ends: 1917 [2022-12-14 13:35:13,539 INFO L226 Difference]: Without dead ends: 870 [2022-12-14 13:35:13,541 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:13,542 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:13,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 514 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:35:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-12-14 13:35:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 685. [2022-12-14 13:35:13,622 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) [2022-12-14 13:35:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 774 transitions. [2022-12-14 13:35:13,626 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 774 transitions. Word has length 101 [2022-12-14 13:35:13,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:13,626 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 774 transitions. [2022-12-14 13:35:13,626 INFO L496 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) [2022-12-14 13:35:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 774 transitions. [2022-12-14 13:35:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 13:35:13,628 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:13,628 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:13,634 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:35:13,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 13:35:13,829 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1581250753, now seen corresponding path program 1 times [2022-12-14 13:35:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588526932] [2022-12-14 13:35:13,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:13,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,045 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 13:35:14,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:14,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588526932] [2022-12-14 13:35:14,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588526932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:14,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138913365] [2022-12-14 13:35:14,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:14,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:14,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:14,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 13:35:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 13:35:14,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:35:14,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:35:14,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138913365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:14,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:35:14,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-12-14 13:35:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034874264] [2022-12-14 13:35:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:14,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:14,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 13:35:14,185 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) [2022-12-14 13:35:14,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:14,382 INFO L93 Difference]: Finished difference Result 1234 states and 1399 transitions. [2022-12-14 13:35:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:35:14,383 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 [2022-12-14 13:35:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:14,384 INFO L225 Difference]: With dead ends: 1234 [2022-12-14 13:35:14,385 INFO L226 Difference]: Without dead ends: 641 [2022-12-14 13:35:14,385 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:14,386 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 63 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:14,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 492 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-12-14 13:35:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 549. [2022-12-14 13:35:14,477 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) [2022-12-14 13:35:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 619 transitions. [2022-12-14 13:35:14,480 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 619 transitions. Word has length 111 [2022-12-14 13:35:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:14,480 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 619 transitions. [2022-12-14 13:35:14,481 INFO L496 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) [2022-12-14 13:35:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 619 transitions. [2022-12-14 13:35:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 13:35:14,482 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:14,482 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:14,487 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 13:35:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 13:35:14,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:14,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1142377384, now seen corresponding path program 1 times [2022-12-14 13:35:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:14,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170311088] [2022-12-14 13:35:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-14 13:35:14,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170311088] [2022-12-14 13:35:14,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170311088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:14,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627789427] [2022-12-14 13:35:14,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:14,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:14,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:14,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 13:35:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:14,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:35:14,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 13:35:15,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:35:15,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627789427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:35:15,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:35:15,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-12-14 13:35:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315402527] [2022-12-14 13:35:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:35:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:35:15,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-12-14 13:35:15,034 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) [2022-12-14 13:35:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:15,209 INFO L93 Difference]: Finished difference Result 1298 states and 1464 transitions. [2022-12-14 13:35:15,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:35:15,210 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 [2022-12-14 13:35:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:15,212 INFO L225 Difference]: With dead ends: 1298 [2022-12-14 13:35:15,212 INFO L226 Difference]: Without dead ends: 841 [2022-12-14 13:35:15,213 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:15,213 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 42 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:15,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 478 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-12-14 13:35:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 807. [2022-12-14 13:35:15,289 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) [2022-12-14 13:35:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 907 transitions. [2022-12-14 13:35:15,291 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 907 transitions. Word has length 112 [2022-12-14 13:35:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:15,291 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 907 transitions. [2022-12-14 13:35:15,291 INFO L496 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) [2022-12-14 13:35:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 907 transitions. [2022-12-14 13:35:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 13:35:15,292 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:15,293 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:15,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 13:35:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:15,493 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:15,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash -875617042, now seen corresponding path program 1 times [2022-12-14 13:35:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:15,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184092365] [2022-12-14 13:35:15,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:15,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-14 13:35:16,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184092365] [2022-12-14 13:35:16,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184092365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:16,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456041626] [2022-12-14 13:35:16,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:16,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:16,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:16,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:16,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 13:35:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:16,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-14 13:35:16,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:35:16,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:35:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 13:35:18,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456041626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:35:18,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617705467] [2022-12-14 13:35:18,234 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-12-14 13:35:18,234 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:35:18,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:35:18,235 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:35:18,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:35:28,438 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 40 for LOIs [2022-12-14 13:35:28,440 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 50 for LOIs [2022-12-14 13:35:28,445 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 25 for LOIs [2022-12-14 13:35:28,448 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 60 for LOIs [2022-12-14 13:35:28,455 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 25 for LOIs [2022-12-14 13:35:28,457 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 25 for LOIs [2022-12-14 13:35:28,557 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 25 for LOIs [2022-12-14 13:35:28,578 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 43 for LOIs [2022-12-14 13:35:28,608 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:35:35,805 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '36081#(and (= ~q_req_up~0 1) (<= ~p_dw_pc~0 1) (<= 0 ~c_dr_pc~0) (<= 0 ~p_dw_st~0) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (<= ~c_dr_pc~0 1) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= 1 ~c_num_read~0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= |#NULL.base| 0))' at error location [2022-12-14 13:35:35,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:35:35,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:35:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16, 16] total 54 [2022-12-14 13:35:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114956103] [2022-12-14 13:35:35,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:35:35,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 13:35:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 13:35:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=10179, Unknown=0, NotChecked=0, Total=10920 [2022-12-14 13:35:35,813 INFO L87 Difference]: Start difference. First operand 807 states and 907 transitions. Second operand has 54 states, 34 states have (on average 5.705882352941177) internal successors, (194), 38 states have internal predecessors, (194), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-12-14 13:35:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:50,258 INFO L93 Difference]: Finished difference Result 3091 states and 3561 transitions. [2022-12-14 13:35:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2022-12-14 13:35:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 34 states have (on average 5.705882352941177) internal successors, (194), 38 states have internal predecessors, (194), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) Word has length 113 [2022-12-14 13:35:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:50,264 INFO L225 Difference]: With dead ends: 3091 [2022-12-14 13:35:50,264 INFO L226 Difference]: Without dead ends: 2376 [2022-12-14 13:35:50,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 282 SyntacticMatches, 11 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46911 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=10856, Invalid=101704, Unknown=0, NotChecked=0, Total=112560 [2022-12-14 13:35:50,276 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 2971 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 5458 mSolverCounterSat, 1899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2971 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 7357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1899 IncrementalHoareTripleChecker+Valid, 5458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:50,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2971 Valid, 1927 Invalid, 7357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1899 Valid, 5458 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 13:35:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2022-12-14 13:35:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1083. [2022-12-14 13:35:50,483 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) [2022-12-14 13:35:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1220 transitions. [2022-12-14 13:35:50,487 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1220 transitions. Word has length 113 [2022-12-14 13:35:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:50,487 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1220 transitions. [2022-12-14 13:35:50,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 34 states have (on average 5.705882352941177) internal successors, (194), 38 states have internal predecessors, (194), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-12-14 13:35:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1220 transitions. [2022-12-14 13:35:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 13:35:50,489 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:50,489 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:50,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 13:35:50,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 13:35:50,690 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash 733588582, now seen corresponding path program 1 times [2022-12-14 13:35:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:50,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317456260] [2022-12-14 13:35:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 13:35:50,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:50,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317456260] [2022-12-14 13:35:50,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317456260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:50,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474768403] [2022-12-14 13:35:50,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:50,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:50,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:50,884 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:50,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 13:35:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:50,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 13:35:50,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 13:35:51,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:35:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-14 13:35:51,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474768403] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:51,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:35:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2022-12-14 13:35:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707346658] [2022-12-14 13:35:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:35:51,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:35:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:35:51,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:35:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-12-14 13:35:51,169 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) [2022-12-14 13:35:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:35:51,576 INFO L93 Difference]: Finished difference Result 2407 states and 2768 transitions. [2022-12-14 13:35:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:35:51,577 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 [2022-12-14 13:35:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:35:51,585 INFO L225 Difference]: With dead ends: 2407 [2022-12-14 13:35:51,585 INFO L226 Difference]: Without dead ends: 1416 [2022-12-14 13:35:51,587 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:35:51,588 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 109 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:35:51,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 367 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:35:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-12-14 13:35:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1163. [2022-12-14 13:35:51,847 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) [2022-12-14 13:35:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1330 transitions. [2022-12-14 13:35:51,851 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1330 transitions. Word has length 114 [2022-12-14 13:35:51,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:35:51,851 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1330 transitions. [2022-12-14 13:35:51,851 INFO L496 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) [2022-12-14 13:35:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1330 transitions. [2022-12-14 13:35:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-14 13:35:51,853 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:35:51,854 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:35:51,858 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 13:35:52,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 13:35:52,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:35:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:35:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1900163007, now seen corresponding path program 1 times [2022-12-14 13:35:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:35:52,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329203866] [2022-12-14 13:35:52,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:52,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:35:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 13:35:52,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:35:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329203866] [2022-12-14 13:35:52,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329203866] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:35:52,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896575438] [2022-12-14 13:35:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:35:52,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:35:52,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:35:52,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:35:52,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 13:35:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:35:52,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 13:35:52,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:35:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:35:53,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:35:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-12-14 13:35:54,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896575438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:35:54,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1399854277] [2022-12-14 13:35:54,455 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-12-14 13:35:54,455 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:35:54,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:35:54,455 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:35:54,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:35:58,802 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 56 for LOIs [2022-12-14 13:35:58,810 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 52 for LOIs [2022-12-14 13:35:58,820 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 56 for LOIs [2022-12-14 13:35:58,829 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 27 for LOIs [2022-12-14 13:35:58,834 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 27 for LOIs [2022-12-14 13:35:58,838 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 52 for LOIs [2022-12-14 13:35:58,950 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 52 for LOIs [2022-12-14 13:35:58,977 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 27 for LOIs [2022-12-14 13:35:58,998 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:36:05,767 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '49473#(and (= ~q_req_up~0 1) (<= ~p_dw_pc~0 1) (<= 0 ~p_dw_st~0) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~c_dr_pc~0 1) (= ~c_num_read~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= |#NULL.base| 0))' at error location [2022-12-14 13:36:05,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 13:36:05,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:36:05,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 50 [2022-12-14 13:36:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516889284] [2022-12-14 13:36:05,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:36:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 13:36:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:36:05,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 13:36:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=9099, Unknown=0, NotChecked=0, Total=9900 [2022-12-14 13:36:05,772 INFO L87 Difference]: Start difference. First operand 1163 states and 1330 transitions. Second operand has 50 states, 33 states have (on average 6.393939393939394) internal successors, (211), 38 states have internal predecessors, (211), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-12-14 13:36:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:36:13,512 INFO L93 Difference]: Finished difference Result 4279 states and 4991 transitions. [2022-12-14 13:36:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-14 13:36:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 33 states have (on average 6.393939393939394) internal successors, (211), 38 states have internal predecessors, (211), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) Word has length 123 [2022-12-14 13:36:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:36:13,520 INFO L225 Difference]: With dead ends: 4279 [2022-12-14 13:36:13,520 INFO L226 Difference]: Without dead ends: 3208 [2022-12-14 13:36:13,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 305 SyntacticMatches, 19 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21025 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=5535, Invalid=42207, Unknown=0, NotChecked=0, Total=47742 [2022-12-14 13:36:13,524 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2935 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 2518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2935 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 7399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2518 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 13:36:13,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2935 Valid, 1220 Invalid, 7399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2518 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 13:36:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2022-12-14 13:36:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 1644. [2022-12-14 13:36:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1140 states have (on average 1.1464912280701753) internal successors, (1307), 1156 states have internal predecessors, (1307), 256 states have call successors, (256), 211 states have call predecessors, (256), 247 states have return successors, (316), 277 states have call predecessors, (316), 255 states have call successors, (316) [2022-12-14 13:36:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 1879 transitions. [2022-12-14 13:36:13,809 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 1879 transitions. Word has length 123 [2022-12-14 13:36:13,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:36:13,809 INFO L495 AbstractCegarLoop]: Abstraction has 1644 states and 1879 transitions. [2022-12-14 13:36:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 33 states have (on average 6.393939393939394) internal successors, (211), 38 states have internal predecessors, (211), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-12-14 13:36:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 1879 transitions. [2022-12-14 13:36:13,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-12-14 13:36:13,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:36:13,811 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:36:13,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 13:36:14,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 13:36:14,013 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:36:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:36:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1647295810, now seen corresponding path program 1 times [2022-12-14 13:36:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:36:14,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51322] [2022-12-14 13:36:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:36:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:36:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:36:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-14 13:36:14,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:36:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51322] [2022-12-14 13:36:14,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51322] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:36:14,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549396325] [2022-12-14 13:36:14,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:36:14,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:36:14,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:36:14,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:36:14,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 13:36:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:36:14,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 13:36:14,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:36:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-12-14 13:36:14,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:36:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-14 13:36:14,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549396325] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:36:14,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:36:14,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2022-12-14 13:36:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85703129] [2022-12-14 13:36:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:36:14,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 13:36:14,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:36:14,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 13:36:14,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:36:14,470 INFO L87 Difference]: Start difference. First operand 1644 states and 1879 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) [2022-12-14 13:36:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:36:14,959 INFO L93 Difference]: Finished difference Result 2619 states and 2986 transitions. [2022-12-14 13:36:14,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 13:36:14,960 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 [2022-12-14 13:36:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:36:14,966 INFO L225 Difference]: With dead ends: 2619 [2022-12-14 13:36:14,966 INFO L226 Difference]: Without dead ends: 1067 [2022-12-14 13:36:14,969 INFO L412 NwaCegarLoop]: 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 [2022-12-14 13:36:14,970 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 172 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:36:14,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 327 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:36:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-12-14 13:36:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 718. [2022-12-14 13:36:15,131 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) [2022-12-14 13:36:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 798 transitions. [2022-12-14 13:36:15,132 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 798 transitions. Word has length 124 [2022-12-14 13:36:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:36:15,132 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 798 transitions. [2022-12-14 13:36:15,133 INFO L496 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) [2022-12-14 13:36:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 798 transitions. [2022-12-14 13:36:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-12-14 13:36:15,135 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:36:15,135 INFO L195 NwaCegarLoop]: 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] [2022-12-14 13:36:15,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 13:36:15,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 13:36:15,335 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 13:36:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:36:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1207891679, now seen corresponding path program 1 times [2022-12-14 13:36:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:36:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852558164] [2022-12-14 13:36:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:36:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:36:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:36:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-12-14 13:36:15,777 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:36:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852558164] [2022-12-14 13:36:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852558164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:36:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556564959] [2022-12-14 13:36:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:36:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:36:15,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:36:15,779 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:36:15,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 13:36:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:36:15,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 13:36:15,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:36:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 13:36:15,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:36:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556564959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:36:15,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:36:15,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2022-12-14 13:36:15,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682435972] [2022-12-14 13:36:15,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:36:15,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 13:36:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:36:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 13:36:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-12-14 13:36:15,980 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) [2022-12-14 13:36:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:36:16,159 INFO L93 Difference]: Finished difference Result 965 states and 1070 transitions. [2022-12-14 13:36:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:36:16,159 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 [2022-12-14 13:36:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:36:16,160 INFO L225 Difference]: With dead ends: 965 [2022-12-14 13:36:16,160 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 13:36:16,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-12-14 13:36:16,161 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 43 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:36:16,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 677 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:36:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 13:36:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 13:36:16,162 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) [2022-12-14 13:36:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 13:36:16,162 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2022-12-14 13:36:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:36:16,162 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 13:36:16,163 INFO L496 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) [2022-12-14 13:36:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 13:36:16,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 13:36:16,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 13:36:16,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 13:36:16,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:36:16,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 13:36:54,571 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2022-12-14 13:36:54,571 INFO L895 garLoopResultBuilder]: At program point L313(line 313) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_dw_i~0 1)) (.cse12 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse5 (= |old(~p_dw_st~0)| 0)) (.cse1 (not .cse11)) (.cse7 (= ~q_free~0 0)) (.cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not .cse12)) (.cse9 (= ~q_read_ev~0 0)) (.cse4 (not .cse13)) (.cse10 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse11 .cse3 .cse12 (= ~p_dw_pc~0 1) .cse13)) (.cse6 (not (= 1 ~c_dr_i~0)))) (and (or (not .cse0) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse2 (and .cse3 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse4 (not (= ~q_free~0 1)) (not .cse5) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse6) (or (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse7) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 (= ~q_write_ev~0 0) .cse8 .cse9 .cse4 .cse10 .cse0 (= ~q_write_ev~0 1) .cse6) (or .cse5 (= ~q_read_ev~0 1) .cse1 (not .cse7) .cse2 .cse8 .cse9 .cse4 .cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse6)))) [2022-12-14 13:36:54,572 INFO L895 garLoopResultBuilder]: At program point L315-2(lines 315 319) the Hoare annotation is: (let ((.cse30 (= ~q_free~0 0))) (let ((.cse4 (= 1 ~c_dr_i~0)) (.cse10 (= ~p_dw_i~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse5 (<= ~p_num_write~0 ~c_num_read~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= ~q_write_ev~0 1)) (.cse29 (= ~q_req_up~0 1)) (.cse27 (not .cse30)) (.cse19 (= ~q_write_ev~0 0)) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse8 (= ~p_dw_st~0 0)) (.cse26 (= |old(~p_dw_st~0)| 0))) (let ((.cse2 (= ~q_read_ev~0 1)) (.cse13 (or (not .cse8) .cse26)) (.cse14 (not .cse12)) (.cse1 (not .cse19)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= ~p_dw_pc~0 1)) (.cse9 (or (not .cse29) .cse27)) (.cse11 (not .cse24)) (.cse15 (and .cse29 .cse30)) (.cse16 (not .cse0)) (.cse17 (not .cse5)) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not .cse6)) (.cse21 (= ~q_read_ev~0 0)) (.cse22 (not .cse10)) (.cse23 (= |old(~c_dr_st~0)| 0)) (.cse28 (not .cse26)) (.cse25 (not .cse4))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and (not .cse2) .cse3 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse2 .cse16 .cse27 .cse18 (and .cse3 .cse13) .cse20 .cse21 .cse22 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse25) (or (not .cse23) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse16 (not (= ~c_num_read~0 0)) .cse18 (and .cse3 .cse8) (not (= ~q_write_ev~0 2)) .cse22 (not (= ~q_free~0 1)) .cse28 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse25) (or .cse14 (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse28 .cse24 .cse25))))) [2022-12-14 13:36:54,572 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2022-12-14 13:36:54,572 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2022-12-14 13:36:54,572 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 331) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse13 (= ~p_dw_i~0 1)) (.cse12 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse5 (= |old(~p_dw_st~0)| 0)) (.cse1 (not .cse11)) (.cse7 (= ~q_free~0 0)) (.cse2 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not .cse12)) (.cse9 (= ~q_read_ev~0 0)) (.cse4 (not .cse13)) (.cse10 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse11 .cse3 .cse12 (= ~p_dw_pc~0 1) .cse13)) (.cse6 (not (= 1 ~c_dr_i~0)))) (and (or (not .cse0) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse2 (and .cse3 (= ~p_dw_st~0 0)) (not (= ~q_write_ev~0 2)) .cse4 (not (= ~q_free~0 1)) (not .cse5) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse6) (or (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse7) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 (= ~q_write_ev~0 0) .cse8 .cse9 .cse4 .cse10 .cse0 (= ~q_write_ev~0 1) .cse6) (or .cse5 (= ~q_read_ev~0 1) .cse1 (not .cse7) .cse2 .cse8 .cse9 .cse4 .cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse6)))) [2022-12-14 13:36:54,572 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2022-12-14 13:36:54,572 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 251 270) the Hoare annotation is: true [2022-12-14 13:36:54,573 INFO L895 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse14 (= ~q_free~0 0))) (let ((.cse1 (not (= ~p_dw_st~0 0))) (.cse4 (and (= ~q_req_up~0 1) .cse14)) (.cse6 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse8 (= ~q_write_ev~0 0)) (.cse2 (= ~q_read_ev~0 1)) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~c_dr_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= ~q_read_ev~0 0)) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (= ~q_write_ev~0 1)) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not .cse0) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse7 (not (= ~q_write_ev~0 2)) .cse10 (not (= ~q_free~0 1)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse12) (or .cse0 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse12) (or .cse2 .cse5 (not .cse14) .cse7 .cse9 (and (not .cse11) (or .cse0 .cse3)) .cse13 .cse10 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse11) .cse12)))) [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 80 98) the Hoare annotation is: true [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 271 288) the Hoare annotation is: (let ((.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (= ~c_dr_st~0 0)) (.cse7 (= |old(~q_read_ev~0)| 1)) (.cse9 (= |old(~q_write_ev~0)| 1)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (and .cse5 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (= ~q_free~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse6 (not (= 1 ~c_dr_i~0)))) (and (or (not .cse0) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse1) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse3 (not (= |old(~q_read_ev~0)| 2)) .cse4 (not (= ~q_free~0 1)) (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 .cse1 .cse7 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse8) .cse9 .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse10 .cse3 .cse11 .cse4 (= |old(~q_write_ev~0)| 0) .cse6) (or .cse1 .cse7 .cse9 .cse2 .cse10 (not .cse8) .cse0 .cse3 .cse11 .cse4 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse6)))) [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2022-12-14 13:36:54,573 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 218 232) the Hoare annotation is: (let ((.cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.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)) (.cse8 (not (= ~c_dr_pc~0 1))) (.cse5 (= ~q_free~0 0)) (.cse10 (= |old(~q_read_ev~0)| 0)) (.cse6 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~p_dw_i~0 1))) (.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 .cse0 .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse3 .cse4 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse7 .cse8 .cse9 (and (= |old(~q_req_up~0)| 1) .cse5) (= |old(~q_write_ev~0)| 0) .cse10 .cse11) (or (not .cse6) (and .cse12 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) (not (= ~p_num_write~0 0)) .cse4 (not (= ~c_num_read~0 0)) .cse7 (not (= |old(~q_read_ev~0)| 2)) (not (= ~p_dw_pc~0 |old(~q_req_up~0)|)) .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)))) [2022-12-14 13:36:54,573 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2022-12-14 13:36:54,574 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 289 306) the Hoare annotation is: (let ((.cse5 (= ~q_free~0 1)) (.cse16 (= |old(~q_read_ev~0)| 0)) (.cse6 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse18 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse8 (= ~c_dr_st~0 0)) (.cse23 (= ~q_req_up~0 1)) (.cse24 (= ~q_free~0 0)) (.cse20 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse20)) (.cse9 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse10 (and .cse23 .cse24)) (.cse12 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (= |old(~q_write_ev~0)| 0)) (.cse1 (not .cse8)) (.cse17 (= |old(~q_read_ev~0)| 1)) (.cse11 (= |old(~q_write_ev~0)| 1)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (and .cse6 .cse18)) (.cse19 (not .cse24)) (.cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse21 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse7 (not (= 1 ~c_dr_i~0))) (.cse22 (and (or .cse23 .cse16) (or .cse5 .cse16)))) (and (or .cse0 (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse1 (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse3 (not (= |old(~q_read_ev~0)| 2)) .cse4 (not .cse5) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse6 (= ~q_read_ev~0 2)) .cse7) (or .cse8 .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7) (or .cse8 .cse17 .cse9 .cse10 .cse11 .cse2 .cse12 .cse13 .cse3 .cse14 .cse4 .cse15 .cse16 .cse7) (or .cse17 .cse1 .cse2 (and .cse18 (= ~q_write_ev~0 1)) .cse19 (not .cse11) .cse20 .cse3 .cse14 .cse4 .cse21 .cse7 .cse22) (or .cse8 .cse17 .cse11 .cse2 .cse13 .cse19 .cse20 .cse3 .cse14 .cse4 .cse21 .cse7 .cse22)))) [2022-12-14 13:36:54,574 INFO L895 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)) [2022-12-14 13:36:54,574 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-12-14 13:36:54,574 INFO L895 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)))) [2022-12-14 13:36:54,574 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 124 163) the Hoare annotation is: (let ((.cse11 (= ~c_dr_st~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~p_dw_pc~0 1)) (.cse7 (= 2 ~p_dw_st~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)) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse10 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~c_dr_st~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 (not (= ~q_write_ev~0 0)) .cse2 (not .cse11) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) (and .cse11 .cse0 (= ~c_num_read~0 0) .cse1 .cse3 .cse4 .cse6 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse7 .cse8 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)))) [2022-12-14 13:36:54,574 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 405 447) the Hoare annotation is: (or (= ~p_dw_pc~0 0) (= ~p_dw_pc~0 1)) [2022-12-14 13:36:54,574 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2022-12-14 13:36:54,574 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-12-14 13:36:54,574 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L895 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)))) [2022-12-14 13:36:54,575 INFO L895 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)))) [2022-12-14 13:36:54,575 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 165 217) the Hoare annotation is: (let ((.cse13 (= ~p_dw_st~0 0)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse4 (= ~q_free~0 1)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse12 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ~p_dw_st~0) .cse10 .cse11 .cse12) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 (= ~q_write_ev~0 2) (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) .cse13 (= ~q_read_ev~0 2) .cse10 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0) .cse12) (and (= ~q_req_up~0 1) (not .cse13) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-12-14 13:36:54,575 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2022-12-14 13:36:54,575 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2022-12-14 13:36:54,575 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L895 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)))))) [2022-12-14 13:36:54,575 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2022-12-14 13:36:54,575 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 419 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)))) [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-12-14 13:36:54,576 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(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)))))) [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-12-14 13:36:54,576 INFO L895 garLoopResultBuilder]: At program point L172(lines 172 176) the Hoare annotation is: (and (let ((.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse10 (not (= ~q_free~0 1))) (.cse0 (= ~q_req_up~0 1)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse9 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (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)|)) .cse4 .cse5 .cse6 .cse7 .cse8 (= 2 ~p_dw_st~0) .cse9 (not (= ~q_write_ev~0 1)) .cse10) (and (not (= ~p_dw_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (or (and .cse6 .cse10) (and (not .cse0) .cse6)) (= ~q_write_ev~0 2) .cse9))) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) [2022-12-14 13:36:54,576 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 139 157) the Hoare annotation is: (let ((.cse25 (= ~p_dw_pc~0 0)) (.cse24 (= ~p_dw_pc~0 1))) (let ((.cse0 (= ~p_num_write~0 0)) (.cse5 (= ~q_free~0 1)) (.cse7 (= ~q_req_up~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (or .cse25 .cse24)) (.cse15 (= ~c_dr_st~0 0)) (.cse18 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse21 (= ~q_free~0 0)) (.cse10 (= ~q_write_ev~0 2)) (.cse16 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse17 (= ~c_dr_pc~0 0)) (.cse12 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse16 .cse11 .cse17 .cse12 .cse13 .cse14) (and .cse18 .cse1 (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse19 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (or .cse24 (and .cse25 .cse10 .cse11))) (.cse22 (not (= ~q_write_ev~0 1))) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse3 .cse4 .cse19 .cse20 .cse6 .cse21 .cse8 .cse9 .cse12 .cse22 .cse23) (and .cse4 (not (= ~q_write_ev~0 0)) .cse19 .cse20 (not .cse15) .cse6 .cse21 .cse8 .cse9 .cse12 .cse22 .cse23)))) (and .cse25 .cse15 .cse18 .cse1 .cse2 .cse4 .cse6 .cse21 .cse10 .cse16 .cse11 .cse17 .cse12 (= ~p_num_write~0 1))))) [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-12-14 13:36:54,576 INFO L895 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)) [2022-12-14 13:36:54,576 INFO L895 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)) [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-12-14 13:36:54,576 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-12-14 13:36:54,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 13:36:54,577 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-12-14 13:36:54,577 INFO L895 garLoopResultBuilder]: At program point L141(lines 141 149) the Hoare annotation is: (let ((.cse11 (= ~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)) (.cse14 (= ~q_write_ev~0 2)) (.cse7 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse13 (= ~p_dw_pc~0 1)) (.cse12 (= ~p_dw_pc~0 0))) (let ((.cse2 (or .cse13 (and .cse12 .cse14 .cse15))) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (or .cse12 .cse13)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (= ~c_dr_st~0 2) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 (not (= ~q_write_ev~0 0)) .cse2 (not .cse11) .cse3 .cse4 .cse5 .cse6 (or (and (= ~q_req_up~0 1) (not (= ~q_free~0 0))) .cse7) .cse8 .cse9 .cse10))))) (and .cse11 (= ~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) .cse14 .cse7 .cse15 .cse8 (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)))) [2022-12-14 13:36:54,577 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse30 (= ~q_req_up~0 1)) (.cse25 (= ~q_free~0 0))) (let ((.cse20 (not .cse25)) (.cse28 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse19 (not .cse30)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse6 (= ~p_dw_st~0 0))) (let ((.cse23 (not .cse6)) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not .cse0)) (.cse27 (= ~c_dr_st~0 2)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse29 (or (and .cse30 .cse20) .cse28)) (.cse18 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~p_dw_i~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 .cse23 .cse12 .cse2 .cse24 .cse4 .cse25 .cse17 .cse18 .cse26 .cse5 .cse9) (and .cse23 .cse12 .cse2 .cse24 .cse14 .cse4 .cse25 .cse17 .cse18 .cse26 .cse9 .cse21) (and (= ~p_dw_pc~0 0) .cse1 .cse27 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse28 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse12 (or (and .cse2 .cse13 .cse14 .cse4 .cse16 .cse17 .cse29 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse27 .cse2 .cse4 .cse16 .cse17 .cse18 .cse28 .cse6 .cse9 .cse21 .cse22)) .cse15) (and .cse0 .cse30 .cse1 .cse2 .cse4 .cse25 .cse29 .cse18 .cse5 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)))))) [2022-12-14 13:36:54,577 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-12-14 13:36:54,577 INFO L895 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)) [2022-12-14 13:36:54,577 INFO L895 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)) [2022-12-14 13:36:54,577 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse30 (= ~q_req_up~0 1)) (.cse25 (= ~q_free~0 0))) (let ((.cse20 (not .cse25)) (.cse28 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse19 (not .cse30)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse6 (= ~p_dw_st~0 0))) (let ((.cse23 (not .cse6)) (.cse24 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse26 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (not (= ~q_read_ev~0 1))) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not .cse0)) (.cse27 (= ~c_dr_st~0 2)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse29 (or (and .cse30 .cse20) .cse28)) (.cse18 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~p_dw_i~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 .cse23 .cse12 .cse2 .cse24 .cse4 .cse25 .cse17 .cse18 .cse26 .cse5 .cse9) (and .cse23 .cse12 .cse2 .cse24 .cse14 .cse4 .cse25 .cse17 .cse18 .cse26 .cse9 .cse21) (and (= ~p_dw_pc~0 0) .cse1 .cse27 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse28 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse12 (or (and .cse2 .cse13 .cse14 .cse4 .cse16 .cse17 .cse29 .cse18 .cse6 .cse9 .cse21 .cse22) (and .cse27 .cse2 .cse4 .cse16 .cse17 .cse18 .cse28 .cse6 .cse9 .cse21 .cse22)) .cse15) (and .cse0 .cse30 .cse1 .cse2 .cse4 .cse25 .cse29 .cse18 .cse5 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)))))) [2022-12-14 13:36:54,577 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2022-12-14 13:36:54,578 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 180 211) the Hoare annotation is: (let ((.cse14 (= ~c_num_read~0 0)) (.cse16 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse18 (= ~q_read_ev~0 2)) (.cse9 (= 2 ~p_dw_st~0)) (.cse19 (= ~q_req_up~0 1)) (.cse17 (= ~p_dw_st~0 0)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse3 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse13 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse1 .cse3 .cse4 .cse5 .cse7 (let ((.cse15 (= ~p_dw_pc~0 0))) (or (and .cse15 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse15 (= ~c_dr_pc~0 1)))) (= ~q_write_ev~0 2) .cse16 .cse17 .cse18 .cse10 .cse11 (= ~q_req_up~0 ~p_dw_pc~0) .cse13) (and .cse19 .cse14 .cse1 .cse4 .cse5 (= ~q_free~0 0) (<= ~p_num_write~0 1) .cse8 .cse16 .cse18 (= ~c_dr_pc~0 0) .cse9 .cse10 (<= 1 ~p_num_write~0) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse19 (not .cse17) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 13:36:54,578 INFO L895 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)) (.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)) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 0)) (.cse4 (= ~p_dw_i~0 1)) (.cse10 (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) .cse5 .cse1 (= (+ ~c_num_read~0 1) ~p_num_write~0) .cse6 .cse2 .cse7 (not (= ~q_read_ev~0 0)) .cse8 .cse9 .cse4 .cse10) (and .cse5 .cse1 (not (= ~q_write_ev~0 0)) .cse6 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse4 .cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))))) [2022-12-14 13:36:54,578 INFO L895 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 ~p_num_write~0) .cse5 .cse2 .cse9 .cse6 .cse7 .cse8 .cse4 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))))) [2022-12-14 13:36:54,578 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-12-14 13:36:54,578 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-12-14 13:36:54,578 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2022-12-14 13:36:54,578 INFO L895 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse1 (= ~q_read_ev~0 1)) (.cse3 (= ~q_free~0 0)) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse8 (= ~q_read_ev~0 0)) (.cse5 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~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) (and (= ~q_req_up~0 1) .cse3) .cse4 (not (= ~c_num_read~0 ~p_num_write~0)) (and .cse1 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse5 .cse6 (= ~q_write_ev~0 0) .cse7 .cse8 .cse9 (= ~q_write_ev~0 1) .cse10) (or .cse1 .cse4 (not .cse3) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse2 .cse10) (or (not .cse5) (not (= ~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)) .cse6 (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))) [2022-12-14 13:36:54,578 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 61 79) the Hoare annotation is: true [2022-12-14 13:36:54,578 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-12-14 13:36:54,578 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-12-14 13:36:54,578 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2022-12-14 13:36:54,579 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-12-14 13:36:54,581 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:36:54,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:36:54,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:36:54 BoogieIcfgContainer [2022-12-14 13:36:54,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:36:54,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:36:54,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:36:54,608 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:36:54,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:35:02" (3/4) ... [2022-12-14 13:36:54,611 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-14 13:36:54,615 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-14 13:36:54,619 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2022-12-14 13:36:54,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-12-14 13:36:54,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 13:36:54,620 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 13:36:54,637 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_st == 0) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || \old(q_read_ev) == 0) || !(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)) || !(c_dr_pc == p_dw_pc)) || !(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))) && ((((((((((((((!(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_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(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)) [2022-12-14 13:36:54,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || (((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(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)) && ((q_req_up == 1 && !(q_free == 0)) || !(tmp___1 == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1))) || (((((((((((((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) && !(tmp___1 == 0)) && 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) [2022-12-14 13:36:54,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((q_req_up == 1 && !(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) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && !(q_free == 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 [2022-12-14 13:36:54,654 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:36:54,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:36:54,655 INFO L158 Benchmark]: Toolchain (without parser) took 112943.64ms. Allocated memory was 130.0MB in the beginning and 708.8MB in the end (delta: 578.8MB). Free memory was 88.9MB in the beginning and 360.9MB in the end (delta: -272.0MB). Peak memory consumption was 309.3MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,655 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 94.8MB in the beginning and 94.8MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:36:54,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.90ms. Allocated memory is still 130.0MB. Free memory was 88.5MB in the beginning and 75.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.08ms. Allocated memory is still 130.0MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,655 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 72.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,656 INFO L158 Benchmark]: RCFGBuilder took 486.94ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 72.2MB in the beginning and 121.7MB in the end (delta: -49.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,656 INFO L158 Benchmark]: TraceAbstraction took 112132.85ms. Allocated memory was 161.5MB in the beginning and 708.8MB in the end (delta: 547.4MB). Free memory was 121.7MB in the beginning and 366.2MB in the end (delta: -244.5MB). Peak memory consumption was 467.6MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,656 INFO L158 Benchmark]: Witness Printer took 46.16ms. Allocated memory is still 708.8MB. Free memory was 366.2MB in the beginning and 360.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 13:36:54,657 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.12ms. Allocated memory is still 130.0MB. Free memory was 94.8MB in the beginning and 94.8MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.90ms. Allocated memory is still 130.0MB. Free memory was 88.5MB in the beginning and 75.8MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.08ms. Allocated memory is still 130.0MB. Free memory was 75.8MB in the beginning and 73.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 130.0MB. Free memory was 73.8MB in the beginning and 72.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.94ms. Allocated memory was 130.0MB in the beginning and 161.5MB in the end (delta: 31.5MB). Free memory was 72.2MB in the beginning and 121.7MB in the end (delta: -49.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 112132.85ms. Allocated memory was 161.5MB in the beginning and 708.8MB in the end (delta: 547.4MB). Free memory was 121.7MB in the beginning and 366.2MB in the end (delta: -244.5MB). Peak memory consumption was 467.6MB. Max. memory is 16.1GB. * Witness Printer took 46.16ms. Allocated memory is still 708.8MB. Free memory was 366.2MB in the beginning and 360.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 112.1s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8095 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8071 mSDsluCounter, 8858 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6747 mSDsCounter, 4901 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13270 IncrementalHoareTripleChecker+Invalid, 18171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4901 mSolverCounterUnsat, 2111 mSDtfsCounter, 13270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2541 GetRequests, 1744 SyntacticMatches, 35 SemanticMatches, 762 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69300 ImplicationChecksByTransitivity, 36.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1644occurred in iteration=17, InterpolantAutomatonStates: 479, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 4851 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 2396 PreInvPairs, 2513 NumberOfFragments, 5391 HoareAnnotationTreeSize, 2396 FomulaSimplifications, 50628 FormulaSimplificationTreeSizeReduction, 20.5s HoareSimplificationTime, 37 FomulaSimplificationsInter, 1690655 FormulaSimplificationTreeSizeReductionInter, 17.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2682 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3177 ConstructedInterpolants, 0 QuantifiedInterpolants, 10132 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3939 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 1722/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: 180]: Loop Invariant Derived loop invariant: (((((((((((((((!(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) && !(tmp___1 == 0)) && 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 && 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) && !(tmp___1 == 0)) && 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_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: 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: ((((((((((((((!(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) || (((((((((((((((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) && !(tmp___1 == 0)) && 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)) && 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: 405]: Loop Invariant Derived loop invariant: p_dw_pc == 0 || p_dw_pc == 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_req_up == 1 && !(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) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && !(q_free == 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: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((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) && q_req_up == 0) && q_write_ev == 2) && !(tmp___1 == 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_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 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_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(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)))) || (((((((((((((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) && !(tmp___1 == 0)) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 || !(p_dw_st == 0)) || !(q_read_ev == 1)) || __retres1 == 0) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(c_dr_pc == p_dw_pc)) || q_write_ev == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || q_write_ev == 1) || !(1 == c_dr_i)) && ((((((((((((((!(p_dw_st == 0) || !(q_req_up == p_dw_pc)) || __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) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(c_dr_pc == p_dw_pc)) || 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_read_ev == 1 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || !(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)) - InvariantResult [Line: 419]: 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: 64]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 || (!(q_read_ev == 1) && __retres1 == 0)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || (q_read_ev == 1 && 1 <= __retres1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || 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_read_ev == 1 || !(p_last_write == q_buf_0)) || !(q_free == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(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))) && ((((((((((((((!(p_dw_st == 0) || !(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)) || !(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)) - 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_st == 0) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 == p_num_write)) || \old(q_read_ev) == 0) || !(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)) || !(c_dr_pc == p_dw_pc)) || !(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))) && ((((((((((((((!(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_last_write == q_buf_0)) || !(c_num_read == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(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)) - 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)) || ((((((((((!(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))) || (((((((((((((((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) && !(tmp___1 == 0)) && 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) && ((((((((((((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) && ((q_req_up == 1 && !(q_free == 0)) || !(tmp___1 == 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) && !(tmp___1 == 0)) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1))) && !(q_read_ev == 0))) || (((((((((((((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) && ((q_req_up == 1 && !(q_free == 0)) || !(tmp___1 == 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) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || (((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(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)) && ((q_req_up == 1 && !(q_free == 0)) || !(tmp___1 == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1))) || (((((((((((((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) && !(tmp___1 == 0)) && 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: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((q_req_up == 1 && !(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) && !(tmp___1 == 0)) && 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: 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! [2022-12-14 13:36:54,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d598651e-b271-4f3d-a595-6554bb14f5d6/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE