./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:51:31,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:51:31,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:51:31,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:51:31,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:51:31,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:51:31,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:51:31,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:51:31,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:51:31,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:51:31,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:51:31,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:51:31,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:51:31,100 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:51:31,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:51:31,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:51:31,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:51:31,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:51:31,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:51:31,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:51:31,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:51:31,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:51:31,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:51:31,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:51:31,114 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:51:31,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:51:31,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:51:31,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:51:31,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:51:31,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:51:31,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:51:31,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:51:31,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:51:31,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:51:31,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:51:31,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:51:31,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:51:31,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:51:31,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:51:31,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:51:31,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:51:31,123 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 13:51:31,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:51:31,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:51:31,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:51:31,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:51:31,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:51:31,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:51:31,149 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:51:31,149 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:51:31,149 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:51:31,149 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:51:31,150 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:51:31,150 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:51:31,150 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:51:31,150 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:51:31,150 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:51:31,151 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:51:31,151 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:51:31,151 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:51:31,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:51:31,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:51:31,152 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:51:31,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:51:31,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:51:31,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:51:31,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:51:31,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:51:31,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:51:31,154 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 13:51:31,154 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:51:31,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:51:31,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:51:31,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:51:31,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:51:31,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:51:31,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:51:31,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:51:31,155 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:51:31,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:51:31,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:51:31,156 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:51:31,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:51:31,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:51:31,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:51:31,157 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_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2022-12-14 13:51:31,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:51:31,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:51:31,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:51:31,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:51:31,374 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:51:31,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-12-14 13:51:33,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:51:34,134 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:51:34,135 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-12-14 13:51:34,145 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/data/46d083afc/4984e41175c249b7a46f69e67fa86a15/FLAG8cad44ddf [2022-12-14 13:51:34,156 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/data/46d083afc/4984e41175c249b7a46f69e67fa86a15 [2022-12-14 13:51:34,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:51:34,159 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:51:34,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:51:34,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:51:34,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:51:34,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a64cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34, skipping insertion in model container [2022-12-14 13:51:34,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:51:34,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:51:34,344 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-12-14 13:51:34,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:51:34,454 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:51:34,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-12-14 13:51:34,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:51:34,534 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:51:34,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34 WrapperNode [2022-12-14 13:51:34,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:51:34,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:51:34,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:51:34,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:51:34,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,548 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,572 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 854 [2022-12-14 13:51:34,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:51:34,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:51:34,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:51:34,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:51:34,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:51:34,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:51:34,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:51:34,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:51:34,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (1/1) ... [2022-12-14 13:51:34,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:51:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:51:34,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:51:34,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:51:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:51:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:51:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 13:51:34,662 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 13:51:34,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:51:34,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:51:34,731 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:51:34,732 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:51:35,254 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:51:35,334 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:51:35,334 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-12-14 13:51:35,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:51:35 BoogieIcfgContainer [2022-12-14 13:51:35,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:51:35,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:51:35,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:51:35,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:51:35,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:51:34" (1/3) ... [2022-12-14 13:51:35,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577407a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:51:35, skipping insertion in model container [2022-12-14 13:51:35,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:51:34" (2/3) ... [2022-12-14 13:51:35,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577407a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:51:35, skipping insertion in model container [2022-12-14 13:51:35,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:51:35" (3/3) ... [2022-12-14 13:51:35,342 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-12-14 13:51:35,356 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:51:35,356 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-14 13:51:35,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:51:35,412 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;@76c23e1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:51:35,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-14 13:51:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-14 13:51:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 13:51:35,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:35,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:35,422 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1589961505, now seen corresponding path program 1 times [2022-12-14 13:51:35,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:35,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442597286] [2022-12-14 13:51:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:35,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:35,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:35,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442597286] [2022-12-14 13:51:35,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442597286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:35,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:35,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:51:35,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689328701] [2022-12-14 13:51:35,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:35,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:35,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:35,623 INFO L87 Difference]: Start difference. First operand has 239 states, 224 states have (on average 1.7857142857142858) internal successors, (400), 237 states have internal predecessors, (400), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:35,950 INFO L93 Difference]: Finished difference Result 642 states and 1088 transitions. [2022-12-14 13:51:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 13:51:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:35,960 INFO L225 Difference]: With dead ends: 642 [2022-12-14 13:51:35,960 INFO L226 Difference]: Without dead ends: 389 [2022-12-14 13:51:35,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:35,965 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 221 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:35,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 579 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:35,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-12-14 13:51:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 381. [2022-12-14 13:51:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 373 states have (on average 1.522788203753351) internal successors, (568), 380 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 568 transitions. [2022-12-14 13:51:36,018 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 568 transitions. Word has length 15 [2022-12-14 13:51:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:36,019 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 568 transitions. [2022-12-14 13:51:36,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 568 transitions. [2022-12-14 13:51:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 13:51:36,020 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:36,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:51:36,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:36,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:36,021 INFO L85 PathProgramCache]: Analyzing trace with hash -751090872, now seen corresponding path program 1 times [2022-12-14 13:51:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:36,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810438098] [2022-12-14 13:51:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:36,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:36,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810438098] [2022-12-14 13:51:36,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810438098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:36,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:36,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:51:36,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439283198] [2022-12-14 13:51:36,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:36,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:36,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:36,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:36,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:36,088 INFO L87 Difference]: Start difference. First operand 381 states and 568 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:36,226 INFO L93 Difference]: Finished difference Result 1047 states and 1583 transitions. [2022-12-14 13:51:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:36,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 13:51:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:36,228 INFO L225 Difference]: With dead ends: 1047 [2022-12-14 13:51:36,228 INFO L226 Difference]: Without dead ends: 676 [2022-12-14 13:51:36,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:36,230 INFO L413 NwaCegarLoop]: 547 mSDtfsCounter, 323 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:36,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 853 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-12-14 13:51:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 601. [2022-12-14 13:51:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.4974704890387858) internal successors, (888), 600 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 888 transitions. [2022-12-14 13:51:36,254 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 888 transitions. Word has length 19 [2022-12-14 13:51:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:36,254 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 888 transitions. [2022-12-14 13:51:36,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 888 transitions. [2022-12-14 13:51:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 13:51:36,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:36,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:36,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:51:36,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:36,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1189218106, now seen corresponding path program 1 times [2022-12-14 13:51:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:36,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044940464] [2022-12-14 13:51:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:36,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:36,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044940464] [2022-12-14 13:51:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044940464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:36,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:36,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900818816] [2022-12-14 13:51:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:36,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:36,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:36,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:36,337 INFO L87 Difference]: Start difference. First operand 601 states and 888 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:36,703 INFO L93 Difference]: Finished difference Result 1657 states and 2508 transitions. [2022-12-14 13:51:36,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-12-14 13:51:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:36,708 INFO L225 Difference]: With dead ends: 1657 [2022-12-14 13:51:36,708 INFO L226 Difference]: Without dead ends: 1066 [2022-12-14 13:51:36,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:36,710 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 928 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:36,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1086 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:51:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2022-12-14 13:51:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 920. [2022-12-14 13:51:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 912 states have (on average 1.537280701754386) internal successors, (1402), 919 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1402 transitions. [2022-12-14 13:51:36,747 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1402 transitions. Word has length 48 [2022-12-14 13:51:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:36,748 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1402 transitions. [2022-12-14 13:51:36,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1402 transitions. [2022-12-14 13:51:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-14 13:51:36,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:36,750 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:36,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:51:36,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:36,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:36,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1403331139, now seen corresponding path program 1 times [2022-12-14 13:51:36,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:36,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38040149] [2022-12-14 13:51:36,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:36,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:36,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:36,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38040149] [2022-12-14 13:51:36,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38040149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:36,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:36,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816574386] [2022-12-14 13:51:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:36,820 INFO L87 Difference]: Start difference. First operand 920 states and 1402 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:37,109 INFO L93 Difference]: Finished difference Result 2311 states and 3529 transitions. [2022-12-14 13:51:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:51:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-14 13:51:37,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:37,113 INFO L225 Difference]: With dead ends: 2311 [2022-12-14 13:51:37,113 INFO L226 Difference]: Without dead ends: 1401 [2022-12-14 13:51:37,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:37,115 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 352 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:37,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1121 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2022-12-14 13:51:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1286. [2022-12-14 13:51:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1278 states have (on average 1.5391236306729263) internal successors, (1967), 1285 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1967 transitions. [2022-12-14 13:51:37,161 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1967 transitions. Word has length 51 [2022-12-14 13:51:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:37,161 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1967 transitions. [2022-12-14 13:51:37,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1967 transitions. [2022-12-14 13:51:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 13:51:37,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:37,163 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-12-14 13:51:37,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:51:37,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash -770993297, now seen corresponding path program 1 times [2022-12-14 13:51:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:37,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902886621] [2022-12-14 13:51:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:37,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:51:37,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902886621] [2022-12-14 13:51:37,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902886621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:37,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:37,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:37,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345761098] [2022-12-14 13:51:37,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:37,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:37,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:37,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:37,229 INFO L87 Difference]: Start difference. First operand 1286 states and 1967 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:37,617 INFO L93 Difference]: Finished difference Result 4049 states and 6081 transitions. [2022-12-14 13:51:37,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:51:37,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-12-14 13:51:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:37,626 INFO L225 Difference]: With dead ends: 4049 [2022-12-14 13:51:37,626 INFO L226 Difference]: Without dead ends: 2771 [2022-12-14 13:51:37,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:37,630 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 544 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:37,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 831 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2022-12-14 13:51:37,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2468. [2022-12-14 13:51:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2468 states, 2460 states have (on average 1.5089430894308944) internal successors, (3712), 2467 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3712 transitions. [2022-12-14 13:51:37,717 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3712 transitions. Word has length 63 [2022-12-14 13:51:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:37,717 INFO L495 AbstractCegarLoop]: Abstraction has 2468 states and 3712 transitions. [2022-12-14 13:51:37,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3712 transitions. [2022-12-14 13:51:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 13:51:37,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:37,720 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-12-14 13:51:37,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:51:37,720 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1620568772, now seen corresponding path program 1 times [2022-12-14 13:51:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:37,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123027158] [2022-12-14 13:51:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:37,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:37,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123027158] [2022-12-14 13:51:37,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123027158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:37,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:37,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:51:37,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145733075] [2022-12-14 13:51:37,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:37,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:37,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:37,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:37,794 INFO L87 Difference]: Start difference. First operand 2468 states and 3712 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:38,137 INFO L93 Difference]: Finished difference Result 5448 states and 8252 transitions. [2022-12-14 13:51:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-12-14 13:51:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:38,144 INFO L225 Difference]: With dead ends: 5448 [2022-12-14 13:51:38,144 INFO L226 Difference]: Without dead ends: 2774 [2022-12-14 13:51:38,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:38,147 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 552 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:38,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 789 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-12-14 13:51:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2469. [2022-12-14 13:51:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2469 states, 2461 states have (on average 1.5160503860219423) internal successors, (3731), 2468 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2469 states to 2469 states and 3731 transitions. [2022-12-14 13:51:38,232 INFO L78 Accepts]: Start accepts. Automaton has 2469 states and 3731 transitions. Word has length 63 [2022-12-14 13:51:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:38,233 INFO L495 AbstractCegarLoop]: Abstraction has 2469 states and 3731 transitions. [2022-12-14 13:51:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2469 states and 3731 transitions. [2022-12-14 13:51:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-14 13:51:38,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:38,234 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:38,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:51:38,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1698007186, now seen corresponding path program 1 times [2022-12-14 13:51:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:38,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292375904] [2022-12-14 13:51:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:38,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:38,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292375904] [2022-12-14 13:51:38,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292375904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:38,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:38,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:51:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984796860] [2022-12-14 13:51:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:38,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:38,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:38,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:38,265 INFO L87 Difference]: Start difference. First operand 2469 states and 3731 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:38,440 INFO L93 Difference]: Finished difference Result 5654 states and 8644 transitions. [2022-12-14 13:51:38,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:38,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-12-14 13:51:38,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:38,447 INFO L225 Difference]: With dead ends: 5654 [2022-12-14 13:51:38,448 INFO L226 Difference]: Without dead ends: 3195 [2022-12-14 13:51:38,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:38,451 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 292 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:38,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 507 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2022-12-14 13:51:38,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2881. [2022-12-14 13:51:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2881 states, 2873 states have (on average 1.5391576749042812) internal successors, (4422), 2880 states have internal predecessors, (4422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4422 transitions. [2022-12-14 13:51:38,562 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4422 transitions. Word has length 63 [2022-12-14 13:51:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:38,563 INFO L495 AbstractCegarLoop]: Abstraction has 2881 states and 4422 transitions. [2022-12-14 13:51:38,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4422 transitions. [2022-12-14 13:51:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-14 13:51:38,565 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:38,565 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:38,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:51:38,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:38,566 INFO L85 PathProgramCache]: Analyzing trace with hash 62278584, now seen corresponding path program 1 times [2022-12-14 13:51:38,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:38,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255164447] [2022-12-14 13:51:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:38,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:38,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:38,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255164447] [2022-12-14 13:51:38,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255164447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:38,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:38,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:51:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458291477] [2022-12-14 13:51:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:38,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:38,602 INFO L87 Difference]: Start difference. First operand 2881 states and 4422 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:38,843 INFO L93 Difference]: Finished difference Result 6310 states and 9674 transitions. [2022-12-14 13:51:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:38,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-12-14 13:51:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:38,852 INFO L225 Difference]: With dead ends: 6310 [2022-12-14 13:51:38,852 INFO L226 Difference]: Without dead ends: 3447 [2022-12-14 13:51:38,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:38,856 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 162 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:38,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 615 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2022-12-14 13:51:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3164. [2022-12-14 13:51:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3156 states have (on average 1.5348542458808618) internal successors, (4844), 3163 states have internal predecessors, (4844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4844 transitions. [2022-12-14 13:51:38,979 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4844 transitions. Word has length 78 [2022-12-14 13:51:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:38,979 INFO L495 AbstractCegarLoop]: Abstraction has 3164 states and 4844 transitions. [2022-12-14 13:51:38,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4844 transitions. [2022-12-14 13:51:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-12-14 13:51:38,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:38,983 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:38,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:51:38,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 292284654, now seen corresponding path program 1 times [2022-12-14 13:51:38,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:38,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438571711] [2022-12-14 13:51:38,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:39,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:39,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438571711] [2022-12-14 13:51:39,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438571711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:39,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:39,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390109068] [2022-12-14 13:51:39,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:39,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:39,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:39,029 INFO L87 Difference]: Start difference. First operand 3164 states and 4844 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:39,397 INFO L93 Difference]: Finished difference Result 7467 states and 11425 transitions. [2022-12-14 13:51:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-12-14 13:51:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:39,406 INFO L225 Difference]: With dead ends: 7467 [2022-12-14 13:51:39,406 INFO L226 Difference]: Without dead ends: 4384 [2022-12-14 13:51:39,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:39,409 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 208 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:39,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 588 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4384 states. [2022-12-14 13:51:39,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4384 to 3406. [2022-12-14 13:51:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3398 states have (on average 1.468510888758093) internal successors, (4990), 3405 states have internal predecessors, (4990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 4990 transitions. [2022-12-14 13:51:39,572 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 4990 transitions. Word has length 88 [2022-12-14 13:51:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:39,573 INFO L495 AbstractCegarLoop]: Abstraction has 3406 states and 4990 transitions. [2022-12-14 13:51:39,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 4990 transitions. [2022-12-14 13:51:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-12-14 13:51:39,574 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:39,574 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:39,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:51:39,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:39,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1476718504, now seen corresponding path program 1 times [2022-12-14 13:51:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:39,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139921470] [2022-12-14 13:51:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:51:39,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:39,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139921470] [2022-12-14 13:51:39,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139921470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:39,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:39,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:51:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875840707] [2022-12-14 13:51:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:39,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:39,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:39,628 INFO L87 Difference]: Start difference. First operand 3406 states and 4990 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:40,020 INFO L93 Difference]: Finished difference Result 7015 states and 10275 transitions. [2022-12-14 13:51:40,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:40,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-12-14 13:51:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:40,032 INFO L225 Difference]: With dead ends: 7015 [2022-12-14 13:51:40,032 INFO L226 Difference]: Without dead ends: 3735 [2022-12-14 13:51:40,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:40,035 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 474 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:40,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 926 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-12-14 13:51:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3617. [2022-12-14 13:51:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3609 states have (on average 1.4630091438071489) internal successors, (5280), 3616 states have internal predecessors, (5280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5280 transitions. [2022-12-14 13:51:40,181 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5280 transitions. Word has length 95 [2022-12-14 13:51:40,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:40,182 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5280 transitions. [2022-12-14 13:51:40,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5280 transitions. [2022-12-14 13:51:40,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-14 13:51:40,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:40,183 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:40,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:51:40,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:40,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 394232342, now seen corresponding path program 1 times [2022-12-14 13:51:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631291586] [2022-12-14 13:51:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:40,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:40,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631291586] [2022-12-14 13:51:40,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631291586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:40,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:40,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:51:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463109525] [2022-12-14 13:51:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:40,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:40,228 INFO L87 Difference]: Start difference. First operand 3617 states and 5280 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:40,482 INFO L93 Difference]: Finished difference Result 7143 states and 10448 transitions. [2022-12-14 13:51:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-12-14 13:51:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:40,498 INFO L225 Difference]: With dead ends: 7143 [2022-12-14 13:51:40,499 INFO L226 Difference]: Without dead ends: 3617 [2022-12-14 13:51:40,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:40,502 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 277 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:40,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 326 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:40,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3617 states. [2022-12-14 13:51:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3617 to 3617. [2022-12-14 13:51:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3609 states have (on average 1.4505403158769743) internal successors, (5235), 3616 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5235 transitions. [2022-12-14 13:51:40,675 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5235 transitions. Word has length 96 [2022-12-14 13:51:40,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:40,675 INFO L495 AbstractCegarLoop]: Abstraction has 3617 states and 5235 transitions. [2022-12-14 13:51:40,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5235 transitions. [2022-12-14 13:51:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-12-14 13:51:40,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:40,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:40,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:51:40,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:40,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1682600151, now seen corresponding path program 1 times [2022-12-14 13:51:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:40,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958346155] [2022-12-14 13:51:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:51:40,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958346155] [2022-12-14 13:51:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958346155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:40,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:40,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:51:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425861748] [2022-12-14 13:51:40,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:40,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:40,725 INFO L87 Difference]: Start difference. First operand 3617 states and 5235 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:41,287 INFO L93 Difference]: Finished difference Result 8692 states and 12599 transitions. [2022-12-14 13:51:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:41,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-12-14 13:51:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:41,295 INFO L225 Difference]: With dead ends: 8692 [2022-12-14 13:51:41,295 INFO L226 Difference]: Without dead ends: 5085 [2022-12-14 13:51:41,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:41,299 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 339 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:41,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 950 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:51:41,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5085 states. [2022-12-14 13:51:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5085 to 4249. [2022-12-14 13:51:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4241 states have (on average 1.441641122376798) internal successors, (6114), 4248 states have internal predecessors, (6114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 6114 transitions. [2022-12-14 13:51:41,477 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 6114 transitions. Word has length 98 [2022-12-14 13:51:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:41,477 INFO L495 AbstractCegarLoop]: Abstraction has 4249 states and 6114 transitions. [2022-12-14 13:51:41,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 6114 transitions. [2022-12-14 13:51:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-14 13:51:41,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:41,479 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:41,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:51:41,479 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:41,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:41,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1364034737, now seen corresponding path program 1 times [2022-12-14 13:51:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130392390] [2022-12-14 13:51:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:41,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:41,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:41,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130392390] [2022-12-14 13:51:41,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130392390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:41,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:41,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:51:41,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875924629] [2022-12-14 13:51:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:41,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:51:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:51:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:41,538 INFO L87 Difference]: Start difference. First operand 4249 states and 6114 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:42,880 INFO L93 Difference]: Finished difference Result 22914 states and 33155 transitions. [2022-12-14 13:51:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:51:42,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-12-14 13:51:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:42,905 INFO L225 Difference]: With dead ends: 22914 [2022-12-14 13:51:42,905 INFO L226 Difference]: Without dead ends: 18768 [2022-12-14 13:51:42,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:51:42,910 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 1467 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 2741 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:42,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2741 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:51:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18768 states. [2022-12-14 13:51:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18768 to 7352. [2022-12-14 13:51:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4552015250544663) internal successors, (10687), 7351 states have internal predecessors, (10687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10687 transitions. [2022-12-14 13:51:43,443 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10687 transitions. Word has length 105 [2022-12-14 13:51:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:43,444 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10687 transitions. [2022-12-14 13:51:43,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10687 transitions. [2022-12-14 13:51:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 13:51:43,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:43,445 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 13:51:43,445 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:43,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 580488524, now seen corresponding path program 1 times [2022-12-14 13:51:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:43,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779551543] [2022-12-14 13:51:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:43,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:51:43,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:43,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779551543] [2022-12-14 13:51:43,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779551543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:43,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:43,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225098223] [2022-12-14 13:51:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:43,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:43,478 INFO L87 Difference]: Start difference. First operand 7352 states and 10687 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:44,116 INFO L93 Difference]: Finished difference Result 14609 states and 21254 transitions. [2022-12-14 13:51:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:44,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-12-14 13:51:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:44,127 INFO L225 Difference]: With dead ends: 14609 [2022-12-14 13:51:44,127 INFO L226 Difference]: Without dead ends: 7360 [2022-12-14 13:51:44,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:44,132 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 311 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:44,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 643 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2022-12-14 13:51:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7352. [2022-12-14 13:51:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4212962962962963) internal successors, (10438), 7351 states have internal predecessors, (10438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10438 transitions. [2022-12-14 13:51:44,561 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10438 transitions. Word has length 107 [2022-12-14 13:51:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:44,561 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10438 transitions. [2022-12-14 13:51:44,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10438 transitions. [2022-12-14 13:51:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-14 13:51:44,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:44,562 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:51:44,562 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1871339303, now seen corresponding path program 1 times [2022-12-14 13:51:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707643585] [2022-12-14 13:51:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:51:44,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:44,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707643585] [2022-12-14 13:51:44,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707643585] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:51:44,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643866310] [2022-12-14 13:51:44,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:44,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:44,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:51:44,616 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:51:44,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:51:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:44,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 13:51:44,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:51:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 13:51:44,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:51:44,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643866310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:44,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:51:44,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-14 13:51:44,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962700335] [2022-12-14 13:51:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:44,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:44,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:51:44,785 INFO L87 Difference]: Start difference. First operand 7352 states and 10438 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:45,523 INFO L93 Difference]: Finished difference Result 14601 states and 20756 transitions. [2022-12-14 13:51:45,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-12-14 13:51:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:45,532 INFO L225 Difference]: With dead ends: 14601 [2022-12-14 13:51:45,532 INFO L226 Difference]: Without dead ends: 7352 [2022-12-14 13:51:45,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:51:45,538 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 237 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:45,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 340 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2022-12-14 13:51:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 7352. [2022-12-14 13:51:45,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7352 states, 7344 states have (on average 1.4098583877995643) internal successors, (10354), 7351 states have internal predecessors, (10354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7352 states to 7352 states and 10354 transitions. [2022-12-14 13:51:45,965 INFO L78 Accepts]: Start accepts. Automaton has 7352 states and 10354 transitions. Word has length 107 [2022-12-14 13:51:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:45,965 INFO L495 AbstractCegarLoop]: Abstraction has 7352 states and 10354 transitions. [2022-12-14 13:51:45,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7352 states and 10354 transitions. [2022-12-14 13:51:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 13:51:45,966 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:45,966 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:45,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:51:46,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:46,167 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash -302437875, now seen corresponding path program 1 times [2022-12-14 13:51:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:46,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236839706] [2022-12-14 13:51:46,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 13:51:46,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236839706] [2022-12-14 13:51:46,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236839706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:46,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:46,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672439698] [2022-12-14 13:51:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:46,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:46,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:46,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:46,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:51:46,232 INFO L87 Difference]: Start difference. First operand 7352 states and 10354 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:47,499 INFO L93 Difference]: Finished difference Result 16362 states and 22995 transitions. [2022-12-14 13:51:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:47,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-12-14 13:51:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:47,516 INFO L225 Difference]: With dead ends: 16362 [2022-12-14 13:51:47,516 INFO L226 Difference]: Without dead ends: 16358 [2022-12-14 13:51:47,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:47,520 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 790 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:47,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1047 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16358 states. [2022-12-14 13:51:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16358 to 13656. [2022-12-14 13:51:48,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13656 states, 13648 states have (on average 1.4251172332942557) internal successors, (19450), 13655 states have internal predecessors, (19450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13656 states to 13656 states and 19450 transitions. [2022-12-14 13:51:48,519 INFO L78 Accepts]: Start accepts. Automaton has 13656 states and 19450 transitions. Word has length 109 [2022-12-14 13:51:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:48,520 INFO L495 AbstractCegarLoop]: Abstraction has 13656 states and 19450 transitions. [2022-12-14 13:51:48,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13656 states and 19450 transitions. [2022-12-14 13:51:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-14 13:51:48,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:48,521 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:48,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 13:51:48,521 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:48,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:48,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1692187960, now seen corresponding path program 1 times [2022-12-14 13:51:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:48,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382323821] [2022-12-14 13:51:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 13:51:48,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:48,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382323821] [2022-12-14 13:51:48,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382323821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:51:48,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540841937] [2022-12-14 13:51:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:51:48,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:51:48,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:51:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:48,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:51:48,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:51:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:51:48,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:51:48,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540841937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:48,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:51:48,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-12-14 13:51:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977750443] [2022-12-14 13:51:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:48,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:51:48,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:51:48,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:51:48,715 INFO L87 Difference]: Start difference. First operand 13656 states and 19450 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:50,067 INFO L93 Difference]: Finished difference Result 19847 states and 28229 transitions. [2022-12-14 13:51:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:51:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-12-14 13:51:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:50,086 INFO L225 Difference]: With dead ends: 19847 [2022-12-14 13:51:50,086 INFO L226 Difference]: Without dead ends: 19846 [2022-12-14 13:51:50,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:51:50,089 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 501 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:50,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 669 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19846 states. [2022-12-14 13:51:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19846 to 13655. [2022-12-14 13:51:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13655 states, 13648 states have (on average 1.4242379835873389) internal successors, (19438), 13654 states have internal predecessors, (19438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:51,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13655 states to 13655 states and 19438 transitions. [2022-12-14 13:51:51,218 INFO L78 Accepts]: Start accepts. Automaton has 13655 states and 19438 transitions. Word has length 113 [2022-12-14 13:51:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:51,218 INFO L495 AbstractCegarLoop]: Abstraction has 13655 states and 19438 transitions. [2022-12-14 13:51:51,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13655 states and 19438 transitions. [2022-12-14 13:51:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 13:51:51,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:51,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:51,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:51:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 13:51:51,421 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -918218973, now seen corresponding path program 1 times [2022-12-14 13:51:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898135163] [2022-12-14 13:51:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 13:51:51,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898135163] [2022-12-14 13:51:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898135163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:51:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365647728] [2022-12-14 13:51:51,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:51,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:51:51,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:51:51,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 13:51:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:51,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 13:51:51,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:51:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:51:51,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:51:51,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365647728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:51,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:51:51,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-14 13:51:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889592873] [2022-12-14 13:51:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:51,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:51:51,597 INFO L87 Difference]: Start difference. First operand 13655 states and 19438 transitions. Second operand has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:53,001 INFO L93 Difference]: Finished difference Result 18154 states and 25711 transitions. [2022-12-14 13:51:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-12-14 13:51:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:53,019 INFO L225 Difference]: With dead ends: 18154 [2022-12-14 13:51:53,019 INFO L226 Difference]: Without dead ends: 18153 [2022-12-14 13:51:53,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:51:53,022 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 247 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:53,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 677 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18153 states. [2022-12-14 13:51:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18153 to 13654. [2022-12-14 13:51:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13654 states, 13648 states have (on average 1.4233587338804221) internal successors, (19426), 13653 states have internal predecessors, (19426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13654 states to 13654 states and 19426 transitions. [2022-12-14 13:51:53,996 INFO L78 Accepts]: Start accepts. Automaton has 13654 states and 19426 transitions. Word has length 114 [2022-12-14 13:51:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:53,996 INFO L495 AbstractCegarLoop]: Abstraction has 13654 states and 19426 transitions. [2022-12-14 13:51:53,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 53.0) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13654 states and 19426 transitions. [2022-12-14 13:51:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-12-14 13:51:53,999 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:54,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:54,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 13:51:54,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 13:51:54,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2144201763, now seen corresponding path program 1 times [2022-12-14 13:51:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:54,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68691108] [2022-12-14 13:51:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:51:54,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:54,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68691108] [2022-12-14 13:51:54,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68691108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:54,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:54,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:51:54,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346704164] [2022-12-14 13:51:54,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:54,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:51:54,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:51:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:54,301 INFO L87 Difference]: Start difference. First operand 13654 states and 19426 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:54,750 INFO L93 Difference]: Finished difference Result 16602 states and 23507 transitions. [2022-12-14 13:51:54,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:51:54,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2022-12-14 13:51:54,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:54,754 INFO L225 Difference]: With dead ends: 16602 [2022-12-14 13:51:54,754 INFO L226 Difference]: Without dead ends: 3051 [2022-12-14 13:51:54,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:51:54,762 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 130 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:54,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:54,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2022-12-14 13:51:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 2323. [2022-12-14 13:51:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2317 states have (on average 1.1890375485541649) internal successors, (2755), 2322 states have internal predecessors, (2755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 2755 transitions. [2022-12-14 13:51:55,114 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 2755 transitions. Word has length 192 [2022-12-14 13:51:55,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:55,114 INFO L495 AbstractCegarLoop]: Abstraction has 2323 states and 2755 transitions. [2022-12-14 13:51:55,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 2755 transitions. [2022-12-14 13:51:55,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-12-14 13:51:55,117 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:55,117 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-14 13:51:55,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 13:51:55,117 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:55,117 INFO L85 PathProgramCache]: Analyzing trace with hash -689797434, now seen corresponding path program 1 times [2022-12-14 13:51:55,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:55,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82242526] [2022-12-14 13:51:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:55,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 108 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 13:51:55,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82242526] [2022-12-14 13:51:55,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82242526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:51:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332988868] [2022-12-14 13:51:55,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:55,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:55,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:51:55,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:51:55,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 13:51:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:55,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 13:51:55,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:51:55,414 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 13:51:55,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:51:55,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332988868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:55,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:51:55,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-14 13:51:55,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603514534] [2022-12-14 13:51:55,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:55,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:51:55,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:55,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:51:55,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:51:55,416 INFO L87 Difference]: Start difference. First operand 2323 states and 2755 transitions. Second operand has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:55,665 INFO L93 Difference]: Finished difference Result 3211 states and 3830 transitions. [2022-12-14 13:51:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:51:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2022-12-14 13:51:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:55,667 INFO L225 Difference]: With dead ends: 3211 [2022-12-14 13:51:55,667 INFO L226 Difference]: Without dead ends: 1462 [2022-12-14 13:51:55,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:51:55,669 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 389 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:55,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 458 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-12-14 13:51:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1176. [2022-12-14 13:51:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1174 states have (on average 1.1814310051107326) internal successors, (1387), 1175 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1387 transitions. [2022-12-14 13:51:55,787 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1387 transitions. Word has length 207 [2022-12-14 13:51:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:55,787 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1387 transitions. [2022-12-14 13:51:55,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.4) internal successors, (202), 5 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1387 transitions. [2022-12-14 13:51:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-12-14 13:51:55,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:55,789 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:55,793 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 13:51:55,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:51:55,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:55,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1687140426, now seen corresponding path program 1 times [2022-12-14 13:51:55,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:55,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588200339] [2022-12-14 13:51:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:55,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:51:56,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:56,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588200339] [2022-12-14 13:51:56,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588200339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:56,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:56,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:51:56,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514219822] [2022-12-14 13:51:56,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:56,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:51:56,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:56,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:51:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:56,102 INFO L87 Difference]: Start difference. First operand 1176 states and 1387 transitions. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:56,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:56,470 INFO L93 Difference]: Finished difference Result 2259 states and 2696 transitions. [2022-12-14 13:51:56,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:51:56,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2022-12-14 13:51:56,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:56,472 INFO L225 Difference]: With dead ends: 2259 [2022-12-14 13:51:56,472 INFO L226 Difference]: Without dead ends: 1835 [2022-12-14 13:51:56,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:51:56,474 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 448 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:56,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 856 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:56,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-12-14 13:51:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1164. [2022-12-14 13:51:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1162 states have (on average 1.1764199655765921) internal successors, (1367), 1163 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1367 transitions. [2022-12-14 13:51:56,609 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1367 transitions. Word has length 208 [2022-12-14 13:51:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:56,609 INFO L495 AbstractCegarLoop]: Abstraction has 1164 states and 1367 transitions. [2022-12-14 13:51:56,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1367 transitions. [2022-12-14 13:51:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-12-14 13:51:56,610 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:51:56,610 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:51:56,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 13:51:56,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-14 13:51:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:51:56,611 INFO L85 PathProgramCache]: Analyzing trace with hash -79781587, now seen corresponding path program 1 times [2022-12-14 13:51:56,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:51:56,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49188706] [2022-12-14 13:51:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:51:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:51:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:51:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 13:51:56,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:51:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49188706] [2022-12-14 13:51:56,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49188706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:51:56,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:51:56,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:51:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461484506] [2022-12-14 13:51:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:51:56,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:51:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:51:56,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:51:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:51:56,704 INFO L87 Difference]: Start difference. First operand 1164 states and 1367 transitions. Second operand has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:51:57,124 INFO L93 Difference]: Finished difference Result 1725 states and 2050 transitions. [2022-12-14 13:51:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:51:57,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2022-12-14 13:51:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:51:57,125 INFO L225 Difference]: With dead ends: 1725 [2022-12-14 13:51:57,125 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 13:51:57,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:51:57,127 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 478 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:51:57,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 558 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:51:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 13:51:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 13:51:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:57,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 13:51:57,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 209 [2022-12-14 13:51:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:51:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 13:51:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 49.75) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:51:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 13:51:57,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-14 13:51:57,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-14 13:51:57,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 13:51:57,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 13:52:09,853 WARN L233 SmtUtils]: Spent 10.26s on a formula simplification. DAG size of input: 240 DAG size of output: 233 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 13:53:46,700 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 835 DAG size of output: 68 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 13:53:47,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##406(lines 764 808) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##412(lines 772 807) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##418(lines 780 806) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-12-14 13:53:47,030 INFO L895 garLoopResultBuilder]: At program point $Ultimate##424(lines 788 805) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,031 INFO L895 garLoopResultBuilder]: At program point s_run_returnLabel#1(lines 851 1112) the Hoare annotation is: (let ((.cse7 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (= ~req_tt_a~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse9 (= 2 ~s_run_pc~0)) (.cse8 (not (= ~c_m_lock~0 1))) (.cse12 (not (= ~m_run_st~0 0))) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and .cse7 .cse0 .cse2 .cse3 .cse8 .cse9 (= ~c_empty_req~0 1) .cse5 (= ~c_empty_rsp~0 1) .cse6 .cse10) (and .cse7 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse11 (= ~m_run_pc~0 6))) (or (and .cse0 .cse2 .cse8 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse4 .cse5 .cse11 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))))) (and .cse8 .cse4 .cse12 .cse10) (and (not .cse9) .cse8 .cse12 .cse10))) [2022-12-14 13:53:47,031 INFO L895 garLoopResultBuilder]: At program point $Ultimate##430(lines 796 804) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,031 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2022-12-14 13:53:47,031 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2022-12-14 13:53:47,031 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2022-12-14 13:53:47,031 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2022-12-14 13:53:47,031 INFO L895 garLoopResultBuilder]: At program point L105(lines 105 129) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-12-14 13:53:47,031 INFO L895 garLoopResultBuilder]: At program point $Ultimate##200(lines 364 372) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,031 INFO L895 garLoopResultBuilder]: At program point $Ultimate##442(lines 818 826) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,032 INFO L895 garLoopResultBuilder]: At program point $Ultimate##600(lines 1271 1315) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,032 INFO L895 garLoopResultBuilder]: At program point $Ultimate##606(lines 1279 1314) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,032 INFO L895 garLoopResultBuilder]: At program point $Ultimate##612(lines 1287 1313) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,032 INFO L895 garLoopResultBuilder]: At program point $Ultimate##618(lines 1295 1312) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,032 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2022-12-14 13:53:47,032 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2022-12-14 13:53:47,032 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2022-12-14 13:53:47,033 INFO L895 garLoopResultBuilder]: At program point $Ultimate##624(lines 1303 1311) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,033 INFO L895 garLoopResultBuilder]: At program point m_run_returnLabel#1(lines 85 844) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse7 (= ~m_run_pc~0 6)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse6 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse10 (not (= ~c_empty_req~0 0)) .cse4 .cse5 .cse7 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse8) (and .cse1 (= ~c_req_type~0 1) .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6 .cse8 .cse9))) [2022-12-14 13:53:47,033 INFO L895 garLoopResultBuilder]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-12-14 13:53:47,033 INFO L895 garLoopResultBuilder]: At program point L108(lines 108 128) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-12-14 13:53:47,033 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2022-12-14 13:53:47,033 INFO L895 garLoopResultBuilder]: At program point $Ultimate##636(lines 1325 1333) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse11 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8) (and .cse10 .cse0 .cse3 .cse11 .cse4 .cse6 .cse9 .cse12 .cse8 .cse13) (and .cse14 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse10 .cse1 .cse11 .cse4 (or (and .cse0 .cse3 .cse14 .cse5 .cse6 .cse12 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse12 .cse8 .cse13))))) [2022-12-14 13:53:47,033 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-12-14 13:53:47,033 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2022-12-14 13:53:47,033 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) .cse4 (= ~c_empty_rsp~0 1) .cse5) (and .cse0 .cse1 .cse2 .cse3 (not (= ~c_empty_req~0 0)) .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) .cse5))) [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L895 garLoopResultBuilder]: At program point L111(lines 111 127) the Hoare annotation is: (let ((.cse4 (= ~c_empty_rsp~0 1)) (.cse8 (= ~c_req_type~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (not (= ~m_run_st~0 0))) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse1 .cse8 .cse2 .cse10 .cse3 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7))) [2022-12-14 13:53:47,034 INFO L895 garLoopResultBuilder]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse2 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse0 (not (= ~c_m_lock~0 1))) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse1 .cse2 (= ~c_req_type~0 1) .cse3 .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and (= ~c_req_type~0 0) .cse2 (let ((.cse7 (= ~m_run_pc~0 6))) (or (and .cse1 .cse0 .cse4 .cse5 .cse7 .cse6) (and .cse1 .cse4 .cse5 .cse7 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3))) [2022-12-14 13:53:47,034 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2022-12-14 13:53:47,034 INFO L895 garLoopResultBuilder]: At program point L114(lines 114 126) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L895 garLoopResultBuilder]: At program point L117(lines 117 125) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L895 garLoopResultBuilder]: At program point L317(lines 287 318) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 124) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (not (= ~m_run_st~0 0))) (.cse5 (= ~m_run_pc~0 6)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_empty_rsp~0 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 .cse4 .cse5 .cse6))) [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-12-14 13:53:47,035 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L895 garLoopResultBuilder]: At program point $Ultimate##299(lines 572 616) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L895 garLoopResultBuilder]: At program point $Ultimate##494(lines 935 961) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,036 INFO L895 garLoopResultBuilder]: At program point $Ultimate##251(lines 446 454) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2022-12-14 13:53:47,036 INFO L895 garLoopResultBuilder]: At program point L524(lines 494 525) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,036 INFO L895 garLoopResultBuilder]: At program point $Ultimate##263(lines 468 476) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L895 garLoopResultBuilder]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8))) [2022-12-14 13:53:47,037 INFO L895 garLoopResultBuilder]: At program point $Ultimate##212(lines 386 394) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,037 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L895 garLoopResultBuilder]: At program point $Ultimate##227(lines 414 458) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2022-12-14 13:53:47,037 INFO L895 garLoopResultBuilder]: At program point $Ultimate##233(lines 422 457) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L895 garLoopResultBuilder]: At program point $Ultimate##239(lines 430 456) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L895 garLoopResultBuilder]: At program point $Ultimate##482(lines 919 963) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,038 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse4 (<= 0 ~a_t~0)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (and .cse7 .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse7 .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 (= ~a_t~0 0) .cse9 .cse10))) [2022-12-14 13:53:47,038 INFO L895 garLoopResultBuilder]: At program point $Ultimate##488(lines 927 962) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,038 INFO L895 garLoopResultBuilder]: At program point $Ultimate##245(lines 438 455) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2022-12-14 13:53:47,038 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point L69-1(lines 66 69) the Hoare annotation is: (let ((.cse0 (not (= ~c_m_lock~0 1))) (.cse1 (not (= ~c_empty_req~0 0)))) (or (and .cse0 .cse1 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and (= ~c_req_type~0 0) (let ((.cse2 (<= 2 ~c_write_req_ev~0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0))) (or (and .cse2 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and .cse2 .cse0 .cse1 .cse3 .cse4 .cse5))) (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)))) [2022-12-14 13:53:47,039 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2022-12-14 13:53:47,039 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2022-12-14 13:53:47,039 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point $Ultimate##305(lines 580 615) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,039 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point $Ultimate##550(lines 1041 1085) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point $Ultimate##311(lines 588 614) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 3)) (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point $Ultimate##317(lines 596 613) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (let ((.cse0 (= ~c_empty_rsp~0 1))) (or (and .cse0 (= ~m_run_pc~0 3)) (and .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,039 INFO L895 garLoopResultBuilder]: At program point L864(lines 864 872) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse12 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse11 (not (= ~c_m_lock~0 1))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse14 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse1 .cse3 .cse10 .cse4 .cse11 .cse6 .cse12 .cse13 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse12 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse10 .cse4 .cse6 .cse12 .cse13 .cse8 .cse14) (and .cse11 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse9 .cse1 .cse10 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse6 .cse13 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse13 .cse8 .cse14))))) [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point $Ultimate##556(lines 1049 1084) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,040 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point $Ultimate##562(lines 1057 1083) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point $Ultimate##323(lines 604 612) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point L667(lines 637 668) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,040 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2022-12-14 13:53:47,040 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point $Ultimate##500(lines 943 960) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point L867(lines 867 871) the Hoare annotation is: (let ((.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (= ~req_tt_a~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0)) (.cse6 (not (= ~c_m_lock~0 1)))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and (= ~c_req_type~0 0) .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse7 (= ~m_run_pc~0 6))) (or (and .cse0 .cse2 .cse6 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse4 .cse7 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))))) (and .cse6 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) [2022-12-14 13:53:47,040 INFO L895 garLoopResultBuilder]: At program point $Ultimate##506(lines 951 959) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,040 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L895 garLoopResultBuilder]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (not (= ~m_run_st~0 0))) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= 2 ~s_run_pc~0) .cse4 (<= 0 ~a_t~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L895 garLoopResultBuilder]: At program point $Ultimate##518(lines 973 981) the Hoare annotation is: (let ((.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0))) (or (and .cse0 .cse1 (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 (= ~m_run_pc~0 3) .cse5) (and .cse6 .cse0 .cse7 .cse2 .cse3 .cse4 .cse8 .cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse9) (and .cse10 .cse3 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse6 .cse0 .cse1 .cse7 .cse2 .cse10 .cse3 .cse4 .cse8 .cse5 .cse9))) [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2022-12-14 13:53:47,041 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse9 (= ~c_empty_rsp~0 1)) (.cse13 (= ~c_req_type~0 0)) (.cse14 (= ~m_run_pc~0 6)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~m_run_st~0 0))) (.cse12 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse10 .cse4 .cse11 .cse12) (and .cse13 .cse1 (or (and .cse8 .cse0 .cse5 .cse9 .cse14 .cse7 .cse15) (and .cse8 .cse0 .cse10 .cse5 .cse9 .cse14 .cse7)) .cse16 .cse3) (and .cse13 (or (and .cse0 .cse4 .cse5 .cse14 .cse7 .cse15) (and .cse0 .cse10 .cse4 .cse5 .cse14 .cse7)) .cse1 .cse16 .cse3 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse13 .cse1 (or (and .cse8 .cse0 .cse10 .cse4 .cse5 .cse14 .cse7) (and .cse8 .cse0 .cse4 .cse5 .cse14 .cse7 .cse15)) .cse16 .cse3) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse10 .cse11 .cse12))) [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-12-14 13:53:47,042 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (not (= ~m_run_st~0 0))) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (= ~s_run_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-12-14 13:53:47,043 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2022-12-14 13:53:47,043 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 74 82) the Hoare annotation is: (let ((.cse0 (not (= ~c_empty_req~0 0)))) (or (and (<= 2 ~c_write_req_ev~0) (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (= ~c_req_type~0 1) (= |ULTIMATE.start_s_run_~req_type~1#1| 1) (= ~req_tt_a~0 0) .cse0 (= 2 ~c_write_rsp_ev~0) (= ~m_run_pc~0 3) (= ~a_t~0 0)) (and (not (= ~c_m_lock~0 1)) .cse0 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)))) [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-12-14 13:53:47,043 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse5 (= ~c_empty_rsp~0 1)) (.cse13 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (= ~c_req_type~0 0)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse14 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse12 (not (= ~m_run_st~0 0)) .cse13) (and .cse8 .cse0 (= ~s_run_pc~0 0) .cse3 .cse12 (= ~c_empty_req~0 1) .cse4 .cse5 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7) (and .cse8 (or (and .cse0 .cse14 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse12 .cse14 .cse4 .cse10 .cse7)) .cse1 .cse9 .cse3))) [2022-12-14 13:53:47,044 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse11 (= ~m_run_pc~0 3)) (.cse0 (= ~c_req_type~0 0)) (.cse13 (not (= 2 ~s_run_pc~0))) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~req_tt_a~0 0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0)) (.cse12 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4 .cse5)) .cse8 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse2 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse3 .cse11 .cse5) (and .cse7 (not (= ~m_run_st~0 0)) .cse12) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse13 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6))) (and .cse13 .cse2 .cse1 .cse10 .cse9 .cse3 .cse11 .cse5) (and .cse0 .cse13 .cse2 (not (= ~s_run_st~0 0)) .cse9 .cse7 (= ~c_empty_req~0 1) .cse3 (= ~c_empty_rsp~0 1) .cse5 .cse12))) [2022-12-14 13:53:47,044 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2022-12-14 13:53:47,044 INFO L895 garLoopResultBuilder]: At program point L481(lines 133 482) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 1167 1350) the Hoare annotation is: true [2022-12-14 13:53:47,045 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse3 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse7 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~req_tt_a~0 0)) (.cse0 (not (= ~c_m_lock~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~a_t~0 0)) (.cse1 (= ~m_run_pc~0 0))) (or (and .cse0 (not (= ~m_run_st~0 0)) .cse1) (and .cse2 .cse3 (= ~c_req_type~0 1) .cse4 .cse5 (= ~m_run_pc~0 3) .cse6) (and .cse7 .cse3 (let ((.cse8 (= ~m_run_pc~0 6))) (or (and .cse2 .cse5 .cse8 .cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and .cse2 .cse0 .cse5 .cse8 .cse6))) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse4) (and .cse7 .cse2 (not (= ~s_run_st~0 0)) .cse4 .cse0 (= ~c_empty_req~0 1) .cse5 (= ~c_empty_rsp~0 1) .cse6 .cse1))) [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2022-12-14 13:53:47,045 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse13 (= ~c_empty_req~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse2 (= ~c_req_type~0 1)) (.cse6 (= ~m_run_pc~0 3)) (.cse8 (= ~c_req_type~0 0)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~c_m_lock~0 1))) (.cse15 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse3 .cse4 .cse5 .cse10 .cse7 .cse11) (and .cse8 .cse0 (not (= ~s_run_st~0 0)) .cse3 .cse12 (= 2 ~s_run_pc~0) .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse12 (not (= ~m_run_st~0 0)) .cse14) (and .cse8 .cse0 (= ~s_run_pc~0 0) .cse3 .cse12 .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7) (and .cse8 (or (and .cse0 .cse15 .cse4 .cse10 .cse7 .cse11) (and .cse0 .cse12 .cse15 .cse4 .cse10 .cse7)) .cse1 .cse9 .cse3))) [2022-12-14 13:53:47,046 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2022-12-14 13:53:47,046 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2022-12-14 13:53:47,046 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_m_lock~0 1))) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1))) (or (and (= ~c_req_type~0 0) .cse0 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_run_pc~0 6) (<= 1 |ULTIMATE.start_m_run_~a~0#1|) (= ~a_t~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~a_t~0) .cse4 .cse5 (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)))) [2022-12-14 13:53:47,046 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(lines 332 376) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,046 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2022-12-14 13:53:47,046 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse4 (= ~a_t~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 0)) .cse3 (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= ~c_empty_req~0 1)) (= 2 ~s_run_pc~0) (<= 0 ~a_t~0) .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse4 .cse5))) [2022-12-14 13:53:47,046 INFO L895 garLoopResultBuilder]: At program point $Ultimate##182(lines 340 375) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,046 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2022-12-14 13:53:47,046 INFO L895 garLoopResultBuilder]: At program point $Ultimate##188(lines 348 374) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L895 garLoopResultBuilder]: At program point $Ultimate##50(lines 1244 1252) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L895 garLoopResultBuilder]: At program point $Ultimate##194(lines 356 373) the Hoare annotation is: (and (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (not (= ~m_run_st~0 0)) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-12-14 13:53:47,047 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-12-14 13:53:47,048 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##38(lines 1222 1230) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 1214 1231) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##132(lines 238 264) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 (or (and .cse5 (= ~m_run_pc~0 3)) (and .cse5 .cse6 .cse8)) .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse7))) [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##373(lines 706 723) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##379(lines 714 722) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,048 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-12-14 13:53:47,048 INFO L895 garLoopResultBuilder]: At program point $Ultimate##138(lines 246 263) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse8 (= ~m_run_pc~0 0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 (or (and .cse5 (= ~m_run_pc~0 3)) (and .cse5 .cse6 .cse8)) .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse7))) [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point $Ultimate##26(lines 1206 1232) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point L557(lines 527 558) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point $Ultimate##144(lines 254 262) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6) (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 (= ~m_run_pc~0 0)))) [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point $Ultimate##20(lines 1198 1233) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,049 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point $Ultimate##391(lines 736 744) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,049 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 13:53:47,049 INFO L895 garLoopResultBuilder]: At program point $Ultimate##14(lines 1190 1234) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) (= ~c_empty_req~0 1) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~a_t~0 0) (= ~m_run_pc~0 ~c_m_lock~0) (= ~m_run_pc~0 0) (= ~m_run_pc~0 ~s_run_pc~0)) [2022-12-14 13:53:47,050 INFO L895 garLoopResultBuilder]: At program point $Ultimate##156(lines 276 284) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6) (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 (= ~a_t~0 0) .cse6 (= ~m_run_pc~0 0)))) [2022-12-14 13:53:47,050 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2022-12-14 13:53:47,050 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-12-14 13:53:47,050 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2022-12-14 13:53:47,050 INFO L895 garLoopResultBuilder]: At program point $Ultimate##568(lines 1065 1082) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,050 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 1113 1166) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse12 (= ~c_req_type~0 0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse4 (= ~req_tt_a~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse3 (not (= ~s_run_st~0 0))) (.cse10 (not (= ~c_m_lock~0 1))) (.cse11 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse8 (not (= ~m_run_st~0 0))) (.cse14 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse8 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse9) (and .cse12 .cse0 .cse3 .cse13 .cse4 .cse5 .cse6 .cse8 .cse14 .cse9 .cse15) (and .cse12 .cse1 .cse13 .cse4 (or (and .cse0 .cse3 .cse11 .cse5 .cse8 .cse14 .cse9 .cse15) (and .cse0 .cse3 .cse10 .cse11 .cse5 .cse8 .cse14 .cse9))))) [2022-12-14 13:53:47,050 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2022-12-14 13:53:47,050 INFO L895 garLoopResultBuilder]: At program point $Ultimate##335(lines 626 634) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 1)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,051 INFO L895 garLoopResultBuilder]: At program point $Ultimate##574(lines 1073 1081) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,051 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) (<= 0 ~a_t~0) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (= ~m_run_pc~0 3) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,051 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2022-12-14 13:53:47,051 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2022-12-14 13:53:47,051 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2022-12-14 13:53:47,051 INFO L895 garLoopResultBuilder]: At program point $Ultimate##586(lines 1095 1103) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse5 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse2 (not (= 2 ~s_run_pc~0))) (.cse3 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse5 .cse6 .cse7)) .cse8 .cse9) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse3 .cse4 .cse5 .cse6) (and .cse3 .cse5 .cse6 .cse7)) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse2 .cse3 .cse1 .cse10 .cse9 .cse11 .cse6) (and .cse3 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse11 .cse6))) [2022-12-14 13:53:47,051 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2022-12-14 13:53:47,051 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point $Ultimate##355(lines 682 726) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,052 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point $Ultimate##120(lines 222 266) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point $Ultimate##361(lines 690 725) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point $Ultimate##126(lines 230 265) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 1)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (not (= ~m_run_st~0 0))) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse8 (= ~m_run_pc~0 0))) (or (and .cse0 (= ~s_run_pc~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~a_t~0 0) .cse7 .cse8) (and .cse0 .cse1 .cse2 (= 2 ~s_run_pc~0) .cse3 (<= 0 ~a_t~0) .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point $Ultimate##367(lines 698 724) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (not (= ~c_empty_req~0 0)) (= 2 ~c_write_rsp_ev~0) (= ~c_empty_rsp~0 1) (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 6) (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0)) [2022-12-14 13:53:47,052 INFO L895 garLoopResultBuilder]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse4 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse12 (not (= 2 ~s_run_pc~0))) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse7 .cse3 .cse4 .cse5)) .cse8 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse2 .cse1 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse9 .cse3 .cse11 .cse5) (and .cse7 (not (= ~m_run_st~0 0)) (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse8 .cse9 (or (and .cse12 .cse2 .cse7 .cse3 .cse4 .cse5) (and .cse12 .cse2 .cse3 .cse4 .cse5 .cse6))) (and .cse12 .cse2 .cse1 .cse10 .cse9 .cse3 .cse11 .cse5))) [2022-12-14 13:53:47,052 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-12-14 13:53:47,053 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2022-12-14 13:53:47,055 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:53:47,057 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:53:47,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:53:47 BoogieIcfgContainer [2022-12-14 13:53:47,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:53:47,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:53:47,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:53:47,118 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:53:47,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:51:35" (3/4) ... [2022-12-14 13:53:47,121 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 13:53:47,126 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-14 13:53:47,144 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2022-12-14 13:53:47,146 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-12-14 13:53:47,148 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 13:53:47,150 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 13:53:47,238 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:53:47,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:53:47,239 INFO L158 Benchmark]: Toolchain (without parser) took 133079.27ms. Allocated memory was 123.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 83.3MB in the beginning and 709.8MB in the end (delta: -626.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-14 13:53:47,239 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 123.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:53:47,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 62.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 13:53:47,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.04ms. Allocated memory is still 123.7MB. Free memory was 62.3MB in the beginning and 59.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 13:53:47,240 INFO L158 Benchmark]: Boogie Preprocessor took 29.16ms. Allocated memory is still 123.7MB. Free memory was 59.0MB in the beginning and 55.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:53:47,240 INFO L158 Benchmark]: RCFGBuilder took 734.05ms. Allocated memory is still 123.7MB. Free memory was 55.7MB in the beginning and 41.7MB in the end (delta: 14.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2022-12-14 13:53:47,240 INFO L158 Benchmark]: TraceAbstraction took 131779.82ms. Allocated memory was 123.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 41.4MB in the beginning and 722.6MB in the end (delta: -681.2MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-14 13:53:47,241 INFO L158 Benchmark]: Witness Printer took 120.25ms. Allocated memory is still 1.9GB. Free memory was 722.6MB in the beginning and 709.8MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 13:53:47,242 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.17ms. Allocated memory is still 123.7MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.41ms. Allocated memory is still 123.7MB. Free memory was 83.0MB in the beginning and 62.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.04ms. Allocated memory is still 123.7MB. Free memory was 62.3MB in the beginning and 59.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.16ms. Allocated memory is still 123.7MB. Free memory was 59.0MB in the beginning and 55.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 734.05ms. Allocated memory is still 123.7MB. Free memory was 55.7MB in the beginning and 41.7MB in the end (delta: 14.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * TraceAbstraction took 131779.82ms. Allocated memory was 123.7MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 41.4MB in the beginning and 722.6MB in the end (delta: -681.2MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 120.25ms. Allocated memory is still 1.9GB. Free memory was 722.6MB in the beginning and 709.8MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. 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: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 239 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 131.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 109.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9670 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9670 mSDsluCounter, 17490 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9259 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4596 IncrementalHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 8231 mSDtfsCounter, 4596 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 652 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13656occurred in iteration=16, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 29982 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 103 LocationsWithAnnotation, 117 PreInvPairs, 1140 NumberOfFragments, 7912 HoareAnnotationTreeSize, 117 FomulaSimplifications, 1038012 FormulaSimplificationTreeSizeReduction, 69.4s HoareSimplificationTime, 103 FomulaSimplificationsInter, 1685769 FormulaSimplificationTreeSizeReductionInter, 40.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2789 NumberOfCodeBlocks, 2789 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2763 ConstructedInterpolants, 0 QuantifiedInterpolants, 5086 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 609/625 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 8 specifications checked. All of them hold - InvariantResult [Line: 1065]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 364]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= a) && a_t == 0) || ((((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 626]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1095]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 818]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 851]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || (((!(2 == s_run_pc) && !(c_m_lock == 1)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && 0 <= a) && ((((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((2 <= c_write_req_ev && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) || ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 973]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 1073]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 1 <= a - InvariantResult [Line: 935]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 1287]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 494]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1206]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 1214]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && m_run_pc == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 604]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0 - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((c_req_type == 1 && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0) || ((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0)) || ((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 714]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1222]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 1 <= a) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0 - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1279]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 446]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && 1 <= a) && a_t == 0)) || ((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 1113]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1198]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 580]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && c_req_type == 0) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 1303]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1271]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 0 <= a) && (((((2 <= c_write_req_ev && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0))) && req_a___0 == 0) && req_tt_a == 0)) || (((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0)) || ((((c_req_type == 0 && 0 <= a) && (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0)) || ((((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || (((!(2 == s_run_pc) && !(c_m_lock == 1)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 796]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 468]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && (((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || ((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((2 <= c_write_req_ev && !(c_m_lock == 1)) && m_run_pc == 6) && a_t == 0) || (((2 <= c_write_req_ev && m_run_pc == 6) && a_t == 0) && a == 0))) && req_type == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0)))) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 736]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0 - InvariantResult [Line: 864]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0)) || ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) - InvariantResult [Line: 1295]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && !(m_run_st == 0)) && m_run_pc == 6) && a_t == 0))) - InvariantResult [Line: 1190]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && !(m_run_st == 0)) && a_t == 0) && a == 0 - InvariantResult [Line: 1325]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((c_req_type == 1 && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 951]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && req_type == 0) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 1 && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 1 && s_run_pc == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((2 <= c_write_req_ev && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && req_type == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && !(m_run_st == 0)) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((!(c_m_lock == 1) && !(c_empty_req == 0)) && !(m_run_st == 0)) && m_run_pc == 0) || (((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && req_type == 0) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) || ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || ((!(c_m_lock == 1) && !(m_run_st == 0)) && m_run_pc == 0)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && s_run_pc == 0) && req_tt_a == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || (((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((c_req_type == 0 && ((((((2 <= c_write_req_ev && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0))) && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) - InvariantResult [Line: 1244]: Loop Invariant Derived loop invariant: ((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 0)) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a == 0 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: (((((((req_type___0 == 0 && c_req_type == 0) && ((c_empty_rsp == 1 && m_run_pc == 3) || ((c_empty_rsp == 1 && !(m_run_st == 0)) && m_run_pc == 0))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0 RESULT: Ultimate proved your program to be correct! [2022-12-14 13:53:47,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_33ed5921-9cb8-4051-8205-fc5905e407b2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE