./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 6b4ec56b 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_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN --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 Automizer --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-6b4ec56 [2022-11-20 12:40:28,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:40:28,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:40:28,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:40:28,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:40:28,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:40:28,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:40:28,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:40:28,428 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:40:28,429 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:40:28,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:40:28,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:40:28,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:40:28,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:40:28,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:40:28,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:40:28,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:40:28,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:40:28,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:40:28,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:40:28,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:40:28,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:40:28,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:40:28,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:40:28,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:40:28,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:40:28,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:40:28,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:40:28,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:40:28,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:40:28,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:40:28,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:40:28,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:40:28,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:40:28,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:40:28,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:40:28,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:40:28,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:40:28,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:40:28,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:40:28,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:40:28,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-11-20 12:40:28,495 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:40:28,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:40:28,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:40:28,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:40:28,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:40:28,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:40:28,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:40:28,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:40:28,499 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:40:28,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:40:28,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:40:28,499 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:40:28,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:40:28,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:40:28,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:40:28,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:40:28,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:40:28,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:40:28,501 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 12:40:28,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:40:28,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:40:28,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:40:28,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:40:28,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:40:28,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:40:28,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:40:28,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:28,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:40:28,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:40:28,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:40:28,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:40:28,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:40:28,505 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:40:28,505 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:40:28,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:40:28,506 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_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/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_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN 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 -> Automizer 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-11-20 12:40:28,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:40:28,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:40:28,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:40:28,870 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:40:28,871 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:40:28,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-20 12:40:31,954 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:40:32,312 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:40:32,323 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-11-20 12:40:32,339 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/data/26134e34b/d3ce58e60efd45cfb5f2a0896a65d9f1/FLAG5582aba45 [2022-11-20 12:40:32,358 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/data/26134e34b/d3ce58e60efd45cfb5f2a0896a65d9f1 [2022-11-20 12:40:32,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:40:32,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:40:32,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:32,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:40:32,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:40:32,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1afeb42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32, skipping insertion in model container [2022-11-20 12:40:32,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:40:32,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:40:32,600 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_6ba99da4-823a-4c56-ad44-342e007a528d/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-20 12:40:32,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:32,786 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:40:32,797 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_6ba99da4-823a-4c56-ad44-342e007a528d/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-11-20 12:40:32,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:40:32,878 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:40:32,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32 WrapperNode [2022-11-20 12:40:32,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:40:32,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:32,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:40:32,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:40:32,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,949 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 854 [2022-11-20 12:40:32,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:40:32,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:40:32,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:40:32,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:40:32,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:32,999 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:33,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:33,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:40:33,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:40:33,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:40:33,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:40:33,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (1/1) ... [2022-11-20 12:40:33,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:40:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:33,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:40:33,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:40:33,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:40:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:40:33,129 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-11-20 12:40:33,129 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-11-20 12:40:33,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:40:33,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:40:33,229 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:40:33,232 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:40:34,139 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:40:34,149 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:40:34,149 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-11-20 12:40:34,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:34 BoogieIcfgContainer [2022-11-20 12:40:34,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:40:34,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:40:34,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:40:34,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:40:34,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:40:32" (1/3) ... [2022-11-20 12:40:34,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d08f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:34, skipping insertion in model container [2022-11-20 12:40:34,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:40:32" (2/3) ... [2022-11-20 12:40:34,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d08f407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:40:34, skipping insertion in model container [2022-11-20 12:40:34,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:34" (3/3) ... [2022-11-20 12:40:34,161 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-11-20 12:40:34,181 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:40:34,181 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-20 12:40:34,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:40:34,328 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=PETRI_NET, 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;@150ce3f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:40:34,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-20 12:40:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 270 states have (on average 1.8555555555555556) internal successors, (501), 283 states have internal predecessors, (501), 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-11-20 12:40:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 12:40:34,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:34,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:34,344 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-11-20 12:40:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1773166344, now seen corresponding path program 1 times [2022-11-20 12:40:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:34,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546834501] [2022-11-20 12:40:34,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:34,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:34,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:34,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546834501] [2022-11-20 12:40:34,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546834501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:34,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:34,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737363859] [2022-11-20 12:40:34,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:34,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:34,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:34,755 INFO L87 Difference]: Start difference. First operand has 285 states, 270 states have (on average 1.8555555555555556) internal successors, (501), 283 states have internal predecessors, (501), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:35,346 INFO L93 Difference]: Finished difference Result 754 states and 1347 transitions. [2022-11-20 12:40:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 12:40:35,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:35,376 INFO L225 Difference]: With dead ends: 754 [2022-11-20 12:40:35,377 INFO L226 Difference]: Without dead ends: 454 [2022-11-20 12:40:35,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:35,391 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 269 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:35,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 793 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 12:40:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-20 12:40:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-11-20 12:40:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 1.5856481481481481) internal successors, (685), 439 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 685 transitions. [2022-11-20 12:40:35,476 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 685 transitions. Word has length 20 [2022-11-20 12:40:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:35,476 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 685 transitions. [2022-11-20 12:40:35,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 685 transitions. [2022-11-20 12:40:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 12:40:35,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:35,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:35,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:40:35,479 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-11-20 12:40:35,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:35,480 INFO L85 PathProgramCache]: Analyzing trace with hash 282207273, now seen corresponding path program 1 times [2022-11-20 12:40:35,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:35,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184889086] [2022-11-20 12:40:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:35,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:35,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184889086] [2022-11-20 12:40:35,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184889086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:35,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:40:35,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921340842] [2022-11-20 12:40:35,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:35,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:35,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:35,563 INFO L87 Difference]: Start difference. First operand 440 states and 685 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:35,678 INFO L93 Difference]: Finished difference Result 1201 states and 1897 transitions. [2022-11-20 12:40:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:35,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-20 12:40:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:35,685 INFO L225 Difference]: With dead ends: 1201 [2022-11-20 12:40:35,685 INFO L226 Difference]: Without dead ends: 775 [2022-11-20 12:40:35,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:35,694 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 390 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:35,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-11-20 12:40:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 682. [2022-11-20 12:40:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 674 states have (on average 1.5771513353115727) internal successors, (1063), 681 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1063 transitions. [2022-11-20 12:40:35,793 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1063 transitions. Word has length 24 [2022-11-20 12:40:35,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:35,793 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 1063 transitions. [2022-11-20 12:40:35,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:35,794 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1063 transitions. [2022-11-20 12:40:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 12:40:35,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:35,799 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, 1, 1, 1, 1] [2022-11-20 12:40:35,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:40:35,800 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-11-20 12:40:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1461842607, now seen corresponding path program 1 times [2022-11-20 12:40:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524558028] [2022-11-20 12:40:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:35,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:36,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524558028] [2022-11-20 12:40:36,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524558028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:36,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:36,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:40:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503096279] [2022-11-20 12:40:36,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:36,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:36,010 INFO L87 Difference]: Start difference. First operand 682 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:36,379 INFO L93 Difference]: Finished difference Result 1632 states and 2556 transitions. [2022-11-20 12:40:36,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:40:36,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2022-11-20 12:40:36,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:36,384 INFO L225 Difference]: With dead ends: 1632 [2022-11-20 12:40:36,384 INFO L226 Difference]: Without dead ends: 964 [2022-11-20 12:40:36,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:36,387 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 616 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:36,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1491 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:40:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-11-20 12:40:36,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 848. [2022-11-20 12:40:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 840 states have (on average 1.5833333333333333) internal successors, (1330), 847 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1330 transitions. [2022-11-20 12:40:36,431 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1330 transitions. Word has length 55 [2022-11-20 12:40:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:36,432 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1330 transitions. [2022-11-20 12:40:36,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1330 transitions. [2022-11-20 12:40:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 12:40:36,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:36,435 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:36,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:40:36,436 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-11-20 12:40:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash 264726864, now seen corresponding path program 1 times [2022-11-20 12:40:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667228975] [2022-11-20 12:40:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:36,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:36,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667228975] [2022-11-20 12:40:36,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667228975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:36,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:36,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:40:36,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946503779] [2022-11-20 12:40:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:36,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:36,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:36,625 INFO L87 Difference]: Start difference. First operand 848 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:36,993 INFO L93 Difference]: Finished difference Result 2112 states and 3294 transitions. [2022-11-20 12:40:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:40:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2022-11-20 12:40:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:36,999 INFO L225 Difference]: With dead ends: 2112 [2022-11-20 12:40:37,000 INFO L226 Difference]: Without dead ends: 1278 [2022-11-20 12:40:37,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:37,012 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 429 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:37,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1535 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:40:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-11-20 12:40:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2022-11-20 12:40:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1183 states have (on average 1.5672020287404902) internal successors, (1854), 1190 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1854 transitions. [2022-11-20 12:40:37,086 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1854 transitions. Word has length 58 [2022-11-20 12:40:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:37,087 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1854 transitions. [2022-11-20 12:40:37,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1854 transitions. [2022-11-20 12:40:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 12:40:37,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:37,092 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:40:37,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:40:37,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 12:40:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 93056873, now seen corresponding path program 1 times [2022-11-20 12:40:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:37,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347073644] [2022-11-20 12:40:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:37,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:37,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347073644] [2022-11-20 12:40:37,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347073644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:37,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:40:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582905245] [2022-11-20 12:40:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:37,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:37,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:37,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:37,242 INFO L87 Difference]: Start difference. First operand 1191 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:37,782 INFO L93 Difference]: Finished difference Result 3750 states and 5723 transitions. [2022-11-20 12:40:37,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:40:37,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2022-11-20 12:40:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:37,793 INFO L225 Difference]: With dead ends: 3750 [2022-11-20 12:40:37,793 INFO L226 Difference]: Without dead ends: 2570 [2022-11-20 12:40:37,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:37,796 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 685 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:37,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1079 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:40:37,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-11-20 12:40:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2224. [2022-11-20 12:40:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2216 states have (on average 1.5374548736462095) internal successors, (3407), 2223 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3407 transitions. [2022-11-20 12:40:37,958 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3407 transitions. Word has length 69 [2022-11-20 12:40:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:37,959 INFO L495 AbstractCegarLoop]: Abstraction has 2224 states and 3407 transitions. [2022-11-20 12:40:37,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:37,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3407 transitions. [2022-11-20 12:40:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-20 12:40:37,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:37,963 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:40:37,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 12:40:37,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 12:40:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 848997769, now seen corresponding path program 1 times [2022-11-20 12:40:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:37,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896323527] [2022-11-20 12:40:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:38,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:38,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896323527] [2022-11-20 12:40:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896323527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:38,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275471644] [2022-11-20 12:40:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:38,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:38,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:38,088 INFO L87 Difference]: Start difference. First operand 2224 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:38,282 INFO L93 Difference]: Finished difference Result 4678 states and 7256 transitions. [2022-11-20 12:40:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2022-11-20 12:40:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:38,293 INFO L225 Difference]: With dead ends: 4678 [2022-11-20 12:40:38,293 INFO L226 Difference]: Without dead ends: 2467 [2022-11-20 12:40:38,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:38,298 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 362 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:38,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 694 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2022-11-20 12:40:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2260. [2022-11-20 12:40:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2252 states have (on average 1.5697158081705151) internal successors, (3535), 2259 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:38,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3535 transitions. [2022-11-20 12:40:38,495 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3535 transitions. Word has length 69 [2022-11-20 12:40:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:38,496 INFO L495 AbstractCegarLoop]: Abstraction has 2260 states and 3535 transitions. [2022-11-20 12:40:38,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3535 transitions. [2022-11-20 12:40:38,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-20 12:40:38,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:38,500 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:40:38,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 12:40:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1060133084, now seen corresponding path program 1 times [2022-11-20 12:40:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:38,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164180855] [2022-11-20 12:40:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164180855] [2022-11-20 12:40:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164180855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:38,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:38,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921236771] [2022-11-20 12:40:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:38,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:38,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:38,588 INFO L87 Difference]: Start difference. First operand 2260 states and 3535 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:38,820 INFO L93 Difference]: Finished difference Result 4815 states and 7522 transitions. [2022-11-20 12:40:38,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:38,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2022-11-20 12:40:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:38,832 INFO L225 Difference]: With dead ends: 4815 [2022-11-20 12:40:38,833 INFO L226 Difference]: Without dead ends: 2567 [2022-11-20 12:40:38,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:38,838 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 193 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:38,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 823 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-11-20 12:40:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2022-11-20 12:40:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2545 states have (on average 1.5618860510805501) internal successors, (3975), 2552 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3975 transitions. [2022-11-20 12:40:39,032 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3975 transitions. Word has length 87 [2022-11-20 12:40:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:39,032 INFO L495 AbstractCegarLoop]: Abstraction has 2553 states and 3975 transitions. [2022-11-20 12:40:39,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3975 transitions. [2022-11-20 12:40:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-20 12:40:39,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:39,042 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-11-20 12:40:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 12:40:39,043 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-11-20 12:40:39,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 809233504, now seen corresponding path program 1 times [2022-11-20 12:40:39,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:39,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606275993] [2022-11-20 12:40:39,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:39,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606275993] [2022-11-20 12:40:39,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606275993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:39,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:39,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793413343] [2022-11-20 12:40:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:39,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:39,110 INFO L87 Difference]: Start difference. First operand 2553 states and 3975 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-11-20 12:40:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:39,595 INFO L93 Difference]: Finished difference Result 5993 states and 9430 transitions. [2022-11-20 12:40:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:39,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-11-20 12:40:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:39,609 INFO L225 Difference]: With dead ends: 5993 [2022-11-20 12:40:39,609 INFO L226 Difference]: Without dead ends: 3616 [2022-11-20 12:40:39,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:39,616 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:39,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 868 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:40:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2022-11-20 12:40:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2983. [2022-11-20 12:40:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2975 states have (on average 1.4857142857142858) internal successors, (4420), 2982 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4420 transitions. [2022-11-20 12:40:39,809 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4420 transitions. Word has length 96 [2022-11-20 12:40:39,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:39,811 INFO L495 AbstractCegarLoop]: Abstraction has 2983 states and 4420 transitions. [2022-11-20 12:40:39,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-11-20 12:40:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4420 transitions. [2022-11-20 12:40:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-20 12:40:39,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:39,815 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:39,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 12:40:39,815 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-11-20 12:40:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1044800824, now seen corresponding path program 1 times [2022-11-20 12:40:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:39,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768801853] [2022-11-20 12:40:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:40:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768801853] [2022-11-20 12:40:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768801853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:39,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:39,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:40:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299811280] [2022-11-20 12:40:39,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:39,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:39,923 INFO L87 Difference]: Start difference. First operand 2983 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:40,373 INFO L93 Difference]: Finished difference Result 5993 states and 8876 transitions. [2022-11-20 12:40:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:40:40,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 104 [2022-11-20 12:40:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:40,395 INFO L225 Difference]: With dead ends: 5993 [2022-11-20 12:40:40,396 INFO L226 Difference]: Without dead ends: 3227 [2022-11-20 12:40:40,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:40,400 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 615 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:40,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1279 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:40:40,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2022-11-20 12:40:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3152. [2022-11-20 12:40:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4802798982188294) internal successors, (4654), 3151 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4654 transitions. [2022-11-20 12:40:40,585 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4654 transitions. Word has length 104 [2022-11-20 12:40:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:40,585 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4654 transitions. [2022-11-20 12:40:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4654 transitions. [2022-11-20 12:40:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-20 12:40:40,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:40,588 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] [2022-11-20 12:40:40,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 12:40:40,589 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-11-20 12:40:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash -2134366008, now seen corresponding path program 1 times [2022-11-20 12:40:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:40,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526328495] [2022-11-20 12:40:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:40,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526328495] [2022-11-20 12:40:40,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526328495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:40,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:40,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034060798] [2022-11-20 12:40:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:40,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:40,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:40,643 INFO L87 Difference]: Start difference. First operand 3152 states and 4654 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-11-20 12:40:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:40,876 INFO L93 Difference]: Finished difference Result 6118 states and 9062 transitions. [2022-11-20 12:40:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:40,877 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 104 [2022-11-20 12:40:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:40,887 INFO L225 Difference]: With dead ends: 6118 [2022-11-20 12:40:40,888 INFO L226 Difference]: Without dead ends: 3152 [2022-11-20 12:40:40,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:40,893 INFO L413 NwaCegarLoop]: 408 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:40,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 436 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2022-11-20 12:40:41,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2022-11-20 12:40:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4481552162849873) internal successors, (4553), 3151 states have internal predecessors, (4553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4553 transitions. [2022-11-20 12:40:41,165 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4553 transitions. Word has length 104 [2022-11-20 12:40:41,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:41,166 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4553 transitions. [2022-11-20 12:40:41,166 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-11-20 12:40:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4553 transitions. [2022-11-20 12:40:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-20 12:40:41,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:41,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:41,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 12:40:41,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-20 12:40:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:41,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1174128625, now seen corresponding path program 1 times [2022-11-20 12:40:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:41,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923872560] [2022-11-20 12:40:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-20 12:40:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:41,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923872560] [2022-11-20 12:40:41,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923872560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:41,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:41,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506128545] [2022-11-20 12:40:41,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:41,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:41,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:41,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:41,209 INFO L87 Difference]: Start difference. First operand 3152 states and 4553 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-11-20 12:40:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:41,579 INFO L93 Difference]: Finished difference Result 8079 states and 11760 transitions. [2022-11-20 12:40:41,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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 105 [2022-11-20 12:40:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:41,597 INFO L225 Difference]: With dead ends: 8079 [2022-11-20 12:40:41,598 INFO L226 Difference]: Without dead ends: 4939 [2022-11-20 12:40:41,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:41,604 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 314 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:41,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1021 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-11-20 12:40:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4449. [2022-11-20 12:40:41,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4441 states have (on average 1.4550776852060348) internal successors, (6462), 4448 states have internal predecessors, (6462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6462 transitions. [2022-11-20 12:40:41,902 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6462 transitions. Word has length 105 [2022-11-20 12:40:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:41,902 INFO L495 AbstractCegarLoop]: Abstraction has 4449 states and 6462 transitions. [2022-11-20 12:40:41,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 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-11-20 12:40:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6462 transitions. [2022-11-20 12:40:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-20 12:40:41,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:41,906 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:41,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:40:41,906 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-11-20 12:40:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash -352874665, now seen corresponding path program 1 times [2022-11-20 12:40:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:41,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062596181] [2022-11-20 12:40:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-20 12:40:41,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:41,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062596181] [2022-11-20 12:40:41,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062596181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:41,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:41,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:40:41,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458831695] [2022-11-20 12:40:41,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:41,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:41,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:41,988 INFO L87 Difference]: Start difference. First operand 4449 states and 6462 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 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-11-20 12:40:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:42,807 INFO L93 Difference]: Finished difference Result 11981 states and 17278 transitions. [2022-11-20 12:40:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:40:42,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 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-11-20 12:40:42,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:42,827 INFO L225 Difference]: With dead ends: 11981 [2022-11-20 12:40:42,827 INFO L226 Difference]: Without dead ends: 7435 [2022-11-20 12:40:42,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:42,834 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 651 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:42,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1329 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 12:40:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-11-20 12:40:43,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6646. [2022-11-20 12:40:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 6638 states have (on average 1.4344682133172642) internal successors, (9522), 6645 states have internal predecessors, (9522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 9522 transitions. [2022-11-20 12:40:43,312 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 9522 transitions. Word has length 107 [2022-11-20 12:40:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:43,313 INFO L495 AbstractCegarLoop]: Abstraction has 6646 states and 9522 transitions. [2022-11-20 12:40:43,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 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-11-20 12:40:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9522 transitions. [2022-11-20 12:40:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-20 12:40:43,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:43,318 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, 1, 1, 1, 1] [2022-11-20 12:40:43,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 12:40:43,318 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-11-20 12:40:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1728043503, now seen corresponding path program 1 times [2022-11-20 12:40:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:43,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783647080] [2022-11-20 12:40:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:43,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783647080] [2022-11-20 12:40:43,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783647080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:43,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:43,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:40:43,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922701779] [2022-11-20 12:40:43,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:43,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:40:43,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:43,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:40:43,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:43,430 INFO L87 Difference]: Start difference. First operand 6646 states and 9522 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:45,069 INFO L93 Difference]: Finished difference Result 29994 states and 42677 transitions. [2022-11-20 12:40:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:40:45,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-11-20 12:40:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:45,138 INFO L225 Difference]: With dead ends: 29994 [2022-11-20 12:40:45,139 INFO L226 Difference]: Without dead ends: 23682 [2022-11-20 12:40:45,154 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-11-20 12:40:45,155 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 1937 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1937 SdHoareTripleChecker+Valid, 3160 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1937 Valid, 3160 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:45,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2022-11-20 12:40:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 10146. [2022-11-20 12:40:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10146 states, 10138 states have (on average 1.4378575655947918) internal successors, (14577), 10145 states have internal predecessors, (14577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 14577 transitions. [2022-11-20 12:40:46,139 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 14577 transitions. Word has length 113 [2022-11-20 12:40:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:46,139 INFO L495 AbstractCegarLoop]: Abstraction has 10146 states and 14577 transitions. [2022-11-20 12:40:46,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 14577 transitions. [2022-11-20 12:40:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-20 12:40:46,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:46,143 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:46,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 12:40:46,144 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-11-20 12:40:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1864219126, now seen corresponding path program 1 times [2022-11-20 12:40:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:46,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009392] [2022-11-20 12:40:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 12:40:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009392] [2022-11-20 12:40:46,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35009392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:46,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:46,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694416200] [2022-11-20 12:40:46,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:46,196 INFO L87 Difference]: Start difference. First operand 10146 states and 14577 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:46,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:46,900 INFO L93 Difference]: Finished difference Result 20067 states and 28850 transitions. [2022-11-20 12:40:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 115 [2022-11-20 12:40:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:46,922 INFO L225 Difference]: With dead ends: 20067 [2022-11-20 12:40:46,923 INFO L226 Difference]: Without dead ends: 10005 [2022-11-20 12:40:46,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:40:46,934 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 348 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:46,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 835 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10005 states. [2022-11-20 12:40:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10005 to 9944. [2022-11-20 12:40:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9936 states have (on average 1.3970410628019323) internal successors, (13881), 9943 states have internal predecessors, (13881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 13881 transitions. [2022-11-20 12:40:47,658 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 13881 transitions. Word has length 115 [2022-11-20 12:40:47,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:47,658 INFO L495 AbstractCegarLoop]: Abstraction has 9944 states and 13881 transitions. [2022-11-20 12:40:47,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 13881 transitions. [2022-11-20 12:40:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-20 12:40:47,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:47,661 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, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:47,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 12:40:47,662 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-11-20 12:40:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:47,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1933744648, now seen corresponding path program 1 times [2022-11-20 12:40:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:47,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771061548] [2022-11-20 12:40:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:47,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:40:47,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:47,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771061548] [2022-11-20 12:40:47,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771061548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128715979] [2022-11-20 12:40:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:47,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:47,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:47,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:47,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:40:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:47,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:40:47,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:40:48,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:40:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128715979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:48,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:40:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-20 12:40:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602103077] [2022-11-20 12:40:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:40:48,104 INFO L87 Difference]: Start difference. First operand 9944 states and 13881 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:48,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:48,918 INFO L93 Difference]: Finished difference Result 18599 states and 26006 transitions. [2022-11-20 12:40:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 115 [2022-11-20 12:40:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:48,934 INFO L225 Difference]: With dead ends: 18599 [2022-11-20 12:40:48,935 INFO L226 Difference]: Without dead ends: 8598 [2022-11-20 12:40:48,945 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-11-20 12:40:48,946 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 293 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:48,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 465 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2022-11-20 12:40:49,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8027. [2022-11-20 12:40:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8027 states, 8019 states have (on average 1.3933158747973562) internal successors, (11173), 8026 states have internal predecessors, (11173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8027 states to 8027 states and 11173 transitions. [2022-11-20 12:40:49,599 INFO L78 Accepts]: Start accepts. Automaton has 8027 states and 11173 transitions. Word has length 115 [2022-11-20 12:40:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:49,599 INFO L495 AbstractCegarLoop]: Abstraction has 8027 states and 11173 transitions. [2022-11-20 12:40:49,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 8027 states and 11173 transitions. [2022-11-20 12:40:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-20 12:40:49,603 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:49,603 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:49,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:49,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-20 12:40:49,811 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-11-20 12:40:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1930156709, now seen corresponding path program 1 times [2022-11-20 12:40:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:49,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557520981] [2022-11-20 12:40:49,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:40:49,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557520981] [2022-11-20 12:40:49,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557520981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:49,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:40:49,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:40:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331689087] [2022-11-20 12:40:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:49,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 12:40:49,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:40:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:40:49,964 INFO L87 Difference]: Start difference. First operand 8027 states and 11173 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:51,522 INFO L93 Difference]: Finished difference Result 18694 states and 25971 transitions. [2022-11-20 12:40:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:40:51,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 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 117 [2022-11-20 12:40:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:51,557 INFO L225 Difference]: With dead ends: 18694 [2022-11-20 12:40:51,557 INFO L226 Difference]: Without dead ends: 18690 [2022-11-20 12:40:51,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:40:51,564 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 959 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:51,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1394 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 12:40:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states. [2022-11-20 12:40:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 14601. [2022-11-20 12:40:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14593 states have (on average 1.4051942712259302) internal successors, (20506), 14600 states have internal predecessors, (20506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:52,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20506 transitions. [2022-11-20 12:40:52,525 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20506 transitions. Word has length 117 [2022-11-20 12:40:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:52,525 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 20506 transitions. [2022-11-20 12:40:52,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20506 transitions. [2022-11-20 12:40:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-11-20 12:40:52,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:52,530 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:52,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:40:52,531 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-11-20 12:40:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1274447402, now seen corresponding path program 1 times [2022-11-20 12:40:52,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:52,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487230943] [2022-11-20 12:40:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:40:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487230943] [2022-11-20 12:40:52,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487230943] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:52,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112675475] [2022-11-20 12:40:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:52,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:52,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:52,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:52,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:40:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:52,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:40:52,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:40:52,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:40:52,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112675475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:52,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:40:52,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-20 12:40:52,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063128252] [2022-11-20 12:40:52,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:52,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:52,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:40:52,792 INFO L87 Difference]: Start difference. First operand 14601 states and 20506 transitions. Second operand has 3 states, 2 states have (on average 57.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:54,632 INFO L93 Difference]: Finished difference Result 19687 states and 27475 transitions. [2022-11-20 12:40:54,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 57.0) internal successors, (114), 3 states have internal predecessors, (114), 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 122 [2022-11-20 12:40:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:54,659 INFO L225 Difference]: With dead ends: 19687 [2022-11-20 12:40:54,659 INFO L226 Difference]: Without dead ends: 19686 [2022-11-20 12:40:54,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-11-20 12:40:54,666 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 297 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:54,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 918 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19686 states. [2022-11-20 12:40:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19686 to 14600. [2022-11-20 12:40:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14600 states, 14593 states have (on average 1.4037552251079284) internal successors, (20485), 14599 states have internal predecessors, (20485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 20485 transitions. [2022-11-20 12:40:56,275 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 20485 transitions. Word has length 122 [2022-11-20 12:40:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:56,275 INFO L495 AbstractCegarLoop]: Abstraction has 14600 states and 20485 transitions. [2022-11-20 12:40:56,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 20485 transitions. [2022-11-20 12:40:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-11-20 12:40:56,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:56,278 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-20 12:40:56,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:40:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 12:40:56,484 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-11-20 12:40:56,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:40:56,484 INFO L85 PathProgramCache]: Analyzing trace with hash 853164033, now seen corresponding path program 1 times [2022-11-20 12:40:56,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:40:56,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693940797] [2022-11-20 12:40:56,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:56,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:40:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 12:40:56,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:40:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693940797] [2022-11-20 12:40:56,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693940797] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:40:56,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997120695] [2022-11-20 12:40:56,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:40:56,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:40:56,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:40:56,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:40:56,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:40:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:40:56,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:40:56,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:40:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-20 12:40:56,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:40:56,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997120695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:40:56,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:40:56,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-20 12:40:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958500107] [2022-11-20 12:40:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:40:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:40:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:40:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:40:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:40:56,825 INFO L87 Difference]: Start difference. First operand 14600 states and 20485 transitions. Second operand has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:40:58,759 INFO L93 Difference]: Finished difference Result 22150 states and 31160 transitions. [2022-11-20 12:40:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:40:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 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 123 [2022-11-20 12:40:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:40:58,787 INFO L225 Difference]: With dead ends: 22150 [2022-11-20 12:40:58,787 INFO L226 Difference]: Without dead ends: 22149 [2022-11-20 12:40:58,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:40:58,794 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 296 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:40:58,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 914 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:40:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22149 states. [2022-11-20 12:40:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22149 to 14599. [2022-11-20 12:40:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14593 states have (on average 1.4023161789899268) internal successors, (20464), 14598 states have internal predecessors, (20464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 20464 transitions. [2022-11-20 12:40:59,880 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 20464 transitions. Word has length 123 [2022-11-20 12:40:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:40:59,880 INFO L495 AbstractCegarLoop]: Abstraction has 14599 states and 20464 transitions. [2022-11-20 12:40:59,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.0) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:40:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 20464 transitions. [2022-11-20 12:40:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-11-20 12:40:59,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:40:59,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:40:59,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:41:00,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 12:41:00,094 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-11-20 12:41:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:41:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1222314496, now seen corresponding path program 1 times [2022-11-20 12:41:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:41:00,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683572488] [2022-11-20 12:41:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:41:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:41:00,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:41:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:41:00,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:41:00,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683572488] [2022-11-20 12:41:00,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683572488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:41:00,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:41:00,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:41:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766338776] [2022-11-20 12:41:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:41:00,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:41:00,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:41:00,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:41:00,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:41:00,193 INFO L87 Difference]: Start difference. First operand 14599 states and 20464 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:41:00,940 INFO L93 Difference]: Finished difference Result 18721 states and 26068 transitions. [2022-11-20 12:41:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:41:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 205 [2022-11-20 12:41:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:41:00,946 INFO L225 Difference]: With dead ends: 18721 [2022-11-20 12:41:00,946 INFO L226 Difference]: Without dead ends: 4005 [2022-11-20 12:41:00,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:41:00,959 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 12:41:00,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 488 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 12:41:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-11-20 12:41:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3136. [2022-11-20 12:41:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3130 states have (on average 1.1587859424920128) internal successors, (3627), 3135 states have internal predecessors, (3627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 3627 transitions. [2022-11-20 12:41:01,260 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 3627 transitions. Word has length 205 [2022-11-20 12:41:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:41:01,260 INFO L495 AbstractCegarLoop]: Abstraction has 3136 states and 3627 transitions. [2022-11-20 12:41:01,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3627 transitions. [2022-11-20 12:41:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-20 12:41:01,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:41:01,265 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, 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] [2022-11-20 12:41:01,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:41:01,266 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-11-20 12:41:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:41:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -692101379, now seen corresponding path program 1 times [2022-11-20 12:41:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:41:01,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365595456] [2022-11-20 12:41:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:41:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:41:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:41:01,435 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:41:01,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:41:01,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365595456] [2022-11-20 12:41:01,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365595456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:41:01,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251814213] [2022-11-20 12:41:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:41:01,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:41:01,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:41:01,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:41:01,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:41:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:41:01,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:41:01,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:41:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 12:41:01,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 12:41:01,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251814213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:41:01,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 12:41:01,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-20 12:41:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017263545] [2022-11-20 12:41:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:41:01,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:41:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:41:01,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:41:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:41:01,785 INFO L87 Difference]: Start difference. First operand 3136 states and 3627 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:41:02,159 INFO L93 Difference]: Finished difference Result 4335 states and 5043 transitions. [2022-11-20 12:41:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 12:41:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 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 220 [2022-11-20 12:41:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:41:02,163 INFO L225 Difference]: With dead ends: 4335 [2022-11-20 12:41:02,164 INFO L226 Difference]: Without dead ends: 1923 [2022-11-20 12:41:02,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 222 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-11-20 12:41:02,168 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 488 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:41:02,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 640 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:41:02,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-11-20 12:41:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1560. [2022-11-20 12:41:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1558 states have (on average 1.1482670089858793) internal successors, (1789), 1559 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1789 transitions. [2022-11-20 12:41:02,412 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1789 transitions. Word has length 220 [2022-11-20 12:41:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:41:02,413 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1789 transitions. [2022-11-20 12:41:02,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1789 transitions. [2022-11-20 12:41:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-20 12:41:02,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:41:02,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:41:02,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:41:02,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:41:02,623 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-11-20 12:41:02,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:41:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash 980623008, now seen corresponding path program 1 times [2022-11-20 12:41:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:41:02,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447651674] [2022-11-20 12:41:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:41:02,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:41:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:41:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:41:02,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:41:02,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447651674] [2022-11-20 12:41:02,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447651674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:41:02,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:41:02,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 12:41:02,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322475467] [2022-11-20 12:41:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:41:02,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:41:02,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:41:02,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:41:02,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:41:02,745 INFO L87 Difference]: Start difference. First operand 1560 states and 1789 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:41:03,238 INFO L93 Difference]: Finished difference Result 3043 states and 3530 transitions. [2022-11-20 12:41:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:41:03,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 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 225 [2022-11-20 12:41:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:41:03,242 INFO L225 Difference]: With dead ends: 3043 [2022-11-20 12:41:03,242 INFO L226 Difference]: Without dead ends: 2453 [2022-11-20 12:41:03,244 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-11-20 12:41:03,245 INFO L413 NwaCegarLoop]: 396 mSDtfsCounter, 563 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:41:03,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1196 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:41:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2022-11-20 12:41:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1524. [2022-11-20 12:41:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1522 states have (on average 1.136005256241787) internal successors, (1729), 1523 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1729 transitions. [2022-11-20 12:41:03,419 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1729 transitions. Word has length 225 [2022-11-20 12:41:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:41:03,420 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1729 transitions. [2022-11-20 12:41:03,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1729 transitions. [2022-11-20 12:41:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-20 12:41:03,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:41:03,423 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:41:03,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:41:03,424 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-11-20 12:41:03,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:41:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1076956137, now seen corresponding path program 1 times [2022-11-20 12:41:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:41:03,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340528773] [2022-11-20 12:41:03,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:41:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:41:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:41:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-20 12:41:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:41:03,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340528773] [2022-11-20 12:41:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340528773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:41:03,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:41:03,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 12:41:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927772087] [2022-11-20 12:41:03,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:41:03,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 12:41:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:41:03,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 12:41:03,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 12:41:03,604 INFO L87 Difference]: Start difference. First operand 1524 states and 1729 transitions. Second operand has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:41:04,078 INFO L93 Difference]: Finished difference Result 2427 states and 2764 transitions. [2022-11-20 12:41:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 12:41:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 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 227 [2022-11-20 12:41:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:41:04,080 INFO L225 Difference]: With dead ends: 2427 [2022-11-20 12:41:04,080 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:41:04,082 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-11-20 12:41:04,083 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 594 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:41:04,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 828 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 12:41:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:41:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:41:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:41:04,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2022-11-20 12:41:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:41:04,085 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:41:04,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:41:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:41:04,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:41:04,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-20 12:41:04,089 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-20 12:41:04,090 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-20 12:41:04,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:41:04,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 12:41:13,055 WARN L233 SmtUtils]: Spent 8.72s on a formula simplification. DAG size of input: 271 DAG size of output: 266 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:42:07,392 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 874 DAG size of output: 750 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 12:43:21,061 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 750 DAG size of output: 92 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 12:43:24,361 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-20 12:43:24,361 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2022-11-20 12:43:24,361 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-11-20 12:43:24,362 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-11-20 12:43:24,362 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-11-20 12:43:24,363 INFO L895 garLoopResultBuilder]: At program point L763(lines 756 809) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,363 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2022-11-20 12:43:24,363 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2022-11-20 12:43:24,363 INFO L895 garLoopResultBuilder]: At program point L697(lines 690 725) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,364 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-11-20 12:43:24,364 INFO L895 garLoopResultBuilder]: At program point L1094(lines 1087 1104) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,365 INFO L895 garLoopResultBuilder]: At program point L1161(lines 1113 1166) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,365 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2022-11-20 12:43:24,365 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2022-11-20 12:43:24,365 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2022-11-20 12:43:24,365 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2022-11-20 12:43:24,366 INFO L895 garLoopResultBuilder]: At program point L1294(lines 1287 1313) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,366 INFO L895 garLoopResultBuilder]: At program point L237(lines 230 265) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse6 (= ~c_req_type~0 1)) (.cse1 (= ~s_run_pc~0 0)) (.cse7 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse2 (= 2 ~s_run_pc~0) .cse8 (<= 0 ~a_t~0) .cse3 (or (and .cse4 .cse5) (and .cse4 (= ~m_run_pc~0 3))) .cse9) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (= ~a_t~0 0) .cse9 .cse5))) [2022-11-20 12:43:24,367 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2022-11-20 12:43:24,367 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2022-11-20 12:43:24,367 INFO L895 garLoopResultBuilder]: At program point L106(lines 101 843) the Hoare annotation is: false [2022-11-20 12:43:24,367 INFO L895 garLoopResultBuilder]: At program point L437(lines 430 456) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,368 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2022-11-20 12:43:24,368 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2022-11-20 12:43:24,368 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2022-11-20 12:43:24,368 INFO L895 garLoopResultBuilder]: At program point L174(lines 144 175) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~req_tt_a~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse1 (not .cse13)) (.cse12 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (not (= ~c_empty_req~0 0))) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 (<= 0 ~a_t~0) .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11)))) [2022-11-20 12:43:24,369 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2022-11-20 12:43:24,369 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2022-11-20 12:43:24,369 INFO L895 garLoopResultBuilder]: At program point L571(lines 564 617) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (not (= 2 ~s_run_pc~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,369 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-11-20 12:43:24,369 INFO L895 garLoopResultBuilder]: At program point L109(lines 101 843) the Hoare annotation is: false [2022-11-20 12:43:24,370 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2022-11-20 12:43:24,370 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-11-20 12:43:24,370 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse10 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse11 (= ~m_run_pc~0 6)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse9 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 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 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not .cse3) .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse0 .cse8 .cse9 .cse2 (<= 0 ~a_t~0) .cse4 .cse5 .cse6))) [2022-11-20 12:43:24,371 INFO L895 garLoopResultBuilder]: At program point L771(lines 764 808) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,371 INFO L895 garLoopResultBuilder]: At program point L705(lines 698 724) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,371 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2022-11-20 12:43:24,371 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-11-20 12:43:24,371 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2022-11-20 12:43:24,372 INFO L895 garLoopResultBuilder]: At program point L904(lines 878 905) the Hoare annotation is: (let ((.cse4 (not (= 2 ~s_run_pc~0))) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (= ~m_run_pc~0 6)) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse11 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (not (= ~c_empty_req~0 1))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse12 (= ~m_run_pc~0 3)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse4 .cse5 (not (= ~c_m_lock~0 1)) .cse6 .cse7 .cse8 .cse9))) (and .cse0 .cse5 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse6 .cse7 (= ~c_empty_rsp~0 1) .cse8 .cse9 .cse10) (and .cse4 .cse5 .cse1 .cse11 .cse3 .cse6 .cse7 .cse12 .cse9) (and .cse0 .cse5 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse5 .cse11 .cse3 .cse6 .cse7 .cse12 .cse9 .cse10))) [2022-11-20 12:43:24,373 INFO L895 garLoopResultBuilder]: At program point L838(lines 85 844) the Hoare annotation is: (let ((.cse10 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~c_req_type~0 1)) (.cse13 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse12 (not .cse10)) (.cse14 (= ~c_req_type~0 0)) (.cse15 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse11 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_empty_req~0 1))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse4 .cse5 .cse11) (and .cse12 .cse0 .cse13 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse14 .cse13 .cse15 .cse2 (or (and .cse12 .cse0 .cse4 .cse5 .cse11 .cse7 .cse8) (and .cse12 .cse0 (not (= ~c_m_lock~0 1)) (not (= ~c_empty_req~0 0)) .cse4 .cse5 .cse11 .cse7))) (and .cse14 .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse11 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse4 .cse5 .cse6) (and .cse9 (= ~s_run_pc~0 0) .cse3 .cse4 .cse5 .cse6)))) [2022-11-20 12:43:24,373 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2022-11-20 12:43:24,373 INFO L895 garLoopResultBuilder]: At program point L112(lines 101 843) the Hoare annotation is: (let ((.cse1 (not (= ~s_run_st~0 0))) (.cse9 (not (= ~c_empty_req~0 1))) (.cse8 (= ~c_empty_rsp~0 1)) (.cse4 (= 2 ~s_run_pc~0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse5 .cse8 .cse6) (and .cse1 (= ~s_run_pc~0 0) .cse9 .cse5 .cse8 .cse6) (and .cse0 .cse10 .cse2 .cse9 .cse5 .cse8 .cse6 .cse7) (and (not .cse4) .cse0 .cse10 .cse2 .cse3 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,374 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)) (.cse3 (= ~req_tt_a~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,374 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2022-11-20 12:43:24,374 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2022-11-20 12:43:24,374 INFO L895 garLoopResultBuilder]: At program point L1302(lines 1295 1312) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,375 INFO L895 garLoopResultBuilder]: At program point L245(lines 238 264) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse6 (= ~c_req_type~0 1)) (.cse1 (= ~s_run_pc~0 0)) (.cse7 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse2 (= 2 ~s_run_pc~0) .cse8 (<= 0 ~a_t~0) .cse3 (or (and .cse4 .cse5) (and .cse4 (= ~m_run_pc~0 3))) .cse9) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (= ~a_t~0 0) .cse9 .cse5))) [2022-11-20 12:43:24,375 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2022-11-20 12:43:24,375 INFO L895 garLoopResultBuilder]: At program point L972(lines 965 982) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,376 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2022-11-20 12:43:24,376 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2022-11-20 12:43:24,376 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-11-20 12:43:24,376 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2022-11-20 12:43:24,379 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2022-11-20 12:43:24,380 INFO L895 garLoopResultBuilder]: At program point L445(lines 438 455) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,380 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2022-11-20 12:43:24,380 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2022-11-20 12:43:24,381 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2022-11-20 12:43:24,381 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2022-11-20 12:43:24,381 INFO L895 garLoopResultBuilder]: At program point L115(lines 101 843) the Hoare annotation is: false [2022-11-20 12:43:24,381 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2022-11-20 12:43:24,382 INFO L895 garLoopResultBuilder]: At program point L1040(lines 1033 1086) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,382 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2022-11-20 12:43:24,382 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2022-11-20 12:43:24,382 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-20 12:43:24,383 INFO L895 garLoopResultBuilder]: At program point L1107(lines 851 1112) the Hoare annotation is: (let ((.cse5 (= ~c_empty_rsp~0 1)) (.cse10 (= ~c_req_type~0 0)) (.cse11 (not (= ~c_m_lock~0 1))) (.cse12 (= ~m_run_pc~0 6)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (not (= ~s_run_st~0 0))) (.cse8 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 (= ~c_req_type~0 1) .cse1 .cse8 .cse2 .cse4 .cse6 .cse9) (and .cse10 .cse0 .cse1 .cse8 .cse11 .cse3 (= ~c_empty_req~0 1) .cse4 .cse5 .cse9 (= ~m_run_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12) (and .cse10 .cse7 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse8 (or (and .cse0 .cse1 .cse11 .cse2 .cse4 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)))) (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse9))) [2022-11-20 12:43:24,383 INFO L895 garLoopResultBuilder]: At program point L579(lines 572 616) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (not (= 2 ~s_run_pc~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,383 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2022-11-20 12:43:24,383 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2022-11-20 12:43:24,384 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2022-11-20 12:43:24,384 INFO L895 garLoopResultBuilder]: At program point L118(lines 101 843) the Hoare annotation is: false [2022-11-20 12:43:24,385 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2022-11-20 12:43:24,385 INFO L895 garLoopResultBuilder]: At program point L779(lines 772 807) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,385 INFO L895 garLoopResultBuilder]: At program point L713(lines 706 723) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,386 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-11-20 12:43:24,386 INFO L902 garLoopResultBuilder]: At program point L1374(lines 1351 1376) the Hoare annotation is: true [2022-11-20 12:43:24,386 INFO L895 garLoopResultBuilder]: At program point L317(lines 287 318) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-20 12:43:24,386 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2022-11-20 12:43:24,386 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2022-11-20 12:43:24,386 INFO L895 garLoopResultBuilder]: At program point L1243(lines 1236 1253) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,387 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2022-11-20 12:43:24,387 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2022-11-20 12:43:24,387 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-11-20 12:43:24,387 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2022-11-20 12:43:24,387 INFO L895 garLoopResultBuilder]: At program point L385(lines 378 395) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,388 INFO L895 garLoopResultBuilder]: At program point L253(lines 246 263) the Hoare annotation is: (let ((.cse0 (not (= ~s_run_st~0 0))) (.cse6 (= ~c_req_type~0 1)) (.cse1 (= ~s_run_pc~0 0)) (.cse7 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse2 (= 2 ~s_run_pc~0) .cse8 (<= 0 ~a_t~0) .cse3 (or (and .cse4 .cse5) (and .cse4 (= ~m_run_pc~0 3))) .cse9) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (= ~a_t~0 0) .cse9 .cse5))) [2022-11-20 12:43:24,388 INFO L895 garLoopResultBuilder]: At program point L121(lines 101 843) the Hoare annotation is: (let ((.cse2 (= 2 ~s_run_pc~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse6 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse7 (= ~req_tt_a~0 0)) (.cse8 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 (not .cse2) .cse0 .cse7 .cse8 .cse3 .cse5 .cse9) (and .cse6 .cse0 .cse7 (not (= ~c_empty_req~0 1)) .cse3 .cse4 .cse5 .cse9) (and .cse6 .cse0 .cse1 .cse7 .cse8 .cse3 .cse5 .cse9))) [2022-11-20 12:43:24,388 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2022-11-20 12:43:24,388 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2022-11-20 12:43:24,389 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2022-11-20 12:43:24,389 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-11-20 12:43:24,389 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-11-20 12:43:24,389 INFO L895 garLoopResultBuilder]: At program point L1048(lines 1041 1085) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,389 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 12:43:24,390 INFO L895 garLoopResultBuilder]: At program point L587(lines 580 615) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse8 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (or (and .cse7 .cse8) (and .cse7 .cse9)) .cse10) (and .cse0 .cse1 (let ((.cse11 (not (= 2 ~s_run_pc~0)))) (or (and .cse11 .cse7 .cse8) (and .cse11 .cse7 .cse9))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2022-11-20 12:43:24,390 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2022-11-20 12:43:24,390 INFO L895 garLoopResultBuilder]: At program point L918(lines 911 964) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,390 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2022-11-20 12:43:24,391 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2022-11-20 12:43:24,391 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2022-11-20 12:43:24,391 INFO L895 garLoopResultBuilder]: At program point L787(lines 780 806) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,391 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2022-11-20 12:43:24,391 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2022-11-20 12:43:24,392 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2022-11-20 12:43:24,392 INFO L895 garLoopResultBuilder]: At program point L524(lines 494 525) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,392 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-20 12:43:24,392 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-11-20 12:43:24,392 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2022-11-20 12:43:24,393 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2022-11-20 12:43:24,393 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-11-20 12:43:24,393 INFO L895 garLoopResultBuilder]: At program point L131(lines 101 843) the Hoare annotation is: (let ((.cse6 (= 2 ~s_run_pc~0))) (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (not .cse6)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse11 .cse3 .cse4 .cse5 .cse7 .cse8 (= ~a_t~0 0) .cse9) (and .cse10 .cse2 .cse11 .cse4 .cse5 .cse7 .cse8 .cse9)))) [2022-11-20 12:43:24,394 INFO L895 garLoopResultBuilder]: At program point L1056(lines 1049 1084) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,394 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-20 12:43:24,394 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_empty_req~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,394 INFO L895 garLoopResultBuilder]: At program point L1189(lines 1182 1235) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,395 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-11-20 12:43:24,395 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2022-11-20 12:43:24,395 INFO L895 garLoopResultBuilder]: At program point L595(lines 588 614) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse8 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (or (and .cse7 .cse8) (and .cse7 .cse9)) .cse10) (and .cse0 .cse1 (let ((.cse11 (not (= 2 ~s_run_pc~0)))) (or (and .cse11 .cse7 .cse8) (and .cse11 .cse7 .cse9))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2022-11-20 12:43:24,395 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2022-11-20 12:43:24,395 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2022-11-20 12:43:24,396 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2022-11-20 12:43:24,396 INFO L895 garLoopResultBuilder]: At program point L331(lines 324 377) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,396 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-11-20 12:43:24,396 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2022-11-20 12:43:24,396 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2022-11-20 12:43:24,397 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2022-11-20 12:43:24,397 INFO L895 garLoopResultBuilder]: At program point L926(lines 919 963) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,397 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2022-11-20 12:43:24,397 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2022-11-20 12:43:24,398 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse15 (= 2 ~s_run_pc~0))) (let ((.cse8 (= ~m_run_pc~0 3)) (.cse9 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse5 (<= 0 ~a_t~0)) (.cse11 (not .cse15)) (.cse1 (not (= ~s_run_st~0 0))) (.cse12 (= ~s_run_pc~0 0)) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse13 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse14 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse0 .cse12 .cse2 .cse3 .cse4 .cse6 .cse7 (= ~a_t~0 0) .cse13 .cse14) (and .cse11 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse13 .cse14) (and .cse11 .cse1 .cse12 .cse3 .cse4 .cse6 .cse7 .cse13 .cse14)))) [2022-11-20 12:43:24,398 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2022-11-20 12:43:24,398 INFO L895 garLoopResultBuilder]: At program point L795(lines 788 805) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,398 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2022-11-20 12:43:24,398 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2022-11-20 12:43:24,399 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2022-11-20 12:43:24,399 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-11-20 12:43:24,399 INFO L895 garLoopResultBuilder]: At program point L1324(lines 1317 1334) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,399 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2022-11-20 12:43:24,400 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-11-20 12:43:24,400 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2022-11-20 12:43:24,400 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2022-11-20 12:43:24,400 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2022-11-20 12:43:24,400 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2022-11-20 12:43:24,401 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2022-11-20 12:43:24,401 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2022-11-20 12:43:24,401 INFO L895 garLoopResultBuilder]: At program point L467(lines 460 477) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,401 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2022-11-20 12:43:24,401 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2022-11-20 12:43:24,402 INFO L895 garLoopResultBuilder]: At program point L71(lines 62 72) the Hoare annotation is: (and (= ~c_req_type~0 0) (<= 0 |ULTIMATE.start_m_run_~a~0#1|) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~c_empty_req~0 0))) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~m_run_pc~0 6)) (.cse4 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and (not (= 2 ~s_run_pc~0)) .cse0 (not (= ~c_m_lock~0 1)) .cse1 .cse2 .cse3 .cse4))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) [2022-11-20 12:43:24,402 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2022-11-20 12:43:24,402 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2022-11-20 12:43:24,402 INFO L895 garLoopResultBuilder]: At program point L865(lines 860 1111) the Hoare annotation is: (let ((.cse8 (not (= ~c_empty_req~0 0))) (.cse12 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse7 (not (= ~c_m_lock~0 1))) (.cse10 (= ~m_run_pc~0 6)) (.cse4 (not (= 2 ~s_run_pc~0))) (.cse5 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse13 (= ~c_req_type~0 1)) (.cse6 (not (= ~s_run_st~0 0))) (.cse3 (= ~req_tt_a~0 0)) (.cse9 (= 2 ~c_write_rsp_ev~0)) (.cse15 (= ~c_empty_rsp~0 1)) (.cse14 (= ~m_run_pc~0 3)) (.cse11 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12))) (and .cse4 .cse5 .cse1 .cse13 .cse6 .cse3 .cse8 .cse9 .cse14 .cse11) (and .cse0 .cse4 .cse5 .cse6 .cse2 .cse3 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse4 .cse5 .cse6 .cse2 .cse3 .cse7 .cse9 .cse15 .cse10 (<= 1 |ULTIMATE.start_m_run_~a~0#1|) .cse11) (and .cse4 .cse5 .cse1 .cse13 .cse6 .cse3 .cse9 .cse15 .cse14 .cse11))) [2022-11-20 12:43:24,403 INFO L895 garLoopResultBuilder]: At program point L667(lines 637 668) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 6)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,403 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-11-20 12:43:24,403 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2022-11-20 12:43:24,403 INFO L895 garLoopResultBuilder]: At program point L1064(lines 1057 1083) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,404 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2022-11-20 12:43:24,404 INFO L895 garLoopResultBuilder]: At program point L1197(lines 1190 1234) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,404 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2022-11-20 12:43:24,404 INFO L895 garLoopResultBuilder]: At program point L735(lines 728 745) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,405 INFO L895 garLoopResultBuilder]: At program point L603(lines 596 613) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (= ~c_req_type~0 0)) (.cse8 (= ~m_run_pc~0 0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 1))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (or (and .cse7 .cse8) (and .cse7 .cse9)) .cse10) (and .cse0 .cse1 (let ((.cse11 (not (= 2 ~s_run_pc~0)))) (or (and .cse11 .cse7 .cse8) (and .cse11 .cse7 .cse9))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse10))) [2022-11-20 12:43:24,405 INFO L895 garLoopResultBuilder]: At program point L339(lines 332 376) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,405 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2022-11-20 12:43:24,405 INFO L895 garLoopResultBuilder]: At program point L207(lines 177 208) the Hoare annotation is: (let ((.cse12 (= 2 ~s_run_pc~0))) (let ((.cse1 (not .cse12)) (.cse3 (= ~s_run_pc~0 0)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse11 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse1 .cse11 .cse3 .cse5 .cse7 .cse8 .cse10) (and .cse0 .cse2 .cse11 .cse4 .cse5 .cse12 .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse9 .cse10)))) [2022-11-20 12:43:24,406 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-11-20 12:43:24,406 INFO L895 garLoopResultBuilder]: At program point L934(lines 927 962) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,406 INFO L895 garLoopResultBuilder]: At program point L868(lines 860 1111) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 1))) (.cse4 (= 2 ~s_run_pc~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (= ~c_req_type~0 0) .cse0 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 6) .cse7 .cse8) (and .cse0 (= ~c_req_type~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_run_pc~0 3) .cse7 .cse8))) [2022-11-20 12:43:24,406 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2022-11-20 12:43:24,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-11-20 12:43:24,407 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2022-11-20 12:43:24,407 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2022-11-20 12:43:24,407 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2022-11-20 12:43:24,407 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2022-11-20 12:43:24,408 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 876 1106) the Hoare annotation is: (let ((.cse10 (= ~c_empty_rsp~0 1)) (.cse11 (= ~c_req_type~0 0)) (.cse14 (not (= ~c_m_lock~0 1))) (.cse13 (= ~m_run_pc~0 6)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse12 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse12 .cse2 .cse3 .cse4 .cse13 .cse6 .cse7 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse9 (or (and .cse8 .cse0 .cse4 .cse10 .cse13 .cse6 .cse7) (and .cse8 .cse0 .cse14 .cse4 .cse10 .cse13 .cse6)) .cse12 .cse2) (and .cse11 .cse9 (or (and .cse8 .cse0 .cse14 .cse3 .cse4 .cse13 .cse6) (and .cse8 .cse0 .cse3 .cse4 .cse13 .cse6 .cse7)) .cse12 .cse2) (and .cse8 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-20 12:43:24,408 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2022-11-20 12:43:24,408 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-11-20 12:43:24,408 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2022-11-20 12:43:24,409 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-11-20 12:43:24,409 INFO L895 garLoopResultBuilder]: At program point L275(lines 268 285) the Hoare annotation is: (let ((.cse1 (= ~s_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse2 (not (= ~c_empty_req~0 1))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~c_req_type~0 1) .cse1 (= ~req_tt_a~0 0) .cse2 (= |ULTIMATE.start_m_run_~req_type~0#1| 1) .cse3 .cse4 (= ~a_t~0 0) (= |ULTIMATE.start_m_run_~a~0#1| 0) .cse5) (and .cse0 .cse2 (= 2 ~s_run_pc~0) .cse3 .cse4))) [2022-11-20 12:43:24,409 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-11-20 12:43:24,409 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2022-11-20 12:43:24,409 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2022-11-20 12:43:24,410 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2022-11-20 12:43:24,410 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-20 12:43:24,410 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-20 12:43:24,410 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2022-11-20 12:43:24,410 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2022-11-20 12:43:24,411 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2022-11-20 12:43:24,411 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (= ~c_req_type~0 0)) (.cse2 (<= 2 ~c_write_req_ev~0)) (.cse4 (= ~req_tt_a~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse1 (not .cse13)) (.cse12 (not (= ~s_run_st~0 0))) (.cse3 (= ~s_run_pc~0 0)) (.cse5 (not (= ~c_m_lock~0 1))) (.cse6 (not (= ~c_empty_req~0 0))) (.cse8 (= 2 ~c_write_rsp_ev~0)) (.cse9 (= ~c_empty_rsp~0 1)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~a_t~0 0) .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse4 .cse5 .cse6 .cse13 .cse7 (<= 0 ~a_t~0) .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11)))) [2022-11-20 12:43:24,411 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2022-11-20 12:43:24,411 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 74 82) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (and (not (= 2 ~s_run_pc~0)) .cse0 (<= 0 |ULTIMATE.start_m_run_~a~0#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,411 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2022-11-20 12:43:24,412 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2022-11-20 12:43:24,412 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2022-11-20 12:43:24,412 INFO L895 garLoopResultBuilder]: At program point L1270(lines 1263 1316) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,412 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-11-20 12:43:24,413 INFO L895 garLoopResultBuilder]: At program point L1072(lines 1065 1082) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse4 (= ~m_run_pc~0 6)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse8 (not (= 2 ~s_run_pc~0))) (.cse7 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse9 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse0 .cse7 (or (and .cse8 .cse1 (not (= ~c_m_lock~0 1)) .cse4 .cse5) (and .cse8 .cse1 .cse4 .cse5 .cse6)) .cse2 .cse3) (and .cse8 .cse1 .cse7 .cse9 .cse3 .cse10 .cse5) (and .cse1 .cse9 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse10 .cse5 .cse6))) [2022-11-20 12:43:24,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-11-20 12:43:24,413 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2022-11-20 12:43:24,413 INFO L895 garLoopResultBuilder]: At program point L1205(lines 1198 1233) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,414 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2022-11-20 12:43:24,414 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-11-20 12:43:24,414 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-11-20 12:43:24,414 INFO L895 garLoopResultBuilder]: At program point L413(lines 406 459) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,415 INFO L895 garLoopResultBuilder]: At program point L347(lines 340 375) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,415 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2022-11-20 12:43:24,415 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1170 1349) the Hoare annotation is: (let ((.cse11 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~s_run_pc~0 0)) (.cse2 (= ~c_empty_req~0 1)) (.cse13 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse19 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse20 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse14 (not .cse11)) (.cse15 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse16 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse17 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse18 (= ~m_run_pc~0 6)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse3 (= ~m_run_st~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse9 .cse10 .cse3 .cse11 .cse2 .cse4 .cse5 .cse12 .cse13) (and .cse0 .cse1 .cse10 .cse2 .cse4 .cse5 .cse13) (and .cse14 .cse8 .cse15 .cse16 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse15 (or (and .cse8 .cse0 .cse10 .cse17 .cse3 .cse4 .cse18 .cse12) (and .cse8 .cse0 .cse17 .cse3 .cse4 .cse18 .cse12 .cse19)) .cse20 .cse9) (and .cse7 .cse8 .cse1 .cse9 .cse10 .cse2 .cse4 .cse5 .cse12 .cse13) (and .cse7 .cse14 .cse8 .cse20 .cse9 .cse4 .cse5 .cse18 .cse12 .cse19) (and .cse7 .cse15 (or (and .cse14 .cse8 .cse10 .cse17 .cse4 .cse18 .cse12) (and .cse14 .cse8 .cse17 .cse4 .cse18 .cse12 .cse19)) .cse20 .cse9) (and .cse8 .cse15 .cse0 .cse9 .cse17 .cse3 .cse11 .cse4 .cse6 .cse12) (and .cse14 .cse8 .cse15 .cse16 .cse9 .cse17 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse3 .cse11 .cse4 .cse5 .cse18) (and .cse8 .cse0 .cse3 .cse11 .cse4 .cse5 .cse6)))) [2022-11-20 12:43:24,415 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2022-11-20 12:43:24,416 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-11-20 12:43:24,416 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2022-11-20 12:43:24,416 INFO L895 garLoopResultBuilder]: At program point L942(lines 935 961) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,416 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 860 1111) the Hoare annotation is: (let ((.cse8 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse12 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse7 (= ~c_req_type~0 0)) (.cse10 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~req_tt_a~0 0)) (.cse11 (not (= ~c_m_lock~0 1))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 (or (and .cse10 .cse0 .cse11 .cse3 .cse12 .cse5) (and .cse10 .cse0 .cse3 .cse12 .cse5 .cse6))) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse9 .cse2 .cse3 .cse12 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse7 .cse10 .cse0 (not (= ~s_run_st~0 0)) .cse2 .cse11 (= ~c_empty_req~0 1) .cse3 (= ~c_empty_rsp~0 1) .cse5 (= ~m_run_pc~0 0)))) [2022-11-20 12:43:24,417 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2022-11-20 12:43:24,417 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2022-11-20 12:43:24,417 INFO L895 garLoopResultBuilder]: At program point L481(lines 133 482) 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 (<= 0 ~a_t~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,417 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-11-20 12:43:24,418 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2022-11-20 12:43:24,418 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2022-11-20 12:43:24,418 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-20 12:43:24,418 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 876 1106) the Hoare annotation is: (let ((.cse14 (not (= 2 ~s_run_pc~0))) (.cse13 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse12 (= ~m_run_pc~0 6)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (not (= ~s_run_st~0 0))) (.cse2 (= ~req_tt_a~0 0)) (.cse15 (not (= ~c_m_lock~0 1))) (.cse10 (= ~c_empty_req~0 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse5 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse9 .cse2 (not .cse10) .cse3 .cse11 .cse12 .cse5 .cse6) (and .cse7 .cse13 .cse9 .cse2 (or (and .cse14 .cse0 .cse15 .cse3 .cse12 .cse5) (and .cse14 .cse0 .cse3 .cse12 .cse5 .cse6))) (and .cse14 .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse9 .cse2 .cse3 .cse12 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse7 .cse0 .cse8 .cse2 .cse15 .cse10 .cse3 .cse11 .cse5 (= ~m_run_pc~0 0)))) [2022-11-20 12:43:24,418 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2022-11-20 12:43:24,419 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2022-11-20 12:43:24,419 INFO L895 garLoopResultBuilder]: At program point L681(lines 674 727) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,419 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2022-11-20 12:43:24,420 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse12 (= 2 ~s_run_pc~0)) (.cse13 (= ~c_empty_req~0 1))) (let ((.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse11 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse19 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse3 (not .cse13)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse17 (not .cse12)) (.cse1 (= ~c_req_type~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse18 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~req_tt_a~0 0)) (.cse20 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse11 .cse12 .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse0 .cse10 .cse12 .cse4 .cse5 .cse15) (and .cse10 .cse16 .cse11 .cse13 .cse4 .cse5 .cse14) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse9 .cse18 .cse19 .cse2 (or (and .cse0 .cse10 .cse11 .cse20 .cse4 .cse15 .cse7) (and .cse0 .cse10 .cse20 .cse4 .cse15 .cse7 .cse8))) (and .cse9 .cse0 .cse19 .cse2 .cse3 .cse4 .cse5 .cse15 .cse7 .cse8) (and .cse9 .cse0 .cse16 .cse2 .cse11 .cse13 .cse4 .cse5 .cse7 .cse14) (and .cse0 .cse10 .cse12 .cse4 .cse5 .cse6) (and .cse9 .cse18 (or (and .cse17 .cse0 .cse11 .cse20 .cse4 .cse15 .cse7) (and .cse17 .cse0 .cse20 .cse4 .cse15 .cse7 .cse8)) .cse19 .cse2) (and .cse10 .cse16 .cse3 .cse4 .cse5 .cse6) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse20 .cse4 .cse6 .cse7) (and .cse0 .cse18 .cse10 .cse2 .cse20 .cse12 .cse4 .cse6 .cse7)))) [2022-11-20 12:43:24,420 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 885) no Hoare annotation was computed. [2022-11-20 12:43:24,420 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2022-11-20 12:43:24,420 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2022-11-20 12:43:24,420 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (not .cse13)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse9 (<= 0 ~a_t~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|))) (or (and (= ~c_req_type~0 0) .cse0 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6 .cse7 .cse8)))) [2022-11-20 12:43:24,421 INFO L895 garLoopResultBuilder]: At program point L1278(lines 1271 1315) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,421 INFO L895 garLoopResultBuilder]: At program point L221(lines 214 267) the Hoare annotation is: (let ((.cse1 (= ~s_run_pc~0 0)) (.cse6 (= ~c_req_type~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse7 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (= ~a_t~0 0) .cse9 .cse5) (and .cse6 .cse0 .cse7 .cse2 (= 2 ~s_run_pc~0) .cse8 (<= 0 ~a_t~0) .cse3 .cse4 .cse9 .cse5))) [2022-11-20 12:43:24,421 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2022-11-20 12:43:24,422 INFO L902 garLoopResultBuilder]: At program point L1345(lines 1167 1350) the Hoare annotation is: true [2022-11-20 12:43:24,422 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse4 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~c_empty_req~0 0))) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (not .cse4)) (.cse1 (not (= ~s_run_st~0 0))) (.cse12 (not (= ~c_empty_req~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse5 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse11) (and .cse0 .cse10 .cse2 .cse12 .cse4 (<= 0 ~a_t~0) .cse5 .cse11 .cse8) (and .cse9 .cse1 (= ~s_run_pc~0 0) .cse12 .cse5 .cse11)))) [2022-11-20 12:43:24,422 INFO L895 garLoopResultBuilder]: At program point L1213(lines 1206 1232) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,422 INFO L895 garLoopResultBuilder]: At program point L817(lines 810 827) 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 6)) (.cse9 (= ~a_t~0 0)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,423 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2022-11-20 12:43:24,423 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 491) no Hoare annotation was computed. [2022-11-20 12:43:24,423 INFO L895 garLoopResultBuilder]: At program point L421(lines 414 458) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,423 INFO L895 garLoopResultBuilder]: At program point L355(lines 348 374) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,423 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2022-11-20 12:43:24,424 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2022-11-20 12:43:24,424 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-11-20 12:43:24,424 INFO L895 garLoopResultBuilder]: At program point L950(lines 943 960) the Hoare annotation is: (let ((.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse11 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 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))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ~c_req_type~0 0) .cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse3 (let ((.cse10 (= ~m_run_pc~0 6))) (or (and .cse0 .cse4 .cse5 .cse10 .cse7 .cse8) (and .cse11 .cse0 (not (= ~c_m_lock~0 1)) .cse4 .cse5 .cse10 .cse7))) (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse11 .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,424 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2022-11-20 12:43:24,424 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-11-20 12:43:24,425 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2022-11-20 12:43:24,425 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2022-11-20 12:43:24,425 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2022-11-20 12:43:24,425 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2022-11-20 12:43:24,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-11-20 12:43:24,426 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-20 12:43:24,426 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-11-20 12:43:24,426 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2022-11-20 12:43:24,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-11-20 12:43:24,426 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-20 12:43:24,427 INFO L895 garLoopResultBuilder]: At program point L689(lines 682 726) 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 (not (= ~c_empty_req~0 0))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (= ~a_t~0 0)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,427 INFO L895 garLoopResultBuilder]: At program point L557(lines 527 558) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_empty_req~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2022-11-20 12:43:24,427 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2022-11-20 12:43:24,427 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2022-11-20 12:43:24,427 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-20 12:43:24,428 INFO L895 garLoopResultBuilder]: At program point L625(lines 618 635) the Hoare annotation is: (let ((.cse4 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse1 (not (= ~c_empty_req~0 1))) (.cse0 (= 2 ~s_run_pc~0)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse3 (= ~c_empty_rsp~0 1))) (or (and (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0) (= ~c_req_type~0 0) (not .cse0) (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) (= ~req_tt_a~0 0) .cse1 (<= 0 ~a_t~0) .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse0 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse0 .cse2 .cse3 (= ~m_run_pc~0 6)))) [2022-11-20 12:43:24,428 INFO L895 garLoopResultBuilder]: At program point L1286(lines 1279 1314) the Hoare annotation is: (let ((.cse2 (= ~c_req_type~0 1)) (.cse14 (= ~m_run_pc~0 0)) (.cse9 (= ~c_req_type~0 0)) (.cse17 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse10 (not (= ~c_m_lock~0 1))) (.cse15 (= ~m_run_pc~0 6)) (.cse18 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse16 (= ~s_run_pc~0 0)) (.cse12 (= ~c_empty_req~0 1)) (.cse13 (= ~c_empty_rsp~0 1)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse3 (not (= ~s_run_st~0 0))) (.cse4 (= ~req_tt_a~0 0)) (.cse5 (not (= ~c_empty_req~0 0))) (.cse11 (= 2 ~s_run_pc~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~m_run_pc~0 3)) (.cse8 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse3 .cse4 .cse10 .cse11 .cse12 .cse6 .cse13 .cse8 .cse14) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse3 .cse16 .cse10 .cse12 .cse6 .cse13 .cse14) (and .cse9 .cse0 .cse3 .cse17 .cse4 .cse6 .cse13 .cse15 .cse8 .cse18) (and .cse9 .cse1 .cse17 .cse4 (or (and .cse0 .cse3 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse3 .cse5 .cse6 .cse15 .cse8 .cse18))) (and .cse0 .cse3 .cse11 .cse6 .cse13 .cse7) (and .cse3 .cse16 (not .cse12) .cse6 .cse13 .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,428 INFO L895 garLoopResultBuilder]: At program point L229(lines 222 266) the Hoare annotation is: (let ((.cse1 (= ~s_run_pc~0 0)) (.cse6 (= ~c_req_type~0 1)) (.cse0 (not (= ~s_run_st~0 0))) (.cse7 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse8 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse5 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse7 .cse2 .cse8 .cse3 .cse4 (= ~a_t~0 0) .cse9 .cse5) (and .cse6 .cse0 .cse7 .cse2 (= 2 ~s_run_pc~0) .cse8 (<= 0 ~a_t~0) .cse3 .cse4 .cse9 .cse5))) [2022-11-20 12:43:24,429 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2022-11-20 12:43:24,429 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2022-11-20 12:43:24,429 INFO L895 garLoopResultBuilder]: At program point L1221(lines 1214 1231) the Hoare annotation is: (let ((.cse0 (= ~c_empty_req~0 1)) (.cse1 (= 2 ~c_write_rsp_ev~0)) (.cse2 (= ~c_empty_rsp~0 1)) (.cse3 (= ~m_run_pc~0 ~c_m_lock~0)) (.cse4 (= ~m_run_pc~0 0)) (.cse5 (= ~m_run_pc~0 ~s_run_pc~0))) (or (and (= ~c_req_type~0 0) (<= 2 ~c_write_req_ev~0) (= ~req_tt_a~0 0) .cse0 .cse1 .cse2 (= ~a_t~0 0) .cse3 .cse4 .cse5) (and (not (= ~s_run_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5))) [2022-11-20 12:43:24,429 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2022-11-20 12:43:24,429 INFO L895 garLoopResultBuilder]: At program point L429(lines 422 457) 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)) (.cse6 (= ~m_run_pc~0 3)) (.cse7 (= ~a_t~0 0)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-11-20 12:43:24,430 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 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 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-11-20 12:43:24,430 INFO L895 garLoopResultBuilder]: At program point L363(lines 356 373) the Hoare annotation is: (let ((.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 0))) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse4 (= ~c_empty_rsp~0 1)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0)) (.cse7 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= ~s_run_st~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-11-20 12:43:24,430 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2022-11-20 12:43:24,430 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-11-20 12:43:24,431 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2022-11-20 12:43:24,432 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-11-20 12:43:24,432 INFO L895 garLoopResultBuilder]: At program point L1026(lines 1000 1027) the Hoare annotation is: (let ((.cse10 (not (= 2 ~s_run_pc~0))) (.cse8 (<= 0 |ULTIMATE.start_m_run_~a~0#1|)) (.cse1 (= ~c_req_type~0 1)) (.cse4 (= ~m_run_pc~0 3)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse9 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~m_run_pc~0 6)) (.cse5 (= ~a_t~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse2 (or (and .cse10 .cse0 (not (= ~c_m_lock~0 1)) .cse3 .cse11 .cse5) (and .cse10 .cse0 .cse3 .cse11 .cse5 .cse6))) (and .cse10 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse9 .cse2 .cse3 .cse11 .cse5 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)))) [2022-11-20 12:43:24,432 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-11-20 12:43:24,432 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 16 23) the Hoare annotation is: true [2022-11-20 12:43:24,432 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2022-11-20 12:43:24,437 INFO L444 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-11-20 12:43:24,440 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 12:43:24,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:43:24 BoogieIcfgContainer [2022-11-20 12:43:24,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 12:43:24,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:43:24,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:43:24,557 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:43:24,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:40:34" (3/4) ... [2022-11-20 12:43:24,561 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 12:43:24,570 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-11-20 12:43:24,600 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-11-20 12:43:24,602 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-20 12:43:24,603 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-20 12:43:24,604 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 12:43:24,754 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:43:24,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:43:24,755 INFO L158 Benchmark]: Toolchain (without parser) took 172388.79ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 137.1MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-20 12:43:24,756 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:43:24,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 507.04ms. Allocated memory is still 169.9MB. Free memory was 137.1MB in the beginning and 116.3MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 12:43:24,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.48ms. Allocated memory is still 169.9MB. Free memory was 116.3MB in the beginning and 112.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:43:24,757 INFO L158 Benchmark]: Boogie Preprocessor took 56.45ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 110.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:43:24,757 INFO L158 Benchmark]: RCFGBuilder took 1144.31ms. Allocated memory is still 169.9MB. Free memory was 110.1MB in the beginning and 67.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-20 12:43:24,758 INFO L158 Benchmark]: TraceAbstraction took 170402.45ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 66.8MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-20 12:43:24,758 INFO L158 Benchmark]: Witness Printer took 197.97ms. Allocated memory is still 3.6GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-20 12:43:24,760 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.35ms. Allocated memory is still 123.7MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 507.04ms. Allocated memory is still 169.9MB. Free memory was 137.1MB in the beginning and 116.3MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.48ms. Allocated memory is still 169.9MB. Free memory was 116.3MB in the beginning and 112.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.45ms. Allocated memory is still 169.9MB. Free memory was 112.9MB in the beginning and 110.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1144.31ms. Allocated memory is still 169.9MB. Free memory was 110.1MB in the beginning and 67.5MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 170402.45ms. Allocated memory was 169.9MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 66.8MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 197.97ms. Allocated memory is still 3.6GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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, 285 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 170.2s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 140.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11046 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11046 mSDsluCounter, 23337 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11920 mSDsCounter, 418 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2478 IncrementalHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 418 mSolverCounterUnsat, 11417 mSDtfsCounter, 2478 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 636 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=16, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 35918 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 118 PreInvPairs, 1464 NumberOfFragments, 11234 HoareAnnotationTreeSize, 118 FomulaSimplifications, 1123638 FormulaSimplificationTreeSizeReduction, 66.1s HoareSimplificationTime, 104 FomulaSimplificationsInter, 1872315 FormulaSimplificationTreeSizeReductionInter, 74.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 5550 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1918 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 639/655 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: 287]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 0) || (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 788]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 485]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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 == s_run_pc) && 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)) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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)) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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_pc == 6) && 1 <= a) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 495]: Loop Invariant Derived loop invariant: (((((((((((req_type___0 == 0 && !(2 == s_run_pc)) && 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) || (((((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: (((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) || (((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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)) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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) - InvariantResult [Line: 1263]: 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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 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) && a_t == 0) && a == 0) && m_run_pc == 0) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) && a == 0) && m_run_pc == 0)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: ((((((((((req_type___0 == 0 && c_req_type == 0) && !(s_run_st == 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) || ((((((((((req_type___0 == 0 && c_req_type == 0) && !(2 == s_run_pc)) && 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: 851]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || ((((((((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)) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((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)))) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 911]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 965]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((!(2 == s_run_pc) && 2 <= c_write_req_ev) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((((!(2 == s_run_pc) && 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))) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 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) && 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 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 1170]: Loop Invariant Derived loop invariant: ((((((((((((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && m_run_st == 0) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_m_lock == 1)) && m_run_st == 0) && 2 == s_run_pc) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == 0)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_req_type == 0 && 0 <= a) && ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && m_run_st == 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)) && m_run_st == 0) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0))) && req_a___0 == 0) && req_tt_a == 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)) || (((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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 && 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 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && m_run_st == 0) && 2 == s_run_pc) && 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) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0)) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((2 <= c_write_req_ev && !(s_run_st == 0)) && m_run_st == 0) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && !(s_run_st == 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) && 1 <= a) || (((((((((!(2 == s_run_pc) && 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: 494]: Loop Invariant Derived loop invariant: (((((((((((req_type___0 == 0 && !(2 == s_run_pc)) && 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) || (((((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 101]: Loop Invariant Derived loop invariant: (((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) || (((((((c_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0)) || (((((((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) && m_run_pc == 6) && a_t == 0)) || (((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0) || ((((((((((2 <= c_write_req_ev && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 238]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((((c_req_type == 1 && !(s_run_st == 0)) && 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_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 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: 414]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0) && a == 0) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((!(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_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && (((((((!(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)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0)))) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 0)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) - 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 690]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 348]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 1033]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 637]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) - InvariantResult [Line: 438]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 943]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 1041]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 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_st == 0)) && 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_pc == 0) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) && a_t == 0) && m_run_pc == 0)) || (((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) - 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 1236]: 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 0) || ((((((((!(2 == s_run_pc) && 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) && a_t == 0) && a == 0)) || (((((((!(2 == s_run_pc) && 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)) || ((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1)) || ((((((((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 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && a_t == 0)) || (((((((!(2 == s_run_pc) && 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) && a_t == 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) && a_t == 0) && a == 0) && m_run_pc == 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 == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 0)) || ((((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - 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) && !(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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && 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) && !(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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 810]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 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) && !(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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 0) || ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) && a_t == 0) && a == 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 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 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: 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) && !(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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 1049]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 674]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 134]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && !(s_run_st == 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) && 1 <= a) || (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) && a_t == 0) && a == 0) && m_run_pc == 0)) || (((((((((!(2 == s_run_pc) && 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) && !(s_run_st == 0)) && 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) && a == 0) && m_run_pc == 0)) || ((((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1087]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 756]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 1065]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) && a_t == 0) && a == 0) && m_run_pc == 0) || ((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0)) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0 - InvariantResult [Line: 1000]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 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 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) - InvariantResult [Line: 1167]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 422]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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)) || ((((((((((c_req_type == 1 && !(s_run_st == 0)) && 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) && m_run_pc == 0) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((((c_req_type == 1 && !(s_run_st == 0)) && 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_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 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: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((2 <= c_write_req_ev && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) && a == 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 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 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: 927]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 919]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 764]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 876]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev && 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) && 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) && 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) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 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 && 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) - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 860]: Loop Invariant Derived loop invariant: (((((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 0) && ((((((((!(2 == s_run_pc) && 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 == s_run_pc) && 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))) || (((((((((!(2 == s_run_pc) && 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 == s_run_pc)) && 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_req_type == 0 && !(2 == s_run_pc)) && 2 <= c_write_req_ev) && !(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) && 1 <= a) && a_t == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 0) || (((((((((c_req_type == 1 && !(s_run_st == 0)) && 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_pc == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && 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: 935]: Loop Invariant Derived loop invariant: (((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((c_req_type == 0 && 0 <= a) && req_a___0 == 0) && req_tt_a == 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 == 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))) && req_type == 0)) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 1317]: 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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 528]: Loop Invariant Derived loop invariant: ((((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((req_type___0 == 0 && !(2 == s_run_pc)) && 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: 1182]: 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) || ((((((!(s_run_st == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) - InvariantResult [Line: 268]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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)) || ((((!(s_run_st == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 1351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && 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) && a == 0) || (((((((((!(2 == s_run_pc) && 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) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && c_req_type == 0) && !(s_run_st == 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 == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a == 0) || ((((((((req_type___0 == 0 && c_req_type == 0) && (((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 0) || ((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 3))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) || (((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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: 564]: Loop Invariant Derived loop invariant: ((((((((((req_type___0 == 0 && c_req_type == 0) && !(s_run_st == 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) || ((((((((((req_type___0 == 0 && c_req_type == 0) && !(2 == s_run_pc)) && 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: 618]: Loop Invariant Derived loop invariant: ((((((((((req_type___0 == 0 && c_req_type == 0) && !(2 == s_run_pc)) && 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) || (((((!(s_run_st == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0)) || (((((!(s_run_st == 0) && !(c_empty_req == 1)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6) - InvariantResult [Line: 406]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 1057]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && m_run_pc == 6) && a_t == 0) && a == 0) && req_type == 0) || ((((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)) || ((((((!(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 && c_req_type == 1) && req_type == 1) && req_tt_a == 0) && m_run_pc == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: ((((((((((c_req_type == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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: 144]: Loop Invariant Derived loop invariant: (((((((((((((c_req_type == 0 && !(2 == s_run_pc)) && 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) && a_t == 0) && a == 0) && m_run_pc == 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 == 0)) && 2 == s_run_pc) && req_type == 1) && 0 <= a_t) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 0)) || ((((((((!(2 == s_run_pc) && !(s_run_st == 0)) && s_run_pc == 0) && !(c_m_lock == 1)) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a == 0) && m_run_pc == 0) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= c_write_req_ev && c_req_type == 1) && req_tt_a == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3) && 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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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_req_type == 0 && 2 <= c_write_req_ev) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 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_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 && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((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)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((!(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 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 580]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && c_req_type == 0) && !(s_run_st == 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 == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a == 0) || ((((((((req_type___0 == 0 && c_req_type == 0) && (((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 0) || ((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 3))) && req_a___0 == 0) && req_tt_a == 0) && !(c_empty_req == 1)) && 0 <= a_t) && 2 == c_write_rsp_ev) && a == 0) - InvariantResult [Line: 460]: Loop Invariant Derived loop invariant: (((((((((!(2 == s_run_pc) && 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) || (((((((((2 <= c_write_req_ev && !(s_run_st == 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 == 3) && a_t == 0) && a == 0) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((req_type___0 == 0 && 2 <= c_write_req_ev) && !(s_run_st == 0)) && 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) || ((((((((((req_type___0 == 0 && !(2 == s_run_pc)) && 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: 222]: Loop Invariant Derived loop invariant: ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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)) || ((((((((((c_req_type == 1 && !(s_run_st == 0)) && 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) && m_run_pc == 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) && !(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)) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 6)) || ((((((((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)) || ((((((!(s_run_st == 0) && s_run_pc == 0) && !(c_m_lock == 1)) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 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_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)))) || (((((2 <= c_write_req_ev && !(s_run_st == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || (((((!(s_run_st == 0) && s_run_pc == 0) && !(c_empty_req == 1)) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && m_run_pc == 3)) || ((((((((2 <= c_write_req_ev && 0 <= a) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == s_run_pc) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((2 <= c_write_req_ev && !(s_run_st == 0)) && 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) || ((((((((!(2 == s_run_pc) && 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: 588]: Loop Invariant Derived loop invariant: (((((((((req_type___0 == 0 && c_req_type == 0) && !(s_run_st == 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 == 0) || (c_empty_rsp == 1 && m_run_pc == 3))) && a == 0) || ((((((((req_type___0 == 0 && c_req_type == 0) && (((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 0) || ((!(2 == s_run_pc) && c_empty_rsp == 1) && m_run_pc == 3))) && 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-11-20 12:43:24,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ba99da4-823a-4c56-ad44-342e007a528d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE