./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 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/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_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-8393723 [2022-11-19 07:53:57,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:53:57,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:53:58,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:53:58,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:53:58,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:53:58,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:53:58,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:53:58,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:53:58,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:53:58,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:53:58,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:53:58,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:53:58,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:53:58,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:53:58,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:53:58,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:53:58,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:53:58,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:53:58,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:53:58,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:53:58,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:53:58,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:53:58,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:53:58,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:53:58,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:53:58,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:53:58,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:53:58,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:53:58,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:53:58,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:53:58,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:53:58,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:53:58,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:53:58,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:53:58,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:53:58,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:53:58,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:53:58,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:53:58,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:53:58,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:53:58,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:53:58,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:53:58,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:53:58,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:53:58,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:53:58,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:53:58,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:53:58,095 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:53:58,095 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:53:58,096 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:53:58,096 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:53:58,096 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:53:58,097 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:53:58,097 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:53:58,097 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:53:58,097 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:53:58,098 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:53:58,098 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:53:58,098 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:53:58,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:53:58,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:53:58,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:53:58,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:53:58,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:53:58,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:53:58,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:53:58,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:53:58,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:53:58,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:53:58,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:53:58,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:53:58,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:53:58,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:53:58,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:53:58,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:53:58,104 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:53:58,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:53:58,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:53:58,105 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:53:58,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:53:58,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:53:58,106 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:53:58,106 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_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2022-11-19 07:53:58,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:53:58,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:53:58,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:53:58,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:53:58,463 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:53:58,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-11-19 07:53:58,539 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/data/ca8249d5b/7a6dd1e9366f44648a7f3605c99c44b1/FLAG862facf08 [2022-11-19 07:53:59,098 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:53:59,102 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2022-11-19 07:53:59,116 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/data/ca8249d5b/7a6dd1e9366f44648a7f3605c99c44b1/FLAG862facf08 [2022-11-19 07:53:59,407 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/data/ca8249d5b/7a6dd1e9366f44648a7f3605c99c44b1 [2022-11-19 07:53:59,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:53:59,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:53:59,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:53:59,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:53:59,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:53:59,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ccc8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59, skipping insertion in model container [2022-11-19 07:53:59,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:53:59,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:53:59,700 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-11-19 07:53:59,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:53:59,762 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:53:59,775 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2022-11-19 07:53:59,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:53:59,816 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:53:59,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59 WrapperNode [2022-11-19 07:53:59,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:53:59,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:53:59,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:53:59,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:53:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,868 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 187 [2022-11-19 07:53:59,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:53:59,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:53:59,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:53:59,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:53:59,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,910 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:53:59,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:53:59,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:53:59,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:53:59,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (1/1) ... [2022-11-19 07:53:59,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:53:59,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:53:59,956 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:53:59,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:54:00,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:54:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-19 07:54:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-19 07:54:00,022 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-19 07:54:00,022 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-19 07:54:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-19 07:54:00,023 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-19 07:54:00,023 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-19 07:54:00,024 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-19 07:54:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-19 07:54:00,024 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-19 07:54:00,024 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-19 07:54:00,024 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-19 07:54:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:54:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-19 07:54:00,025 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-19 07:54:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:54:00,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:54:00,025 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-19 07:54:00,026 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-19 07:54:00,151 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:54:00,153 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:54:00,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:54:00,735 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:54:00,735 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-19 07:54:00,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:00 BoogieIcfgContainer [2022-11-19 07:54:00,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:54:00,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:54:00,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:54:00,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:54:00,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:53:59" (1/3) ... [2022-11-19 07:54:00,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddddb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:00, skipping insertion in model container [2022-11-19 07:54:00,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:53:59" (2/3) ... [2022-11-19 07:54:00,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddddb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:00, skipping insertion in model container [2022-11-19 07:54:00,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:00" (3/3) ... [2022-11-19 07:54:00,755 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2022-11-19 07:54:00,779 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:54:00,779 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 07:54:00,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:54:00,862 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;@37f49fa0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:54:00,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 07:54:00,872 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-11-19 07:54:00,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 07:54:00,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:00,886 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-11-19 07:54:00,887 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:00,898 INFO L85 PathProgramCache]: Analyzing trace with hash -675144144, now seen corresponding path program 1 times [2022-11-19 07:54:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975270572] [2022-11-19 07:54:00,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:00,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:01,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975270572] [2022-11-19 07:54:01,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975270572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:01,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:01,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758930263] [2022-11-19 07:54:01,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:01,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:01,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:01,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:01,301 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-11-19 07:54:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:01,657 INFO L93 Difference]: Finished difference Result 200 states and 279 transitions. [2022-11-19 07:54:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:01,660 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-11-19 07:54:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:01,670 INFO L225 Difference]: With dead ends: 200 [2022-11-19 07:54:01,671 INFO L226 Difference]: Without dead ends: 129 [2022-11-19 07:54:01,674 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-11-19 07:54:01,678 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 151 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:01,679 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.3s Time] [2022-11-19 07:54:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-19 07:54:01,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2022-11-19 07:54:01,737 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-11-19 07:54:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-11-19 07:54:01,741 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 44 [2022-11-19 07:54:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:01,742 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-11-19 07:54:01,743 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-11-19 07:54:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-11-19 07:54:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 07:54:01,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:01,746 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-11-19 07:54:01,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:54:01,746 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 243830479, now seen corresponding path program 1 times [2022-11-19 07:54:01,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966855627] [2022-11-19 07:54:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:01,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:01,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:01,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966855627] [2022-11-19 07:54:01,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966855627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:01,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:01,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:54:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408823087] [2022-11-19 07:54:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:01,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:54:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:01,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:54:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:54:02,002 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-11-19 07:54:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:02,716 INFO L93 Difference]: Finished difference Result 524 states and 656 transitions. [2022-11-19 07:54:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:54:02,718 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-11-19 07:54:02,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:02,730 INFO L225 Difference]: With dead ends: 524 [2022-11-19 07:54:02,731 INFO L226 Difference]: Without dead ends: 392 [2022-11-19 07:54:02,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:54:02,734 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 440 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:02,734 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.5s Time] [2022-11-19 07:54:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-11-19 07:54:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 308. [2022-11-19 07:54:02,804 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-11-19 07:54:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 371 transitions. [2022-11-19 07:54:02,808 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 371 transitions. Word has length 44 [2022-11-19 07:54:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:02,809 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 371 transitions. [2022-11-19 07:54:02,809 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-11-19 07:54:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 371 transitions. [2022-11-19 07:54:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 07:54:02,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:02,811 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-11-19 07:54:02,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:54:02,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1396115267, now seen corresponding path program 1 times [2022-11-19 07:54:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:02,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156545043] [2022-11-19 07:54:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:03,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:03,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156545043] [2022-11-19 07:54:03,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156545043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:03,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:03,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:54:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767938943] [2022-11-19 07:54:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:54:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:54:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:54:03,157 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-11-19 07:54:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:03,648 INFO L93 Difference]: Finished difference Result 824 states and 987 transitions. [2022-11-19 07:54:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:54:03,649 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-11-19 07:54:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:03,657 INFO L225 Difference]: With dead ends: 824 [2022-11-19 07:54:03,658 INFO L226 Difference]: Without dead ends: 522 [2022-11-19 07:54:03,664 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-11-19 07:54:03,671 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.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:03,672 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.3s Time] [2022-11-19 07:54:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-19 07:54:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 487. [2022-11-19 07:54:03,787 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-11-19 07:54:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 581 transitions. [2022-11-19 07:54:03,799 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 581 transitions. Word has length 45 [2022-11-19 07:54:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:03,800 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 581 transitions. [2022-11-19 07:54:03,800 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-11-19 07:54:03,801 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 581 transitions. [2022-11-19 07:54:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 07:54:03,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:03,811 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-11-19 07:54:03,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:54:03,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 353713709, now seen corresponding path program 1 times [2022-11-19 07:54:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:03,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571686208] [2022-11-19 07:54:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:03,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:03,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:03,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571686208] [2022-11-19 07:54:03,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571686208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:03,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:03,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:03,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675606836] [2022-11-19 07:54:03,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:03,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:03,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:03,912 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-11-19 07:54:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:04,070 INFO L93 Difference]: Finished difference Result 1051 states and 1251 transitions. [2022-11-19 07:54:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:04,071 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-11-19 07:54:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:04,076 INFO L225 Difference]: With dead ends: 1051 [2022-11-19 07:54:04,076 INFO L226 Difference]: Without dead ends: 619 [2022-11-19 07:54:04,078 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-11-19 07:54:04,089 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:04,089 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.1s Time] [2022-11-19 07:54:04,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-11-19 07:54:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 514. [2022-11-19 07:54:04,178 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-11-19 07:54:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 610 transitions. [2022-11-19 07:54:04,183 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 610 transitions. Word has length 46 [2022-11-19 07:54:04,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:04,186 INFO L495 AbstractCegarLoop]: Abstraction has 514 states and 610 transitions. [2022-11-19 07:54:04,187 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-11-19 07:54:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 610 transitions. [2022-11-19 07:54:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-19 07:54:04,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:04,190 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-11-19 07:54:04,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:54:04,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1690232526, now seen corresponding path program 1 times [2022-11-19 07:54:04,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:04,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398624062] [2022-11-19 07:54:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:54:04,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:04,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398624062] [2022-11-19 07:54:04,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398624062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:04,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:04,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119073587] [2022-11-19 07:54:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:04,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:04,278 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-11-19 07:54:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:04,375 INFO L93 Difference]: Finished difference Result 704 states and 831 transitions. [2022-11-19 07:54:04,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:04,376 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-11-19 07:54:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:04,378 INFO L225 Difference]: With dead ends: 704 [2022-11-19 07:54:04,378 INFO L226 Difference]: Without dead ends: 431 [2022-11-19 07:54:04,379 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-11-19 07:54:04,380 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-11-19 07:54:04,380 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-11-19 07:54:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-11-19 07:54:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 322. [2022-11-19 07:54:04,431 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-11-19 07:54:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 372 transitions. [2022-11-19 07:54:04,433 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 372 transitions. Word has length 52 [2022-11-19 07:54:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:04,433 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 372 transitions. [2022-11-19 07:54:04,434 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-11-19 07:54:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 372 transitions. [2022-11-19 07:54:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 07:54:04,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:04,435 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-11-19 07:54:04,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:54:04,435 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:04,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:04,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1861310757, now seen corresponding path program 1 times [2022-11-19 07:54:04,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680290451] [2022-11-19 07:54:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:04,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:04,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:04,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:04,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680290451] [2022-11-19 07:54:04,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680290451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:04,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:04,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:54:04,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462523069] [2022-11-19 07:54:04,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:04,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:54:04,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:04,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:54:04,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:54:04,538 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-11-19 07:54:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:04,740 INFO L93 Difference]: Finished difference Result 425 states and 488 transitions. [2022-11-19 07:54:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:54:04,740 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-11-19 07:54:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:04,743 INFO L225 Difference]: With dead ends: 425 [2022-11-19 07:54:04,743 INFO L226 Difference]: Without dead ends: 422 [2022-11-19 07:54:04,744 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-11-19 07:54:04,745 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-11-19 07:54:04,745 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-11-19 07:54:04,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-11-19 07:54:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 321. [2022-11-19 07:54:04,816 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-11-19 07:54:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 368 transitions. [2022-11-19 07:54:04,818 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 368 transitions. Word has length 53 [2022-11-19 07:54:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:04,819 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 368 transitions. [2022-11-19 07:54:04,819 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-11-19 07:54:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 368 transitions. [2022-11-19 07:54:04,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 07:54:04,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:04,820 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-11-19 07:54:04,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:54:04,821 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:04,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:04,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1866410474, now seen corresponding path program 1 times [2022-11-19 07:54:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:04,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751920859] [2022-11-19 07:54:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:04,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:04,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751920859] [2022-11-19 07:54:04,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751920859] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:54:04,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70749798] [2022-11-19 07:54:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:04,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:04,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:04,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:05,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:54:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:05,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 07:54:05,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:05,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:05,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70749798] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:05,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116700910] [2022-11-19 07:54:05,881 INFO L159 IcfgInterpreter]: Started Sifa with 53 locations of interest [2022-11-19 07:54:05,881 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:54:05,886 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:54:05,893 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:54:05,894 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:54:07,256 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 39 for LOIs [2022-11-19 07:54:07,260 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 71 for LOIs [2022-11-19 07:54:07,273 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 71 for LOIs [2022-11-19 07:54:07,286 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 78 for LOIs [2022-11-19 07:54:07,317 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 67 for LOIs [2022-11-19 07:54:07,328 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 75 for LOIs [2022-11-19 07:54:07,490 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 71 for LOIs [2022-11-19 07:54:07,511 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 71 for LOIs [2022-11-19 07:54:07,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:54:14,243 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-11-19 07:54:14,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:54:14,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:54:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-11-19 07:54:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633846694] [2022-11-19 07:54:14,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:54:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:54:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:54:14,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 07:54:14,247 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-11-19 07:54:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:14,748 INFO L93 Difference]: Finished difference Result 894 states and 1023 transitions. [2022-11-19 07:54:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:54:14,749 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-11-19 07:54:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:14,776 INFO L225 Difference]: With dead ends: 894 [2022-11-19 07:54:14,776 INFO L226 Difference]: Without dead ends: 891 [2022-11-19 07:54:14,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=199, Invalid=1781, Unknown=0, NotChecked=0, Total=1980 [2022-11-19 07:54:14,778 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 314 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:14,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 575 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:54:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2022-11-19 07:54:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 616. [2022-11-19 07:54:14,866 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-11-19 07:54:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 707 transitions. [2022-11-19 07:54:14,871 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 707 transitions. Word has length 54 [2022-11-19 07:54:14,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:14,872 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 707 transitions. [2022-11-19 07:54:14,872 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-11-19 07:54:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 707 transitions. [2022-11-19 07:54:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-19 07:54:14,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:14,874 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-11-19 07:54:14,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:15,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:15,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash -135505893, now seen corresponding path program 2 times [2022-11-19 07:54:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893672667] [2022-11-19 07:54:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:54:15,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:15,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893672667] [2022-11-19 07:54:15,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893672667] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:15,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:15,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949686310] [2022-11-19 07:54:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:15,144 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-11-19 07:54:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:15,271 INFO L93 Difference]: Finished difference Result 1029 states and 1180 transitions. [2022-11-19 07:54:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:15,271 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-11-19 07:54:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:15,275 INFO L225 Difference]: With dead ends: 1029 [2022-11-19 07:54:15,276 INFO L226 Difference]: Without dead ends: 618 [2022-11-19 07:54:15,277 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-11-19 07:54:15,280 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-11-19 07:54:15,281 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-11-19 07:54:15,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-11-19 07:54:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 612. [2022-11-19 07:54:15,366 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-11-19 07:54:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 695 transitions. [2022-11-19 07:54:15,370 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 695 transitions. Word has length 57 [2022-11-19 07:54:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:15,370 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 695 transitions. [2022-11-19 07:54:15,371 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-11-19 07:54:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 695 transitions. [2022-11-19 07:54:15,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 07:54:15,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:15,372 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-11-19 07:54:15,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:54:15,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash 99384636, now seen corresponding path program 1 times [2022-11-19 07:54:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:15,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469508359] [2022-11-19 07:54:15,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:15,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:54:15,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:15,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469508359] [2022-11-19 07:54:15,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469508359] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:15,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:15,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:15,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599311285] [2022-11-19 07:54:15,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:15,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:15,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:15,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:15,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:15,490 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-11-19 07:54:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:15,685 INFO L93 Difference]: Finished difference Result 1231 states and 1405 transitions. [2022-11-19 07:54:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:15,686 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-11-19 07:54:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:15,692 INFO L225 Difference]: With dead ends: 1231 [2022-11-19 07:54:15,692 INFO L226 Difference]: Without dead ends: 868 [2022-11-19 07:54:15,693 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-11-19 07:54:15,696 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-11-19 07:54:15,696 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-11-19 07:54:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-11-19 07:54:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 687. [2022-11-19 07:54:15,793 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-11-19 07:54:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 784 transitions. [2022-11-19 07:54:15,798 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 784 transitions. Word has length 60 [2022-11-19 07:54:15,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:15,799 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 784 transitions. [2022-11-19 07:54:15,799 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-11-19 07:54:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 784 transitions. [2022-11-19 07:54:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-19 07:54:15,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:15,801 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-11-19 07:54:15,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:54:15,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1415932190, now seen corresponding path program 1 times [2022-11-19 07:54:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:15,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293578280] [2022-11-19 07:54:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:54:16,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:16,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293578280] [2022-11-19 07:54:16,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293578280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:16,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:16,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:54:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759062529] [2022-11-19 07:54:16,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:16,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:54:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:16,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:54:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:54:16,023 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-11-19 07:54:16,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:16,521 INFO L93 Difference]: Finished difference Result 1736 states and 1967 transitions. [2022-11-19 07:54:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:54:16,521 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-11-19 07:54:16,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:16,526 INFO L225 Difference]: With dead ends: 1736 [2022-11-19 07:54:16,527 INFO L226 Difference]: Without dead ends: 1055 [2022-11-19 07:54:16,528 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-11-19 07:54:16,529 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 172 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11-19 07:54:16,530 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-11-19 07:54:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-11-19 07:54:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1006. [2022-11-19 07:54:16,691 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-11-19 07:54:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1132 transitions. [2022-11-19 07:54:16,697 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1132 transitions. Word has length 69 [2022-11-19 07:54:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:16,698 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1132 transitions. [2022-11-19 07:54:16,698 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-11-19 07:54:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1132 transitions. [2022-11-19 07:54:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-19 07:54:16,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:16,700 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-11-19 07:54:16,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:54:16,701 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash -646125163, now seen corresponding path program 1 times [2022-11-19 07:54:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:16,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767637264] [2022-11-19 07:54:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:54:16,771 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:16,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767637264] [2022-11-19 07:54:16,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767637264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:16,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:54:16,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:54:16,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829868408] [2022-11-19 07:54:16,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:16,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:54:16,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:54:16,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:54:16,774 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-11-19 07:54:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:16,969 INFO L93 Difference]: Finished difference Result 1972 states and 2226 transitions. [2022-11-19 07:54:16,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:54:16,970 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-11-19 07:54:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:16,975 INFO L225 Difference]: With dead ends: 1972 [2022-11-19 07:54:16,976 INFO L226 Difference]: Without dead ends: 1182 [2022-11-19 07:54:16,978 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-11-19 07:54:16,978 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-11-19 07:54:16,979 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-11-19 07:54:16,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2022-11-19 07:54:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1053. [2022-11-19 07:54:17,142 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-11-19 07:54:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1186 transitions. [2022-11-19 07:54:17,147 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1186 transitions. Word has length 70 [2022-11-19 07:54:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:17,147 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1186 transitions. [2022-11-19 07:54:17,148 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-11-19 07:54:17,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1186 transitions. [2022-11-19 07:54:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-19 07:54:17,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:17,150 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-11-19 07:54:17,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:54:17,150 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash 337037355, now seen corresponding path program 1 times [2022-11-19 07:54:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:17,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323287488] [2022-11-19 07:54:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-19 07:54:17,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323287488] [2022-11-19 07:54:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323287488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:54:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235671018] [2022-11-19 07:54:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:17,521 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:17,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:54:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:17,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 07:54:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:54:17,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:17,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235671018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:17,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:54:17,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-11-19 07:54:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039103041] [2022-11-19 07:54:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:17,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:54:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:17,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:54:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:54:17,737 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-11-19 07:54:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:18,009 INFO L93 Difference]: Finished difference Result 1917 states and 2191 transitions. [2022-11-19 07:54:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:54:18,009 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-11-19 07:54:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:18,014 INFO L225 Difference]: With dead ends: 1917 [2022-11-19 07:54:18,014 INFO L226 Difference]: Without dead ends: 870 [2022-11-19 07:54:18,018 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-11-19 07:54:18,019 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 57 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 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.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:18,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 514 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:54:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2022-11-19 07:54:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 685. [2022-11-19 07:54:18,151 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-11-19 07:54:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 774 transitions. [2022-11-19 07:54:18,154 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 774 transitions. Word has length 101 [2022-11-19 07:54:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:18,155 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 774 transitions. [2022-11-19 07:54:18,155 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-11-19 07:54:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 774 transitions. [2022-11-19 07:54:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-11-19 07:54:18,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:18,157 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-11-19 07:54:18,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:18,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:18,363 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:18,364 INFO L85 PathProgramCache]: Analyzing trace with hash -799495666, now seen corresponding path program 1 times [2022-11-19 07:54:18,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:18,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230243957] [2022-11-19 07:54:18,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:18,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-19 07:54:18,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:18,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230243957] [2022-11-19 07:54:18,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230243957] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:54:18,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325464397] [2022-11-19 07:54:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:18,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:18,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:18,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:18,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:54:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:18,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:54:18,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:54:18,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:18,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325464397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:18,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:54:18,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-19 07:54:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948004751] [2022-11-19 07:54:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:54:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:18,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:54:18,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:54:18,797 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-11-19 07:54:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:19,094 INFO L93 Difference]: Finished difference Result 1234 states and 1399 transitions. [2022-11-19 07:54:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:54:19,095 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-11-19 07:54:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:19,098 INFO L225 Difference]: With dead ends: 1234 [2022-11-19 07:54:19,098 INFO L226 Difference]: Without dead ends: 641 [2022-11-19 07:54:19,099 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-11-19 07:54:19,100 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 67 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:54:19,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 492 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:54:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-11-19 07:54:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 549. [2022-11-19 07:54:19,199 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-11-19 07:54:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 619 transitions. [2022-11-19 07:54:19,202 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 619 transitions. Word has length 111 [2022-11-19 07:54:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:19,202 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 619 transitions. [2022-11-19 07:54:19,203 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-11-19 07:54:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 619 transitions. [2022-11-19 07:54:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-19 07:54:19,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:19,208 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-11-19 07:54:19,214 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:19,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 07:54:19,414 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:19,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:19,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1284342463, now seen corresponding path program 1 times [2022-11-19 07:54:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:19,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726289359] [2022-11-19 07:54:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-19 07:54:19,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:19,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726289359] [2022-11-19 07:54:19,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726289359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:54:19,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732898063] [2022-11-19 07:54:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:19,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:19,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:19,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:54:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:19,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:54:19,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 07:54:19,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:54:19,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732898063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:54:19,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:54:19,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-19 07:54:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26656519] [2022-11-19 07:54:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:54:19,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:54:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:54:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:54:19,807 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-11-19 07:54:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:54:20,072 INFO L93 Difference]: Finished difference Result 1298 states and 1464 transitions. [2022-11-19 07:54:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:54:20,072 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-11-19 07:54:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:54:20,077 INFO L225 Difference]: With dead ends: 1298 [2022-11-19 07:54:20,077 INFO L226 Difference]: Without dead ends: 841 [2022-11-19 07:54:20,078 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-11-19 07:54:20,079 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 42 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-19 07:54:20,079 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-11-19 07:54:20,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-11-19 07:54:20,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 807. [2022-11-19 07:54:20,248 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-11-19 07:54:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 907 transitions. [2022-11-19 07:54:20,253 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 907 transitions. Word has length 112 [2022-11-19 07:54:20,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:54:20,253 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 907 transitions. [2022-11-19 07:54:20,254 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-11-19 07:54:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 907 transitions. [2022-11-19 07:54:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 07:54:20,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:54:20,256 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-11-19 07:54:20,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:54:20,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-19 07:54:20,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:54:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:54:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1807551347, now seen corresponding path program 1 times [2022-11-19 07:54:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:54:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041076714] [2022-11-19 07:54:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:54:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 07:54:21,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:54:21,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041076714] [2022-11-19 07:54:21,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041076714] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:54:21,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085937811] [2022-11-19 07:54:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:54:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:54:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:54:21,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:54:21,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:54:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:54:21,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-19 07:54:21,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:54:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:54:22,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:54:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 07:54:24,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085937811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:54:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [949457179] [2022-11-19 07:54:24,955 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2022-11-19 07:54:24,955 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:54:24,956 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:54:24,956 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:54:24,956 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:54:39,823 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 53 for LOIs [2022-11-19 07:54:39,829 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 104 for LOIs [2022-11-19 07:54:40,015 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 108 for LOIs [2022-11-19 07:54:40,101 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 131 for LOIs [2022-11-19 07:54:40,229 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 23 for LOIs [2022-11-19 07:54:40,232 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 116 for LOIs [2022-11-19 07:54:40,540 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 78 for LOIs [2022-11-19 07:54:40,581 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 23 for LOIs [2022-11-19 07:54:40,611 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:54:51,098 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '36075#(and (= ~q_req_up~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) (<= |#NULL.offset| 0) (<= 1 ~c_dr_st~0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_st~0 1) (<= 1 ~c_num_read~0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 07:54:51,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:54:51,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:54:51,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 16] total 48 [2022-11-19 07:54:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720590223] [2022-11-19 07:54:51,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:54:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-19 07:54:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:54:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-19 07:54:51,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=9377, Unknown=0, NotChecked=0, Total=10100 [2022-11-19 07:54:51,105 INFO L87 Difference]: Start difference. First operand 807 states and 907 transitions. Second operand has 48 states, 31 states have (on average 6.258064516129032) internal successors, (194), 36 states have internal predecessors, (194), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2022-11-19 07:55:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:11,594 INFO L93 Difference]: Finished difference Result 3089 states and 3555 transitions. [2022-11-19 07:55:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2022-11-19 07:55:11,594 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 31 states have (on average 6.258064516129032) internal successors, (194), 36 states have internal predecessors, (194), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) Word has length 113 [2022-11-19 07:55:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:11,604 INFO L225 Difference]: With dead ends: 3089 [2022-11-19 07:55:11,604 INFO L226 Difference]: Without dead ends: 2374 [2022-11-19 07:55:11,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 293 SyntacticMatches, 2 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39470 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=8996, Invalid=86794, Unknown=0, NotChecked=0, Total=95790 [2022-11-19 07:55:11,622 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3481 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 5156 mSolverCounterSat, 1959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3485 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 7115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1959 IncrementalHoareTripleChecker+Valid, 5156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:11,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3485 Valid, 1805 Invalid, 7115 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1959 Valid, 5156 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-19 07:55:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2022-11-19 07:55:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 1083. [2022-11-19 07:55:11,905 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-11-19 07:55:11,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1220 transitions. [2022-11-19 07:55:11,910 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1220 transitions. Word has length 113 [2022-11-19 07:55:11,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:11,911 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1220 transitions. [2022-11-19 07:55:11,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 31 states have (on average 6.258064516129032) internal successors, (194), 36 states have internal predecessors, (194), 17 states have call successors, (44), 14 states have call predecessors, (44), 22 states have return successors, (46), 17 states have call predecessors, (46), 17 states have call successors, (46) [2022-11-19 07:55:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1220 transitions. [2022-11-19 07:55:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-19 07:55:11,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:11,914 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-11-19 07:55:11,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:12,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-19 07:55:12,121 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:55:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 957768905, now seen corresponding path program 1 times [2022-11-19 07:55:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:55:12,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272239560] [2022-11-19 07:55:12,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:55:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 07:55:12,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:55:12,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272239560] [2022-11-19 07:55:12,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272239560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:12,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092435538] [2022-11-19 07:55:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:12,526 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:12,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:55:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:12,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-19 07:55:12,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 07:55:12,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 07:55:13,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092435538] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:13,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:55:13,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2022-11-19 07:55:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822254688] [2022-11-19 07:55:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:55:13,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:55:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:55:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:55:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:55:13,062 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-11-19 07:55:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:13,735 INFO L93 Difference]: Finished difference Result 2407 states and 2768 transitions. [2022-11-19 07:55:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:55:13,736 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-11-19 07:55:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:13,743 INFO L225 Difference]: With dead ends: 2407 [2022-11-19 07:55:13,743 INFO L226 Difference]: Without dead ends: 1416 [2022-11-19 07:55:13,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:55:13,747 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 122 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:13,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 367 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:55:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2022-11-19 07:55:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1163. [2022-11-19 07:55:14,039 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-11-19 07:55:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1330 transitions. [2022-11-19 07:55:14,044 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1330 transitions. Word has length 114 [2022-11-19 07:55:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:14,044 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 1330 transitions. [2022-11-19 07:55:14,044 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-11-19 07:55:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1330 transitions. [2022-11-19 07:55:14,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-19 07:55:14,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:14,047 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-11-19 07:55:14,065 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:55:14,254 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:55:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1090106568, now seen corresponding path program 1 times [2022-11-19 07:55:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:55:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783183102] [2022-11-19 07:55:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:55:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 34 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-19 07:55:15,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:55:15,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783183102] [2022-11-19 07:55:15,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783183102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:15,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324954994] [2022-11-19 07:55:15,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:15,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:15,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:55:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:15,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-19 07:55:15,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:16,311 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:55:16,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-19 07:55:18,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324954994] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:55:18,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2027365470] [2022-11-19 07:55:18,307 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-11-19 07:55:18,307 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:55:18,308 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:55:18,308 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:55:18,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:55:21,407 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 54 for LOIs [2022-11-19 07:55:21,414 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events with input of size 104 for LOIs [2022-11-19 07:55:21,509 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events with input of size 108 for LOIs [2022-11-19 07:55:21,632 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels with input of size 131 for LOIs [2022-11-19 07:55:21,770 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 49 for LOIs [2022-11-19 07:55:21,780 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads with input of size 116 for LOIs [2022-11-19 07:55:22,108 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 78 for LOIs [2022-11-19 07:55:22,149 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 25 for LOIs [2022-11-19 07:55:22,176 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:55:33,488 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '49412#(and (= ~q_req_up~0 1) (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~c_dr_pc~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (or (and (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (= ~p_dw_pc~0 1) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= |#NULL.base| 0)) (and (= 1 ~c_dr_i~0) (= ~c_num_read~0 1) (= ~p_dw_st~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= |#NULL.base| 0))) (= ~c_last_read~0 ~p_last_write~0) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1))' at error location [2022-11-19 07:55:33,489 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:55:33,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:55:33,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 48 [2022-11-19 07:55:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057948527] [2022-11-19 07:55:33,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:55:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-19 07:55:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:55:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-19 07:55:33,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=9681, Unknown=0, NotChecked=0, Total=10506 [2022-11-19 07:55:33,492 INFO L87 Difference]: Start difference. First operand 1163 states and 1330 transitions. Second operand has 48 states, 32 states have (on average 6.625) internal successors, (212), 37 states have internal predecessors, (212), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2022-11-19 07:55:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:45,694 INFO L93 Difference]: Finished difference Result 4259 states and 4962 transitions. [2022-11-19 07:55:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-19 07:55:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 32 states have (on average 6.625) internal successors, (212), 37 states have internal predecessors, (212), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) Word has length 123 [2022-11-19 07:55:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:45,707 INFO L225 Difference]: With dead ends: 4259 [2022-11-19 07:55:45,707 INFO L226 Difference]: Without dead ends: 3188 [2022-11-19 07:55:45,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 312 SyntacticMatches, 10 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18496 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=4911, Invalid=39399, Unknown=0, NotChecked=0, Total=44310 [2022-11-19 07:55:45,714 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 3366 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 4925 mSolverCounterSat, 2376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 7301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2376 IncrementalHoareTripleChecker+Valid, 4925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:45,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 1291 Invalid, 7301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2376 Valid, 4925 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-19 07:55:45,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2022-11-19 07:55:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 1630. [2022-11-19 07:55:46,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1132 states have (on average 1.1475265017667844) internal successors, (1299), 1148 states have internal predecessors, (1299), 252 states have call successors, (252), 207 states have call predecessors, (252), 245 states have return successors, (311), 275 states have call predecessors, (311), 251 states have call successors, (311) [2022-11-19 07:55:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1862 transitions. [2022-11-19 07:55:46,223 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1862 transitions. Word has length 123 [2022-11-19 07:55:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:46,224 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 1862 transitions. [2022-11-19 07:55:46,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 32 states have (on average 6.625) internal successors, (212), 37 states have internal predecessors, (212), 22 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 21 states have call predecessors, (51), 22 states have call successors, (51) [2022-11-19 07:55:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1862 transitions. [2022-11-19 07:55:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-19 07:55:46,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:46,227 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-11-19 07:55:46,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:46,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 07:55:46,434 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:55:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1472119423, now seen corresponding path program 1 times [2022-11-19 07:55:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:55:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656025504] [2022-11-19 07:55:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:55:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-19 07:55:46,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:55:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656025504] [2022-11-19 07:55:46,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656025504] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:46,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957607868] [2022-11-19 07:55:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:46,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:46,654 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:46,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:55:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:46,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 07:55:46,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 07:55:46,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:55:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-19 07:55:47,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957607868] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:47,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:55:47,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2022-11-19 07:55:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30298695] [2022-11-19 07:55:47,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:55:47,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:55:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:55:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:55:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:55:47,167 INFO L87 Difference]: Start difference. First operand 1630 states and 1862 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-19 07:55:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:47,861 INFO L93 Difference]: Finished difference Result 2605 states and 2969 transitions. [2022-11-19 07:55:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 07:55:47,862 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-11-19 07:55:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:47,870 INFO L225 Difference]: With dead ends: 2605 [2022-11-19 07:55:47,870 INFO L226 Difference]: Without dead ends: 1067 [2022-11-19 07:55:47,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:55:47,875 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 137 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:47,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 337 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:55:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-19 07:55:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 718. [2022-11-19 07:55:48,091 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-11-19 07:55:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 798 transitions. [2022-11-19 07:55:48,094 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 798 transitions. Word has length 124 [2022-11-19 07:55:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:48,095 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 798 transitions. [2022-11-19 07:55:48,096 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-11-19 07:55:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 798 transitions. [2022-11-19 07:55:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-19 07:55:48,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:55:48,100 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-11-19 07:55:48,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-19 07:55:48,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:55:48,306 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:55:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:55:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1677337614, now seen corresponding path program 1 times [2022-11-19 07:55:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:55:48,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821956318] [2022-11-19 07:55:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:55:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-19 07:55:49,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:55:49,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821956318] [2022-11-19 07:55:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821956318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:55:49,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762017393] [2022-11-19 07:55:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:55:49,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:49,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:55:49,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:55:49,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:55:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:55:49,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:55:49,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:55:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-19 07:55:49,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:55:49,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762017393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:55:49,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:55:49,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2022-11-19 07:55:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734177648] [2022-11-19 07:55:49,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:55:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:55:49,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:55:49,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:55:49,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:55:49,485 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-11-19 07:55:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:55:49,786 INFO L93 Difference]: Finished difference Result 965 states and 1070 transitions. [2022-11-19 07:55:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:55:49,787 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-11-19 07:55:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:55:49,788 INFO L225 Difference]: With dead ends: 965 [2022-11-19 07:55:49,788 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:55:49,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:55:49,790 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 43 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:55:49,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 748 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:55:49,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:55:49,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:55:49,791 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-11-19 07:55:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:55:49,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2022-11-19 07:55:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:55:49,792 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:55:49,792 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-11-19 07:55:49,793 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:55:49,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:55:49,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 07:55:49,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:55:50,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:55:50,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:56:34,007 INFO L899 garLoopResultBuilder]: For program point L321(line 321) no Hoare annotation was computed. [2022-11-19 07:56:34,011 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-11-19 07:56:34,011 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-11-19 07:56:34,012 INFO L899 garLoopResultBuilder]: For program point L313-1(line 313) no Hoare annotation was computed. [2022-11-19 07:56:34,012 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(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-11-19 07:56:34,012 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 307 331) no Hoare annotation was computed. [2022-11-19 07:56:34,013 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 251 270) no Hoare annotation was computed. [2022-11-19 07:56:34,013 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 251 270) the Hoare annotation is: true [2022-11-19 07:56:34,013 INFO L895 garLoopResultBuilder]: At program point L95(lines 83 97) the Hoare annotation is: (let ((.cse15 (= ~q_free~0 0))) (let ((.cse14 (not (= ~p_dw_st~0 0))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (and (= ~q_req_up~0 1) .cse15)) (.cse6 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (= ~q_write_ev~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= is_do_read_c_triggered_~__retres1~1 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))) (.cse10 (= ~q_read_ev~0 0)) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (= ~q_write_ev~0 1)) (.cse13 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse14 (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse1 (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)) .cse11 (not (= ~q_free~0 1)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse13) (or .cse0 .cse14 (not .cse2) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse5 (not .cse15) .cse7 .cse9 .cse10 .cse11 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse12) .cse13)))) [2022-11-19 07:56:34,013 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 80 98) the Hoare annotation is: true [2022-11-19 07:56:34,013 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-11-19 07:56:34,014 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 93) no Hoare annotation was computed. [2022-11-19 07:56:34,014 INFO L899 garLoopResultBuilder]: For program point L84-2(lines 84 93) no Hoare annotation was computed. [2022-11-19 07:56:34,014 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 80 98) no Hoare annotation was computed. [2022-11-19 07:56:34,014 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(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)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (and .cse5 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse7 (= ~q_free~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse3 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (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 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse7) (= |old(~q_write_ev~0)| 1) .cse2 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse3 .cse9 .cse4 (= |old(~q_write_ev~0)| 0) .cse6) (or .cse1 (= |old(~q_read_ev~0)| 1) .cse2 .cse8 (not .cse7) .cse0 .cse3 .cse9 .cse4 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse6)))) [2022-11-19 07:56:34,014 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 271 288) no Hoare annotation was computed. [2022-11-19 07:56:34,015 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 218 232) the Hoare annotation is: (let ((.cse11 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse1 (= |old(~q_read_ev~0)| 1)) (.cse2 (and .cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse4 (= ~q_free~0 0)) (.cse9 (= |old(~q_read_ev~0)| 0)) (.cse5 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse9 .cse10) (or .cse0 .cse1 .cse2 (= |old(~q_write_ev~0)| 1) .cse3 (not (= ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 (and (= |old(~q_req_up~0)| 1) .cse4) (= |old(~q_write_ev~0)| 0) .cse9 .cse10) (or (not .cse5) (and .cse11 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) (not (= ~p_num_write~0 0)) .cse3 (not (= ~c_num_read~0 0)) .cse6 (not (= |old(~q_read_ev~0)| 2)) (not (= ~p_dw_pc~0 |old(~q_req_up~0)|)) .cse8 (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)) .cse10)))) [2022-11-19 07:56:34,015 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 218 232) no Hoare annotation was computed. [2022-11-19 07:56:34,015 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 289 306) no Hoare annotation was computed. [2022-11-19 07:56:34,015 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 289 306) the Hoare annotation is: (let ((.cse13 (= ~q_free~0 1)) (.cse19 (= |old(~q_read_ev~0)| 0)) (.cse14 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse21 (= ~q_req_up~0 1)) (.cse22 (= ~q_free~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse0 (= ~c_dr_st~0 0)) (.cse12 (not .cse5)) (.cse15 (and .cse21 .cse22)) (.cse3 (and .cse14 .cse20)) (.cse17 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse18 (= |old(~q_write_ev~0)| 0)) (.cse1 (= |old(~q_read_ev~0)| 1)) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not .cse22)) (.cse16 (= |old(~q_write_ev~0)| 1)) (.cse6 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse8 (not (= ~p_dw_i~0 1))) (.cse9 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse10 (not (= 1 ~c_dr_i~0))) (.cse11 (and (or .cse21 .cse19) (or .cse13 .cse19)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse0) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse2 (not (= ~c_num_read~0 0)) .cse6 (not (= |old(~q_read_ev~0)| 2)) .cse8 (not .cse13) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse14 (= ~q_read_ev~0 2)) .cse10) (or .cse0 .cse1 .cse15 .cse16 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse18 .cse19 .cse10) (or .cse0 .cse12 .cse15 .cse16 .cse2 .cse3 .cse17 .cse6 (not .cse1) .cse7 .cse8 .cse18 .cse10) (or .cse1 .cse2 (and .cse20 (= ~q_write_ev~0 1)) .cse4 (not .cse16) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2022-11-19 07:56:34,016 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-11-19 07:56:34,016 INFO L899 garLoopResultBuilder]: For program point L349(lines 339 379) no Hoare annotation was computed. [2022-11-19 07:56:34,016 INFO L895 garLoopResultBuilder]: At program point L432(line 432) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse9 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse16 (= ~q_read_ev~0 1)) (.cse4 (= ~p_dw_st~0 0)) (.cse21 (= ~q_write_ev~0 1)) (.cse22 (not (= ~q_req_up~0 1))) (.cse19 (= ~q_free~0 0))) (let ((.cse7 (not (= ~q_write_ev~0 0))) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (or .cse22 (not .cse19))) (.cse14 (not .cse21)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse17 (not .cse4)) (.cse6 (not .cse16)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse8 (not .cse0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse20 (or (and .cse9 (not .cse2)) (and .cse22 .cse9))) (.cse5 (= ~p_dw_i~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 .cse1 .cse7 .cse16 .cse8 .cse3 .cse10 .cse11 .cse12 .cse4 .cse13 .cse5 .cse14 .cse15) (and .cse17 .cse6 .cse1 .cse18 .cse3 .cse19 .cse11 .cse12 .cse20 .cse5 .cse21) (and .cse17 .cse6 .cse1 .cse18 .cse8 .cse3 .cse19 .cse11 .cse12 .cse20 .cse5)))) [2022-11-19 07:56:34,016 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-19 07:56:34,016 INFO L899 garLoopResultBuilder]: For program point L342(line 342) no Hoare annotation was computed. [2022-11-19 07:56:34,016 INFO L899 garLoopResultBuilder]: For program point L433(line 433) no Hoare annotation was computed. [2022-11-19 07:56:34,017 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 177) no Hoare annotation was computed. [2022-11-19 07:56:34,017 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)) (.cse14 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= (+ ~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)) (.cse16 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~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 (not (= ~q_write_ev~0 1)) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse14 .cse7 .cse1 .cse15 .cse3 .cse13 .cse10 .cse11 .cse16 .cse4 .cse6) (and .cse14 .cse7 .cse1 .cse15 .cse8 .cse3 .cse13 .cse10 .cse11 .cse16 .cse6)))) [2022-11-19 07:56:34,017 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)) (.cse14 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= (+ ~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)) (.cse16 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~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 (not (= ~q_write_ev~0 1)) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse14 .cse7 .cse1 .cse15 .cse3 .cse13 .cse10 .cse11 .cse16 .cse4 .cse6) (and .cse14 .cse7 .cse1 .cse15 .cse8 .cse3 .cse13 .cse10 .cse11 .cse16 .cse6)))) [2022-11-19 07:56:34,017 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2022-11-19 07:56:34,018 INFO L895 garLoopResultBuilder]: At program point L442(lines 405 447) the Hoare annotation is: (or (= ~p_dw_pc~0 0) (= ~p_dw_pc~0 1)) [2022-11-19 07:56:34,018 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 375) no Hoare annotation was computed. [2022-11-19 07:56:34,018 INFO L895 garLoopResultBuilder]: At program point L203(line 203) the Hoare annotation is: false [2022-11-19 07:56:34,018 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 348) no Hoare annotation was computed. [2022-11-19 07:56:34,018 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 339 379) no Hoare annotation was computed. [2022-11-19 07:56:34,018 INFO L895 garLoopResultBuilder]: At program point L212(lines 165 217) the Hoare annotation is: (let ((.cse1 (not (= ~q_read_ev~0 1))) (.cse4 (not (= ~q_write_ev~0 0))) (.cse7 (not (= ~q_read_ev~0 0))) (.cse10 (= ~p_dw_pc~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= 1 ~c_dr_i~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse13 (= ~q_write_ev~0 2)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse0 (= ~p_dw_st~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (or .cse12 (and (= ~q_req_up~0 1) .cse13)) .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ~p_dw_st~0) .cse11 .cse14 .cse15) (and (= ~p_dw_pc~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse13 .cse12 .cse0 (= ~q_read_ev~0 2) .cse11 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0) .cse15))) [2022-11-19 07:56:34,019 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))) (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 (not (= ~q_write_ev~0 1)) (< ~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 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))))) [2022-11-19 07:56:34,019 INFO L899 garLoopResultBuilder]: For program point L427-1(line 427) no Hoare annotation was computed. [2022-11-19 07:56:34,019 INFO L895 garLoopResultBuilder]: At program point L419-1(lines 416 441) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse12 (not (= ~q_req_up~0 1))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (= ~p_dw_st~0 0))) (let ((.cse4 (= ~q_write_ev~0 2)) (.cse14 (not .cse5)) (.cse7 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= (+ ~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)) (.cse16 (or (and .cse9 (not .cse2)) (and .cse12 .cse9))) (.cse6 (= ~p_dw_i~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 (not (= ~q_write_ev~0 1)) (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse14 .cse7 .cse1 .cse15 .cse3 .cse13 .cse10 .cse11 .cse16 .cse4 .cse6) (and .cse14 .cse7 .cse1 .cse15 .cse8 .cse3 .cse13 .cse10 .cse11 .cse16 .cse6)))) [2022-11-19 07:56:34,019 INFO L899 garLoopResultBuilder]: For program point L353(lines 353 360) no Hoare annotation was computed. [2022-11-19 07:56:34,020 INFO L899 garLoopResultBuilder]: For program point L436(lines 436 440) no Hoare annotation was computed. [2022-11-19 07:56:34,020 INFO L895 garLoopResultBuilder]: At program point L172(lines 172 176) the Hoare annotation is: (and (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= (+ ~c_num_read~0 1) ~p_num_write~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (= ~p_dw_pc~0 1)) (.cse7 (let ((.cse9 (not (= ~q_read_ev~0 0)))) (or (and .cse9 (not (= ~q_free~0 1))) (and (not (= ~q_req_up~0 1)) .cse9)))) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) (or (not (= |old(~q_req_up~0)| 1)) (= ~q_free~0 0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) .cse3 .cse4 .cse5 .cse6 .cse7 (= 2 ~p_dw_st~0) .cse8 (not (= ~q_write_ev~0 1))) (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_write_ev~0 2) .cse8))) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) [2022-11-19 07:56:34,020 INFO L895 garLoopResultBuilder]: At program point L139-1(lines 127 162) the Hoare annotation is: (let ((.cse20 (= ~p_dw_pc~0 0)) (.cse21 (= ~p_dw_pc~0 1))) (let ((.cse3 (= ~c_dr_st~0 2)) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (or .cse20 .cse21)) (.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)) (.cse19 (= ~c_dr_st~0 0)) (.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)) (.cse16 (= ~q_free~0 0)) (.cse10 (= ~q_write_ev~0 2)) (.cse22 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse23 (= ~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 .cse1 (not (= ~q_read_ev~0 1)) (let ((.cse15 (< ~c_num_read~0 ~p_num_write~0)) (.cse17 (or (and .cse20 .cse10) .cse21)) (.cse18 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse3 .cse4 .cse15 .cse6 .cse16 .cse8 .cse9 .cse17 .cse12 .cse18) (and .cse4 (not (= ~q_write_ev~0 0)) .cse15 (not .cse19) .cse6 .cse16 .cse8 .cse9 .cse17 .cse12 (not (= ~q_write_ev~0 1)) .cse18))) (not (= ~q_read_ev~0 0)) (or .cse21 .cse11)) (and .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14) (and .cse20 .cse19 (= ~q_req_up~0 1) .cse1 .cse2 .cse4 .cse6 .cse16 .cse10 .cse22 .cse11 .cse23 .cse12 (= ~p_num_write~0 1))))) [2022-11-19 07:56:34,021 INFO L899 garLoopResultBuilder]: For program point L131(lines 131 135) no Hoare annotation was computed. [2022-11-19 07:56:34,021 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-11-19 07:56:34,021 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-11-19 07:56:34,021 INFO L899 garLoopResultBuilder]: For program point L181(lines 180 211) no Hoare annotation was computed. [2022-11-19 07:56:34,021 INFO L899 garLoopResultBuilder]: For program point L140(lines 139 157) no Hoare annotation was computed. [2022-11-19 07:56:34,021 INFO L899 garLoopResultBuilder]: For program point L198(lines 198 210) no Hoare annotation was computed. [2022-11-19 07:56:34,022 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:56:34,022 INFO L895 garLoopResultBuilder]: At program point L380(lines 332 385) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0))) (let ((.cse3 (= ~p_dw_st~0 0)) (.cse5 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse10 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 1)) (.cse4 (= ~p_dw_i~0 1))) (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 (not (= ~q_write_ev~0 1)) (< ~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 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))))) [2022-11-19 07:56:34,022 INFO L899 garLoopResultBuilder]: For program point L182-1(lines 182 192) no Hoare annotation was computed. [2022-11-19 07:56:34,022 INFO L895 garLoopResultBuilder]: At program point L141(lines 127 162) the Hoare annotation is: (let ((.cse2 (= ~c_dr_st~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_write_ev~0 2)) (.cse12 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1))) (or (let ((.cse14 (= ~p_dw_pc~0 1))) (and .cse0 (not (= ~q_read_ev~0 1)) (not (= ~q_read_ev~0 0)) (let ((.cse13 (= ~p_dw_pc~0 0))) (let ((.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse6 (or .cse13 .cse14)) (.cse7 (or (and .cse13 .cse11) .cse14)) (.cse8 (or (and (= ~q_req_up~0 1) (not (= ~q_free~0 0)) .cse11) .cse12)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~q_write_ev~0 1)) .cse10) (and (= ~c_dr_st~0 2) .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) (or .cse14 .cse15))) (and .cse2 (= ~p_num_write~0 0) .cse0 (= ~c_num_read~0 0) .cse1 .cse3 (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) .cse11 .cse12 .cse15 .cse9 (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-11-19 07:56:34,023 INFO L895 garLoopResultBuilder]: At program point L364(lines 339 379) the Hoare annotation is: (let ((.cse23 (= ~q_req_up~0 1))) (let ((.cse24 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse19 (not .cse23)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse6 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse26 (not .cse6)) (.cse27 (< ~c_num_read~0 ~p_num_write~0)) (.cse28 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse29 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse12 (not (= ~q_read_ev~0 1))) (.cse30 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not .cse0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse20 (not .cse24)) (.cse5 (= ~q_write_ev~0 2)) (.cse25 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)))) (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 .cse0 .cse23 .cse1 .cse2 .cse4 .cse24 .cse18 .cse5 .cse25 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse26 .cse12 .cse2 .cse27 .cse14 .cse4 .cse24 .cse17 .cse18 .cse28 .cse9 .cse29) (and (= ~p_dw_pc~0 0) .cse1 .cse30 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse25 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse26 .cse12 .cse2 .cse27 .cse4 .cse24 .cse17 .cse18 .cse28 .cse5 .cse9 .cse29) (and .cse12 (= ~c_num_read~0 ~p_num_write~0) .cse15 (let ((.cse31 (or (and .cse23 .cse20 .cse5) .cse25))) (or (and .cse30 .cse2 .cse4 .cse17 .cse18 .cse6 .cse31 .cse9) (and .cse2 .cse13 .cse14 .cse4 .cse17 .cse18 .cse6 .cse31 .cse9 .cse21)))))))) [2022-11-19 07:56:34,023 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2022-11-19 07:56:34,023 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-11-19 07:56:34,024 INFO L895 garLoopResultBuilder]: At program point L158(lines 124 163) the Hoare annotation is: (let ((.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= ~q_free~0 0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse5 (= 2 ~p_dw_st~0)) (.cse6 (= ~p_dw_i~0 1))) (or (and .cse0 (= ~q_req_up~0 1) (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse5 .cse6 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)) (and (not (= ~q_read_ev~0 1)) (let ((.cse7 (< ~c_num_read~0 ~p_num_write~0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (= ~c_dr_st~0 2) .cse1 .cse7 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6 .cse9) (and .cse1 (not (= ~q_write_ev~0 0)) .cse7 (not .cse0) .cse2 .cse3 .cse8 .cse4 .cse5 .cse6 (not (= ~q_write_ev~0 1)) .cse9))) (not (= ~q_read_ev~0 0))))) [2022-11-19 07:56:34,024 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-11-19 07:56:34,024 INFO L895 garLoopResultBuilder]: At program point L340(line 340) the Hoare annotation is: (let ((.cse23 (= ~q_req_up~0 1))) (let ((.cse24 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_free~0 1)) (.cse19 (not .cse23)) (.cse15 (not (= ~q_read_ev~0 0))) (.cse6 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse26 (not .cse6)) (.cse27 (< ~c_num_read~0 ~p_num_write~0)) (.cse28 (or (and .cse15 (not .cse3)) (and .cse19 .cse15))) (.cse29 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse12 (not (= ~q_read_ev~0 1))) (.cse30 (= ~c_dr_st~0 2)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (not (= ~q_write_ev~0 0))) (.cse14 (not .cse0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse20 (not .cse24)) (.cse5 (= ~q_write_ev~0 2)) (.cse25 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0)))) (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 .cse0 .cse23 .cse1 .cse2 .cse4 .cse24 .cse18 .cse5 .cse25 .cse7 .cse8 .cse9 (= ~p_num_write~0 1) (= ~q_write_ev~0 ~p_dw_st~0)) (and .cse26 .cse12 .cse2 .cse27 .cse14 .cse4 .cse24 .cse17 .cse18 .cse28 .cse9 .cse29) (and (= ~p_dw_pc~0 0) .cse1 .cse30 .cse2 .cse3 .cse4 .cse16 .cse17 .cse5 .cse25 .cse6 .cse7 .cse9 .cse10 .cse11 .cse22) (and .cse26 .cse12 .cse2 .cse27 .cse4 .cse24 .cse17 .cse18 .cse28 .cse5 .cse9 .cse29) (and .cse12 (= ~c_num_read~0 ~p_num_write~0) .cse15 (let ((.cse31 (or (and .cse23 .cse20 .cse5) .cse25))) (or (and .cse30 .cse2 .cse4 .cse17 .cse18 .cse6 .cse31 .cse9) (and .cse2 .cse13 .cse14 .cse4 .cse17 .cse18 .cse6 .cse31 .cse9 .cse21)))))))) [2022-11-19 07:56:34,024 INFO L895 garLoopResultBuilder]: At program point L208(line 208) the Hoare annotation is: false [2022-11-19 07:56:34,025 INFO L895 garLoopResultBuilder]: At program point L208-1(lines 168 216) the Hoare annotation is: (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse2 (not (= ~q_write_ev~0 0))) (.cse6 (not (= ~q_read_ev~0 0))) (.cse12 (not (= ~q_write_ev~0 1))) (.cse3 (= ~q_free~0 1)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~q_write_ev~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse16 (= ~q_req_up~0 1)) (.cse18 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse15 (not (= |ULTIMATE.start_eval_~tmp___1~0#1| 0))) (.cse20 (= ~q_read_ev~0 2)) (.cse9 (= 2 ~p_dw_st~0)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (not .cse14) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 (or .cse15 (and .cse16 .cse17)) .cse11 .cse12 .cse13) (and .cse18 .cse1 .cse3 .cse4 .cse5 .cse7 (let ((.cse19 (= ~p_dw_pc~0 0))) (or (and .cse19 (= ~c_dr_pc~0 ~p_dw_pc~0)) (and .cse19 (= ~c_dr_pc~0 1)))) .cse17 .cse15 .cse14 .cse20 .cse10 .cse11 (= ~q_req_up~0 ~p_dw_pc~0) .cse13) (and .cse16 .cse18 .cse1 .cse4 .cse5 (= ~q_free~0 0) (<= ~p_num_write~0 1) .cse8 .cse15 .cse20 (= ~c_dr_pc~0 0) .cse9 .cse10 (<= 1 ~p_num_write~0) (= ~q_write_ev~0 ~p_dw_st~0)))) [2022-11-19 07:56:34,025 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)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (not .cse0)) (.cse2 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 0)) (.cse4 (= ~p_dw_i~0 1))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~q_free~0 1) .cse2 (= ~q_req_up~0 0) (= ~q_write_ev~0 2) .cse3 (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse4 (= ~c_last_read~0 ~p_last_write~0) (= ~q_req_up~0 ~p_dw_pc~0)) (and (not .cse3) (not (= ~q_read_ev~0 1)) .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse5 .cse2 .cse6 (not (= ~q_read_ev~0 0)) .cse7 .cse8 .cse4 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse1 (not (= ~q_write_ev~0 0)) .cse5 .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse4 (not (= ~q_write_ev~0 1)) (< ~c_num_read~0 (+ ~p_num_write~0 1)))))) [2022-11-19 07:56:34,025 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-11-19 07:56:34,026 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 74) no Hoare annotation was computed. [2022-11-19 07:56:34,026 INFO L899 garLoopResultBuilder]: For program point L65-2(lines 65 74) no Hoare annotation was computed. [2022-11-19 07:56:34,026 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 61 79) no Hoare annotation was computed. [2022-11-19 07:56:34,026 INFO L895 garLoopResultBuilder]: At program point L76(lines 64 78) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 0)) (.cse0 (= ~q_read_ev~0 1)) (.cse5 (not (= ~c_dr_pc~0 1))) (.cse6 (= ~q_read_ev~0 0)) (.cse3 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_st~0 0)) (.cse1 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse4 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse8 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse8 .cse9) (or .cse10 (and (not .cse0) .cse8) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~q_req_up~0 1) .cse2) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) (and .cse0 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse3 .cse4 (= ~q_write_ev~0 0) .cse5 .cse6 .cse7 (= ~q_write_ev~0 1) .cse9) (or (not .cse3) (not (= ~q_req_up~0 ~p_dw_pc~0)) (not .cse10) (not (= ~p_num_write~0 0)) (not (= ~p_dw_pc~0 0)) .cse1 (not (= ~c_num_read~0 0)) .cse4 (not (= ~q_write_ev~0 2)) .cse7 (not (= ~q_free~0 1)) .cse8 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) .cse9))) [2022-11-19 07:56:34,026 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 61 79) the Hoare annotation is: true [2022-11-19 07:56:34,027 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 71) no Hoare annotation was computed. [2022-11-19 07:56:34,027 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-11-19 07:56:34,027 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-11-19 07:56:34,027 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-11-19 07:56:34,031 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:56:34,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:56:34,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:56:34 BoogieIcfgContainer [2022-11-19 07:56:34,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:56:34,101 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:56:34,101 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:56:34,101 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:56:34,102 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:00" (3/4) ... [2022-11-19 07:56:34,121 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:56:34,126 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-11-19 07:56:34,126 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-11-19 07:56:34,126 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-19 07:56:34,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-11-19 07:56:34,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-11-19 07:56:34,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-11-19 07:56:34,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-19 07:56:34,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-19 07:56:34,133 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2022-11-19 07:56:34,134 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2022-11-19 07:56:34,134 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-19 07:56:34,138 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:56:34,170 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))) || !(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))) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(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-11-19 07:56:34,177 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 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 == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 0))) && p_dw_i == 1) && c_num_read < p_num_write + 1))) && (p_dw_pc == 1 || q_read_ev == 2)) || (((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && q_write_ev == 2) && !(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-11-19 07:56:34,177 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) && tmp___1 == 1 [2022-11-19 07:56:34,214 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:56:34,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:56:34,215 INFO L158 Benchmark]: Toolchain (without parser) took 154802.35ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 110.3MB in the beginning and 500.7MB in the end (delta: -390.4MB). Peak memory consumption was 614.0MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,215 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 148.9MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:56:34,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.22ms. Allocated memory is still 148.9MB. Free memory was 110.0MB in the beginning and 121.1MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.64ms. Allocated memory is still 148.9MB. Free memory was 121.1MB in the beginning and 118.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:56:34,216 INFO L158 Benchmark]: Boogie Preprocessor took 44.76ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 117.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,217 INFO L158 Benchmark]: RCFGBuilder took 823.57ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 91.0MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,217 INFO L158 Benchmark]: TraceAbstraction took 153358.54ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 90.3MB in the beginning and 507.0MB in the end (delta: -416.6MB). Peak memory consumption was 689.9MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,218 INFO L158 Benchmark]: Witness Printer took 113.74ms. Allocated memory is still 1.2GB. Free memory was 507.0MB in the beginning and 500.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-19 07:56:34,219 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.29ms. Allocated memory is still 148.9MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.22ms. Allocated memory is still 148.9MB. Free memory was 110.0MB in the beginning and 121.1MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.64ms. Allocated memory is still 148.9MB. Free memory was 121.1MB in the beginning and 118.9MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.76ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 117.5MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 823.57ms. Allocated memory is still 148.9MB. Free memory was 117.5MB in the beginning and 91.0MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 153358.54ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 90.3MB in the beginning and 507.0MB in the end (delta: -416.6MB). Peak memory consumption was 689.9MB. Max. memory is 16.1GB. * Witness Printer took 113.74ms. Allocated memory is still 1.2GB. Free memory was 507.0MB in the beginning and 500.7MB in the end (delta: 6.3MB). 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: 153.2s, OverallIterations: 19, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 44.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9041 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9010 mSDsluCounter, 8888 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6776 mSDsCounter, 4834 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13055 IncrementalHoareTripleChecker+Invalid, 17889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4834 mSolverCounterUnsat, 2112 mSDtfsCounter, 13055 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2507 GetRequests, 1762 SyntacticMatches, 17 SemanticMatches, 728 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59330 ImplicationChecksByTransitivity, 54.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1630occurred in iteration=17, InterpolantAutomatonStates: 451, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 4843 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 2389 PreInvPairs, 2506 NumberOfFragments, 5344 HoareAnnotationTreeSize, 2389 FomulaSimplifications, 49101 FormulaSimplificationTreeSizeReduction, 21.7s HoareSimplificationTime, 37 FomulaSimplificationsInter, 1594617 FormulaSimplificationTreeSizeReductionInter, 22.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 2682 NumberOfCodeBlocks, 2682 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3177 ConstructedInterpolants, 0 QuantifiedInterpolants, 9984 SizeOfPredicates, 51 NumberOfNonLiveVariables, 3939 ConjunctsInSsa, 224 ConjunctsInUnsatCore, 33 InterpolantComputations, 16 PerfectInterpolantSequences, 1731/1995 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((((((((!(q_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) || ((((((((((((((!(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) && (!(tmp___1 == 0) || (q_req_up == 1 && q_write_ev == 2))) && 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) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((((((((((((((!(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) && (!(tmp___1 == 0) || (q_req_up == 1 && q_write_ev == 2))) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1) || (((((((((((((!(q_read_ev == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || (((((((((((((((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) - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(q_write_ev == 0)) && ((!(\old(q_req_up) == 1) || q_free == 0) || q_write_ev == \old(q_write_ev))) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) && tmp___1 == 1 - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((((((((((((p_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) || ((((!(p_dw_st == 0) && !(q_read_ev == 1)) && ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 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 == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && p_dw_i == 1) && !(q_write_ev == 1)) && p_num_write <= c_num_read + 1))) && !(q_read_ev == 0)) && (p_dw_pc == 1 || q_read_ev == 2))) || ((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 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)) || (((((((((((((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 || __retres1 == 0) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(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)) && ((((((((((((((!(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 || !(p_dw_st == 0)) || !(q_read_ev == 1)) || __retres1 == 0) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(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))) && (((((((((((c_dr_st == 0 || __retres1 == 0) || q_read_ev == 1) || !(p_last_write == q_buf_0)) || !(q_free == 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)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && q_req_up == p_dw_pc) || ((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1)) || ((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read + 1 == p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && p_dw_i == 1) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: p_dw_pc == 0 || p_dw_pc == 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((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)) && ((((((((((((((c_dr_st == 0 || (!(q_read_ev == 1) && __retres1 == 0)) || !(c_num_read < p_num_write + 1)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || (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))) && ((((((((((((((!(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: 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)) || (((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_write_ev == 2) && !(tmp___1 == 0)) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1) && q_write_ev == p_dw_st)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && c_num_read < 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) && p_num_write <= c_num_read + 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)) || (((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && 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) && ((!(q_read_ev == 0) && !(q_free == 1)) || (!(q_req_up == 1) && !(q_read_ev == 0)))) && q_write_ev == 2) && p_dw_i == 1) && p_num_write <= c_num_read + 1)) || (((!(q_read_ev == 1) && c_num_read == p_num_write) && !(q_read_ev == 0)) && ((((((((c_dr_st == 2 && p_last_write == q_buf_0) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 0))) && p_dw_i == 1) || (((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 0))) && p_dw_i == 1) && !(q_write_ev == 1)))) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((!(p_dw_st == 0) && !(q_read_ev == 1)) && !(q_read_ev == 0)) && ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && (p_dw_pc == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 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 == 0 || p_dw_pc == 1)) && ((p_dw_pc == 0 && q_write_ev == 2) || p_dw_pc == 1)) && (((q_req_up == 1 && !(q_free == 0)) && q_write_ev == 2) || !(tmp___1 == 0))) && p_dw_i == 1) && c_num_read < p_num_write + 1))) && (p_dw_pc == 1 || q_read_ev == 2)) || (((((((((((((c_dr_st == 0 && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && 1 == c_dr_i) && c_dr_pc == p_dw_pc) && q_req_up == 0) && q_write_ev == 2) && !(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: 124]: Loop Invariant Derived loop invariant: (((((((((((((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) || ((!(q_read_ev == 1) && ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 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))) && !(q_read_ev == 0)) - 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))) || !(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))) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(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: 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) RESULT: Ultimate proved your program to be correct! [2022-11-19 07:56:34,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ab13-4a53-413a-b109-4e8fbfa42a95/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE