./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/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_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 22:06:57,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:06:57,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:06:57,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:06:57,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:06:57,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:06:57,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:06:57,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:06:57,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:06:57,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:06:57,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:06:57,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:06:57,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:06:57,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:06:57,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:06:57,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:06:57,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:06:57,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:06:57,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:06:57,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:06:57,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:06:57,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:06:57,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:06:57,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:06:57,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:06:57,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:06:57,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:06:57,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:06:57,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:06:57,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:06:57,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:06:57,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:06:57,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:06:57,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:06:57,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:06:57,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:06:57,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:06:57,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:06:57,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:06:57,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:06:57,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:06:57,888 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 22:06:57,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:06:57,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:06:57,907 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:06:57,907 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:06:57,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:06:57,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:06:57,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:06:57,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:06:57,909 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:06:57,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:06:57,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:06:57,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:06:57,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:06:57,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:06:57,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:06:57,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:06:57,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:06:57,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:06:57,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:06:57,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:06:57,914 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:06:57,914 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/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_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8 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-12-13 22:06:58,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:06:58,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:06:58,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:06:58,117 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:06:58,117 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:06:58,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-12-13 22:07:00,726 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:07:00,910 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:07:00,911 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2022-12-13 22:07:00,921 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/data/b7dc2a5c2/e566adf7beab40b388f281aa696aa0d9/FLAG536148108 [2022-12-13 22:07:00,935 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/data/b7dc2a5c2/e566adf7beab40b388f281aa696aa0d9 [2022-12-13 22:07:00,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:07:00,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:07:00,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:07:00,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:07:00,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:07:00,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:07:00" (1/1) ... [2022-12-13 22:07:00,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1c7c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:00, skipping insertion in model container [2022-12-13 22:07:00,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:07:00" (1/1) ... [2022-12-13 22:07:00,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:07:00,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:07:01,105 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_2e8e1302-607a-4352-a7e1-a19bee6903fc/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-12-13 22:07:01,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:07:01,203 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:07:01,211 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_2e8e1302-607a-4352-a7e1-a19bee6903fc/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c[646,659] [2022-12-13 22:07:01,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:07:01,279 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:07:01,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01 WrapperNode [2022-12-13 22:07:01,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:07:01,280 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:07:01,280 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:07:01,280 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:07:01,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,325 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 854 [2022-12-13 22:07:01,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:07:01,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:07:01,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:07:01,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:07:01,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,355 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:07:01,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:07:01,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:07:01,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:07:01,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (1/1) ... [2022-12-13 22:07:01,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:07:01,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:01,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:07:01,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:07:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:07:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:07:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 22:07:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 22:07:01,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:07:01,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:07:01,496 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:07:01,498 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:07:02,073 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:07:02,082 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:07:02,082 INFO L300 CfgBuilder]: Removed 13 assume(true) statements. [2022-12-13 22:07:02,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:02 BoogieIcfgContainer [2022-12-13 22:07:02,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:07:02,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:07:02,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:07:02,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:07:02,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:07:00" (1/3) ... [2022-12-13 22:07:02,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f1f75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:07:02, skipping insertion in model container [2022-12-13 22:07:02,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:07:01" (2/3) ... [2022-12-13 22:07:02,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f1f75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:07:02, skipping insertion in model container [2022-12-13 22:07:02,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:02" (3/3) ... [2022-12-13 22:07:02,092 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2022-12-13 22:07:02,109 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:07:02,109 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 22:07:02,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:07:02,160 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;@2e1ed8e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:07:02,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 22:07:02,165 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-12-13 22:07:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 22:07:02,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:02,172 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-12-13 22:07:02,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1773166344, now seen corresponding path program 1 times [2022-12-13 22:07:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:02,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304836567] [2022-12-13 22:07:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304836567] [2022-12-13 22:07:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304836567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:02,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422822444] [2022-12-13 22:07:02,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:02,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:02,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:02,405 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-12-13 22:07:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:02,721 INFO L93 Difference]: Finished difference Result 754 states and 1347 transitions. [2022-12-13 22:07:02,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:02,722 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-12-13 22:07:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:02,730 INFO L225 Difference]: With dead ends: 754 [2022-12-13 22:07:02,730 INFO L226 Difference]: Without dead ends: 454 [2022-12-13 22:07:02,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:02,735 INFO L413 NwaCegarLoop]: 481 mSDtfsCounter, 269 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:02,736 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.2s Time] [2022-12-13 22:07:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-12-13 22:07:02,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-12-13 22:07:02,794 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-12-13 22:07:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 685 transitions. [2022-12-13 22:07:02,797 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 685 transitions. Word has length 20 [2022-12-13 22:07:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:02,797 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 685 transitions. [2022-12-13 22:07:02,797 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-12-13 22:07:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 685 transitions. [2022-12-13 22:07:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 22:07:02,798 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:02,798 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-12-13 22:07:02,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:07:02,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 282207273, now seen corresponding path program 1 times [2022-12-13 22:07:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823903391] [2022-12-13 22:07:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:02,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:02,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823903391] [2022-12-13 22:07:02,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823903391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:02,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:02,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 22:07:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962425924] [2022-12-13 22:07:02,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:02,878 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-12-13 22:07:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:02,982 INFO L93 Difference]: Finished difference Result 1201 states and 1897 transitions. [2022-12-13 22:07:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:02,983 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-12-13 22:07:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:02,986 INFO L225 Difference]: With dead ends: 1201 [2022-12-13 22:07:02,986 INFO L226 Difference]: Without dead ends: 775 [2022-12-13 22:07:02,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:02,988 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 390 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 22:07:02,988 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-12-13 22:07:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-12-13 22:07:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 682. [2022-12-13 22:07:03,019 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-12-13 22:07:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1063 transitions. [2022-12-13 22:07:03,021 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1063 transitions. Word has length 24 [2022-12-13 22:07:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:03,021 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 1063 transitions. [2022-12-13 22:07:03,021 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-12-13 22:07:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1063 transitions. [2022-12-13 22:07:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 22:07:03,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:03,023 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-12-13 22:07:03,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:07:03,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1461842607, now seen corresponding path program 1 times [2022-12-13 22:07:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899848841] [2022-12-13 22:07:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:03,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:03,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899848841] [2022-12-13 22:07:03,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899848841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:03,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:03,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:03,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982284886] [2022-12-13 22:07:03,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:03,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:03,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:03,110 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-12-13 22:07:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:03,397 INFO L93 Difference]: Finished difference Result 1632 states and 2556 transitions. [2022-12-13 22:07:03,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:03,397 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-12-13 22:07:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:03,399 INFO L225 Difference]: With dead ends: 1632 [2022-12-13 22:07:03,400 INFO L226 Difference]: Without dead ends: 964 [2022-12-13 22:07:03,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:03,401 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:03,402 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.2s Time] [2022-12-13 22:07:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-12-13 22:07:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 848. [2022-12-13 22:07:03,430 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-12-13 22:07:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1330 transitions. [2022-12-13 22:07:03,432 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1330 transitions. Word has length 55 [2022-12-13 22:07:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:03,432 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1330 transitions. [2022-12-13 22:07:03,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-12-13 22:07:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1330 transitions. [2022-12-13 22:07:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 22:07:03,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:03,434 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-12-13 22:07:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:07:03,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 264726864, now seen corresponding path program 1 times [2022-12-13 22:07:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:03,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829515223] [2022-12-13 22:07:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:03,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:03,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829515223] [2022-12-13 22:07:03,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829515223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:03,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:03,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528352874] [2022-12-13 22:07:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:03,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:03,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:03,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:03,502 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-12-13 22:07:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:03,770 INFO L93 Difference]: Finished difference Result 2112 states and 3294 transitions. [2022-12-13 22:07:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:03,771 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-12-13 22:07:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:03,779 INFO L225 Difference]: With dead ends: 2112 [2022-12-13 22:07:03,780 INFO L226 Difference]: Without dead ends: 1278 [2022-12-13 22:07:03,781 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-12-13 22:07:03,783 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 427 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:03,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1535 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 22:07:03,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-12-13 22:07:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2022-12-13 22:07:03,850 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-12-13 22:07:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1854 transitions. [2022-12-13 22:07:03,856 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1854 transitions. Word has length 58 [2022-12-13 22:07:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1854 transitions. [2022-12-13 22:07:03,857 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-12-13 22:07:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1854 transitions. [2022-12-13 22:07:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 22:07:03,860 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:03,861 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-12-13 22:07:03,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:07:03,861 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-12-13 22:07:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:03,861 INFO L85 PathProgramCache]: Analyzing trace with hash 93056873, now seen corresponding path program 1 times [2022-12-13 22:07:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:03,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084681181] [2022-12-13 22:07:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:03,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:03,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084681181] [2022-12-13 22:07:03,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084681181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:03,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:03,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:03,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587011684] [2022-12-13 22:07:03,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:03,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:03,956 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-12-13 22:07:04,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:04,342 INFO L93 Difference]: Finished difference Result 3750 states and 5723 transitions. [2022-12-13 22:07:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:04,343 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-12-13 22:07:04,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:04,360 INFO L225 Difference]: With dead ends: 3750 [2022-12-13 22:07:04,360 INFO L226 Difference]: Without dead ends: 2570 [2022-12-13 22:07:04,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:04,364 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 685 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:04,364 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.2s Time] [2022-12-13 22:07:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-12-13 22:07:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2224. [2022-12-13 22:07:04,462 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-12-13 22:07:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3407 transitions. [2022-12-13 22:07:04,467 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3407 transitions. Word has length 69 [2022-12-13 22:07:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:04,468 INFO L495 AbstractCegarLoop]: Abstraction has 2224 states and 3407 transitions. [2022-12-13 22:07:04,468 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-12-13 22:07:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3407 transitions. [2022-12-13 22:07:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 22:07:04,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:04,469 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-12-13 22:07:04,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:07:04,470 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-12-13 22:07:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:04,470 INFO L85 PathProgramCache]: Analyzing trace with hash 848997769, now seen corresponding path program 1 times [2022-12-13 22:07:04,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:04,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979356441] [2022-12-13 22:07:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:04,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:04,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979356441] [2022-12-13 22:07:04,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979356441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:04,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:04,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128650884] [2022-12-13 22:07:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:04,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:04,502 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-12-13 22:07:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:04,620 INFO L93 Difference]: Finished difference Result 4678 states and 7256 transitions. [2022-12-13 22:07:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:04,621 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-12-13 22:07:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:04,628 INFO L225 Difference]: With dead ends: 4678 [2022-12-13 22:07:04,628 INFO L226 Difference]: Without dead ends: 2467 [2022-12-13 22:07:04,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:04,630 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-12-13 22:07:04,631 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-12-13 22:07:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2022-12-13 22:07:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2260. [2022-12-13 22:07:04,692 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-12-13 22:07:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3535 transitions. [2022-12-13 22:07:04,697 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3535 transitions. Word has length 69 [2022-12-13 22:07:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:04,698 INFO L495 AbstractCegarLoop]: Abstraction has 2260 states and 3535 transitions. [2022-12-13 22:07:04,698 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-12-13 22:07:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3535 transitions. [2022-12-13 22:07:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-12-13 22:07:04,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:04,700 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-12-13 22:07:04,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:07:04,700 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-12-13 22:07:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1060133084, now seen corresponding path program 1 times [2022-12-13 22:07:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:04,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979037972] [2022-12-13 22:07:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:04,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:04,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979037972] [2022-12-13 22:07:04,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979037972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:04,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:04,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397930741] [2022-12-13 22:07:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:04,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:04,737 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-12-13 22:07:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:04,887 INFO L93 Difference]: Finished difference Result 4815 states and 7522 transitions. [2022-12-13 22:07:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:04,888 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-12-13 22:07:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:04,897 INFO L225 Difference]: With dead ends: 4815 [2022-12-13 22:07:04,897 INFO L226 Difference]: Without dead ends: 2567 [2022-12-13 22:07:04,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:04,900 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:04,900 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.0s Time] [2022-12-13 22:07:04,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-12-13 22:07:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2022-12-13 22:07:04,972 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-12-13 22:07:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3975 transitions. [2022-12-13 22:07:04,978 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3975 transitions. Word has length 87 [2022-12-13 22:07:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:04,978 INFO L495 AbstractCegarLoop]: Abstraction has 2553 states and 3975 transitions. [2022-12-13 22:07:04,979 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-12-13 22:07:04,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3975 transitions. [2022-12-13 22:07:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-12-13 22:07:04,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:04,981 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:07:04,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:07:04,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:04,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 809233504, now seen corresponding path program 1 times [2022-12-13 22:07:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:04,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795642056] [2022-12-13 22:07:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:05,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:05,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795642056] [2022-12-13 22:07:05,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795642056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:05,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:05,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418324676] [2022-12-13 22:07:05,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:05,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:05,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:05,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:05,026 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-12-13 22:07:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:05,358 INFO L93 Difference]: Finished difference Result 5993 states and 9430 transitions. [2022-12-13 22:07:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:05,358 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-12-13 22:07:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:05,366 INFO L225 Difference]: With dead ends: 5993 [2022-12-13 22:07:05,366 INFO L226 Difference]: Without dead ends: 3616 [2022-12-13 22:07:05,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:05,370 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12-13 22:07:05,370 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-12-13 22:07:05,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2022-12-13 22:07:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2983. [2022-12-13 22:07:05,491 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-12-13 22:07:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4420 transitions. [2022-12-13 22:07:05,498 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4420 transitions. Word has length 96 [2022-12-13 22:07:05,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:05,499 INFO L495 AbstractCegarLoop]: Abstraction has 2983 states and 4420 transitions. [2022-12-13 22:07:05,499 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-12-13 22:07:05,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4420 transitions. [2022-12-13 22:07:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 22:07:05,501 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:05,501 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-12-13 22:07:05,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:07:05,502 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:05,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1044800824, now seen corresponding path program 1 times [2022-12-13 22:07:05,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:05,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514233660] [2022-12-13 22:07:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 22:07:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:05,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514233660] [2022-12-13 22:07:05,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514233660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:05,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:05,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408455608] [2022-12-13 22:07:05,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:05,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:05,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:05,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:05,578 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-12-13 22:07:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:05,887 INFO L93 Difference]: Finished difference Result 5993 states and 8876 transitions. [2022-12-13 22:07:05,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:07:05,887 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-12-13 22:07:05,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:05,897 INFO L225 Difference]: With dead ends: 5993 [2022-12-13 22:07:05,898 INFO L226 Difference]: Without dead ends: 3227 [2022-12-13 22:07:05,901 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-12-13 22:07:05,902 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 615 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12-13 22:07:05,902 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-12-13 22:07:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2022-12-13 22:07:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3152. [2022-12-13 22:07:06,064 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-12-13 22:07:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4654 transitions. [2022-12-13 22:07:06,071 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4654 transitions. Word has length 104 [2022-12-13 22:07:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:06,071 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4654 transitions. [2022-12-13 22:07:06,071 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-12-13 22:07:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4654 transitions. [2022-12-13 22:07:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-12-13 22:07:06,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:06,074 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-12-13 22:07:06,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:07:06,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:06,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2134366008, now seen corresponding path program 1 times [2022-12-13 22:07:06,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:06,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266329885] [2022-12-13 22:07:06,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:06,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266329885] [2022-12-13 22:07:06,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266329885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:06,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:06,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826602095] [2022-12-13 22:07:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:06,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:06,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:06,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:06,144 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-12-13 22:07:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:06,320 INFO L93 Difference]: Finished difference Result 6118 states and 9062 transitions. [2022-12-13 22:07:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:06,321 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-12-13 22:07:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:06,328 INFO L225 Difference]: With dead ends: 6118 [2022-12-13 22:07:06,328 INFO L226 Difference]: Without dead ends: 3152 [2022-12-13 22:07:06,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:06,331 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-12-13 22:07:06,331 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-12-13 22:07:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2022-12-13 22:07:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2022-12-13 22:07:06,461 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-12-13 22:07:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4553 transitions. [2022-12-13 22:07:06,465 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4553 transitions. Word has length 104 [2022-12-13 22:07:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:06,466 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4553 transitions. [2022-12-13 22:07:06,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4553 transitions. [2022-12-13 22:07:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-12-13 22:07:06,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:06,467 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-12-13 22:07:06,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:07:06,467 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-12-13 22:07:06,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:06,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1174128625, now seen corresponding path program 1 times [2022-12-13 22:07:06,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:06,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296957532] [2022-12-13 22:07:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:06,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 22:07:06,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:06,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296957532] [2022-12-13 22:07:06,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296957532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:06,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:06,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826155300] [2022-12-13 22:07:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:06,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:06,495 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-12-13 22:07:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:06,766 INFO L93 Difference]: Finished difference Result 8079 states and 11760 transitions. [2022-12-13 22:07:06,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:06,766 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-12-13 22:07:06,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:06,777 INFO L225 Difference]: With dead ends: 8079 [2022-12-13 22:07:06,777 INFO L226 Difference]: Without dead ends: 4939 [2022-12-13 22:07:06,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:06,781 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 314 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:06,781 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.0s Time] [2022-12-13 22:07:06,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2022-12-13 22:07:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4449. [2022-12-13 22:07:06,920 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-12-13 22:07:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6462 transitions. [2022-12-13 22:07:06,942 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6462 transitions. Word has length 105 [2022-12-13 22:07:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:06,942 INFO L495 AbstractCegarLoop]: Abstraction has 4449 states and 6462 transitions. [2022-12-13 22:07:06,943 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-12-13 22:07:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6462 transitions. [2022-12-13 22:07:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 22:07:06,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:06,946 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-12-13 22:07:06,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:07:06,946 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:06,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:06,946 INFO L85 PathProgramCache]: Analyzing trace with hash -352874665, now seen corresponding path program 1 times [2022-12-13 22:07:06,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:06,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379439042] [2022-12-13 22:07:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 22:07:07,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:07,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379439042] [2022-12-13 22:07:07,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379439042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:07,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:07,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613814679] [2022-12-13 22:07:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:07,016 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-12-13 22:07:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:07,543 INFO L93 Difference]: Finished difference Result 11981 states and 17278 transitions. [2022-12-13 22:07:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:07:07,544 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-12-13 22:07:07,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:07,554 INFO L225 Difference]: With dead ends: 11981 [2022-12-13 22:07:07,554 INFO L226 Difference]: Without dead ends: 7435 [2022-12-13 22:07:07,558 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-12-13 22:07:07,559 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.2s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:07,559 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.2s Time] [2022-12-13 22:07:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-12-13 22:07:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6646. [2022-12-13 22:07:07,778 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-12-13 22:07:07,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 9522 transitions. [2022-12-13 22:07:07,786 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 9522 transitions. Word has length 107 [2022-12-13 22:07:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:07,786 INFO L495 AbstractCegarLoop]: Abstraction has 6646 states and 9522 transitions. [2022-12-13 22:07:07,786 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-12-13 22:07:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9522 transitions. [2022-12-13 22:07:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-12-13 22:07:07,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:07,789 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-12-13 22:07:07,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:07:07,789 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:07,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1728043503, now seen corresponding path program 1 times [2022-12-13 22:07:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:07,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5460426] [2022-12-13 22:07:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:07,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5460426] [2022-12-13 22:07:07,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5460426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:07,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:07,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:07:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806121217] [2022-12-13 22:07:07,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:07,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:07:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:07,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:07:07,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:07,863 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-12-13 22:07:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:08,914 INFO L93 Difference]: Finished difference Result 29994 states and 42677 transitions. [2022-12-13 22:07:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 22:07:08,914 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-12-13 22:07:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:08,954 INFO L225 Difference]: With dead ends: 29994 [2022-12-13 22:07:08,954 INFO L226 Difference]: Without dead ends: 23682 [2022-12-13 22:07:08,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:07:08,964 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-12-13 22:07:08,964 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-12-13 22:07:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23682 states. [2022-12-13 22:07:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23682 to 10146. [2022-12-13 22:07:09,562 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-12-13 22:07:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 14577 transitions. [2022-12-13 22:07:09,577 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 14577 transitions. Word has length 113 [2022-12-13 22:07:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:09,577 INFO L495 AbstractCegarLoop]: Abstraction has 10146 states and 14577 transitions. [2022-12-13 22:07:09,578 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-12-13 22:07:09,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 14577 transitions. [2022-12-13 22:07:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-13 22:07:09,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:09,580 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-12-13 22:07:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:07:09,581 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1864219126, now seen corresponding path program 1 times [2022-12-13 22:07:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:09,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773345433] [2022-12-13 22:07:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 22:07:09,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:09,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773345433] [2022-12-13 22:07:09,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773345433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:09,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:09,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740153152] [2022-12-13 22:07:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:09,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:09,622 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-12-13 22:07:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:10,132 INFO L93 Difference]: Finished difference Result 20067 states and 28850 transitions. [2022-12-13 22:07:10,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:10,133 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-12-13 22:07:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:10,143 INFO L225 Difference]: With dead ends: 20067 [2022-12-13 22:07:10,143 INFO L226 Difference]: Without dead ends: 10005 [2022-12-13 22:07:10,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:10,151 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 348 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-13 22:07:10,151 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-12-13 22:07:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10005 states. [2022-12-13 22:07:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10005 to 9944. [2022-12-13 22:07:10,602 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-12-13 22:07:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 13881 transitions. [2022-12-13 22:07:10,612 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 13881 transitions. Word has length 115 [2022-12-13 22:07:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:10,613 INFO L495 AbstractCegarLoop]: Abstraction has 9944 states and 13881 transitions. [2022-12-13 22:07:10,613 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-12-13 22:07:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 13881 transitions. [2022-12-13 22:07:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-12-13 22:07:10,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:10,614 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-12-13 22:07:10,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:07:10,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:10,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1933744648, now seen corresponding path program 1 times [2022-12-13 22:07:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:10,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877248141] [2022-12-13 22:07:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:10,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:10,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:07:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877248141] [2022-12-13 22:07:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877248141] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:07:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290568355] [2022-12-13 22:07:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:10,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:10,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:07:10,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 22:07:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:10,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 22:07:10,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:07:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 22:07:10,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:07:10,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290568355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:10,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:07:10,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-13 22:07:10,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873917553] [2022-12-13 22:07:10,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:10,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:10,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:10,818 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-12-13 22:07:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:11,442 INFO L93 Difference]: Finished difference Result 18599 states and 26006 transitions. [2022-12-13 22:07:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:11,443 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-12-13 22:07:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:11,452 INFO L225 Difference]: With dead ends: 18599 [2022-12-13 22:07:11,452 INFO L226 Difference]: Without dead ends: 8598 [2022-12-13 22:07:11,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:11,460 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-12-13 22:07:11,460 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-12-13 22:07:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2022-12-13 22:07:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8027. [2022-12-13 22:07:11,977 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-12-13 22:07:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8027 states to 8027 states and 11173 transitions. [2022-12-13 22:07:11,985 INFO L78 Accepts]: Start accepts. Automaton has 8027 states and 11173 transitions. Word has length 115 [2022-12-13 22:07:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:11,986 INFO L495 AbstractCegarLoop]: Abstraction has 8027 states and 11173 transitions. [2022-12-13 22:07:11,986 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-12-13 22:07:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8027 states and 11173 transitions. [2022-12-13 22:07:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-12-13 22:07:11,987 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:11,987 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-12-13 22:07:11,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:07:12,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 22:07:12,188 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:12,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1930156709, now seen corresponding path program 1 times [2022-12-13 22:07:12,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242579080] [2022-12-13 22:07:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 22:07:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242579080] [2022-12-13 22:07:12,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242579080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:12,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:12,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756898820] [2022-12-13 22:07:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:12,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:07:12,251 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-12-13 22:07:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:13,179 INFO L93 Difference]: Finished difference Result 18694 states and 25971 transitions. [2022-12-13 22:07:13,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:07:13,180 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-12-13 22:07:13,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:13,197 INFO L225 Difference]: With dead ends: 18694 [2022-12-13 22:07:13,197 INFO L226 Difference]: Without dead ends: 18690 [2022-12-13 22:07:13,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:13,201 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-12-13 22:07:13,201 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-12-13 22:07:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18690 states. [2022-12-13 22:07:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18690 to 14601. [2022-12-13 22:07:13,970 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-12-13 22:07:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20506 transitions. [2022-12-13 22:07:13,994 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20506 transitions. Word has length 117 [2022-12-13 22:07:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:13,994 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 20506 transitions. [2022-12-13 22:07:13,994 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-12-13 22:07:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20506 transitions. [2022-12-13 22:07:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-12-13 22:07:13,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:13,995 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-12-13 22:07:13,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:07:13,996 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1274447402, now seen corresponding path program 1 times [2022-12-13 22:07:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:13,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062506955] [2022-12-13 22:07:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 22:07:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062506955] [2022-12-13 22:07:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062506955] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:07:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287862994] [2022-12-13 22:07:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:14,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:07:14,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 22:07:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:14,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 22:07:14,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:07:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 22:07:14,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:07:14,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287862994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:14,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:07:14,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-12-13 22:07:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219058482] [2022-12-13 22:07:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:14,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:07:14,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:14,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:07:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:07:14,229 INFO L87 Difference]: Start difference. First operand 14601 states and 20506 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:15,673 INFO L93 Difference]: Finished difference Result 22151 states and 31181 transitions. [2022-12-13 22:07:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:07:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 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-12-13 22:07:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:15,693 INFO L225 Difference]: With dead ends: 22151 [2022-12-13 22:07:15,693 INFO L226 Difference]: Without dead ends: 22150 [2022-12-13 22:07:15,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:07:15,698 INFO L413 NwaCegarLoop]: 529 mSDtfsCounter, 597 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:15,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 910 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:07:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22150 states. [2022-12-13 22:07:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22150 to 14600. [2022-12-13 22:07:16,548 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-12-13 22:07:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 20485 transitions. [2022-12-13 22:07:16,564 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 20485 transitions. Word has length 122 [2022-12-13 22:07:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:16,565 INFO L495 AbstractCegarLoop]: Abstraction has 14600 states and 20485 transitions. [2022-12-13 22:07:16,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 20485 transitions. [2022-12-13 22:07:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-12-13 22:07:16,566 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:16,566 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-12-13 22:07:16,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 22:07:16,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 22:07:16,768 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:16,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 853164033, now seen corresponding path program 1 times [2022-12-13 22:07:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103491114] [2022-12-13 22:07:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:16,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 22:07:16,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:16,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103491114] [2022-12-13 22:07:16,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103491114] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:07:16,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942279968] [2022-12-13 22:07:16,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:16,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:16,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:07:16,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 22:07:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:16,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 22:07:16,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:07:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:07:16,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:07:16,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942279968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:16,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:07:16,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 22:07:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256761913] [2022-12-13 22:07:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:16,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:16,981 INFO L87 Difference]: Start difference. First operand 14600 states and 20485 transitions. Second operand has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:18,124 INFO L93 Difference]: Finished difference Result 19686 states and 27454 transitions. [2022-12-13 22:07:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:18,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 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-12-13 22:07:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:18,143 INFO L225 Difference]: With dead ends: 19686 [2022-12-13 22:07:18,143 INFO L226 Difference]: Without dead ends: 19685 [2022-12-13 22:07:18,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:07:18,148 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 295 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:18,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 918 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:07:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19685 states. [2022-12-13 22:07:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19685 to 14599. [2022-12-13 22:07:19,212 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-12-13 22:07:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 20464 transitions. [2022-12-13 22:07:19,230 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 20464 transitions. Word has length 123 [2022-12-13 22:07:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:19,231 INFO L495 AbstractCegarLoop]: Abstraction has 14599 states and 20464 transitions. [2022-12-13 22:07:19,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 20464 transitions. [2022-12-13 22:07:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-12-13 22:07:19,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:19,235 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-12-13 22:07:19,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 22:07:19,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:19,437 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1222314496, now seen corresponding path program 1 times [2022-12-13 22:07:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:19,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275787691] [2022-12-13 22:07:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:07:19,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:19,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275787691] [2022-12-13 22:07:19,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275787691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:19,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:19,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 22:07:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112496198] [2022-12-13 22:07:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 22:07:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:19,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 22:07:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:19,498 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-12-13 22:07:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:20,049 INFO L93 Difference]: Finished difference Result 18721 states and 26068 transitions. [2022-12-13 22:07:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 22:07:20,050 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-12-13 22:07:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:20,053 INFO L225 Difference]: With dead ends: 18721 [2022-12-13 22:07:20,053 INFO L226 Difference]: Without dead ends: 4005 [2022-12-13 22:07:20,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 22:07:20,061 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:20,061 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.1s Time] [2022-12-13 22:07:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-12-13 22:07:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3136. [2022-12-13 22:07:20,294 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-12-13 22:07:20,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 3627 transitions. [2022-12-13 22:07:20,297 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 3627 transitions. Word has length 205 [2022-12-13 22:07:20,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:20,297 INFO L495 AbstractCegarLoop]: Abstraction has 3136 states and 3627 transitions. [2022-12-13 22:07:20,297 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-12-13 22:07:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3627 transitions. [2022-12-13 22:07:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-12-13 22:07:20,299 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:20,299 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-12-13 22:07:20,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 22:07:20,299 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -692101379, now seen corresponding path program 1 times [2022-12-13 22:07:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:20,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555900862] [2022-12-13 22:07:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:20,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 22:07:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555900862] [2022-12-13 22:07:20,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555900862] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:07:20,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311030346] [2022-12-13 22:07:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:07:20,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:07:20,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 22:07:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:20,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 22:07:20,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:07:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 22:07:20,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 22:07:20,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311030346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:20,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 22:07:20,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 22:07:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889968052] [2022-12-13 22:07:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:20,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:07:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:07:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:07:20,594 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-12-13 22:07:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:20,815 INFO L93 Difference]: Finished difference Result 4335 states and 5043 transitions. [2022-12-13 22:07:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:07:20,816 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-12-13 22:07:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:20,818 INFO L225 Difference]: With dead ends: 4335 [2022-12-13 22:07:20,818 INFO L226 Difference]: Without dead ends: 1923 [2022-12-13 22:07:20,819 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-12-13 22:07:20,820 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 486 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:07:20,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 693 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:07:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2022-12-13 22:07:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1560. [2022-12-13 22:07:20,953 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-12-13 22:07:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1789 transitions. [2022-12-13 22:07:20,954 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1789 transitions. Word has length 220 [2022-12-13 22:07:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:20,954 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1789 transitions. [2022-12-13 22:07:20,955 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-12-13 22:07:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1789 transitions. [2022-12-13 22:07:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-12-13 22:07:20,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:20,956 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-12-13 22:07:20,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 22:07:21,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:07:21,158 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 980623008, now seen corresponding path program 1 times [2022-12-13 22:07:21,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:21,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538994007] [2022-12-13 22:07:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:21,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 22:07:21,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:21,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538994007] [2022-12-13 22:07:21,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538994007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:21,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:21,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:07:21,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660554723] [2022-12-13 22:07:21,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:21,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:07:21,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:21,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:07:21,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:21,257 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-12-13 22:07:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:21,647 INFO L93 Difference]: Finished difference Result 3043 states and 3530 transitions. [2022-12-13 22:07:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:07:21,647 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-12-13 22:07:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:21,649 INFO L225 Difference]: With dead ends: 3043 [2022-12-13 22:07:21,649 INFO L226 Difference]: Without dead ends: 2453 [2022-12-13 22:07:21,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:07:21,650 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-12-13 22:07:21,651 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-12-13 22:07:21,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2022-12-13 22:07:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 1524. [2022-12-13 22:07:21,804 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-12-13 22:07:21,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1729 transitions. [2022-12-13 22:07:21,805 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1729 transitions. Word has length 225 [2022-12-13 22:07:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:21,805 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1729 transitions. [2022-12-13 22:07:21,805 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-12-13 22:07:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1729 transitions. [2022-12-13 22:07:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-12-13 22:07:21,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:07:21,807 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-12-13 22:07:21,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 22:07:21,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-12-13 22:07:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:07:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1076956137, now seen corresponding path program 1 times [2022-12-13 22:07:21,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:07:21,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247928439] [2022-12-13 22:07:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:07:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:07:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:07:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-13 22:07:21,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:07:21,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247928439] [2022-12-13 22:07:21,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247928439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:07:21,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:07:21,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:07:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118016769] [2022-12-13 22:07:21,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:07:21,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:07:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:07:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:07:21,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:07:21,886 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-12-13 22:07:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:07:22,214 INFO L93 Difference]: Finished difference Result 2427 states and 2764 transitions. [2022-12-13 22:07:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:07:22,214 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-12-13 22:07:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:07:22,215 INFO L225 Difference]: With dead ends: 2427 [2022-12-13 22:07:22,215 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 22:07:22,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:07:22,216 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-12-13 22:07:22,216 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-12-13 22:07:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 22:07:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 22:07:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:07:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 22:07:22,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2022-12-13 22:07:22,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:07:22,217 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:07:22,217 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-12-13 22:07:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 22:07:22,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 22:07:22,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 22:07:22,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 22:07:22,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 22:07:22,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 22:07:22,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 22:07:22,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 22:07:22,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 22:07:22,220 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 22:07:22,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 22:07:22,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 22:07:30,715 WARN L233 SmtUtils]: Spent 6.79s 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-12-13 22:09:06,776 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-12-13 22:09:06,777 INFO L895 garLoopResultBuilder]: At program point $Ultimate##406(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-12-13 22:09:06,777 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2022-12-13 22:09:06,777 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2022-12-13 22:09:06,777 INFO L895 garLoopResultBuilder]: At program point $Ultimate##412(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-12-13 22:09:06,777 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2022-12-13 22:09:06,778 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2022-12-13 22:09:06,778 INFO L895 garLoopResultBuilder]: At program point $Ultimate##418(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-12-13 22:09:06,778 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2022-12-13 22:09:06,778 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2022-12-13 22:09:06,778 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2022-12-13 22:09:06,778 INFO L895 garLoopResultBuilder]: At program point $Ultimate##424(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-12-13 22:09:06,779 INFO L895 garLoopResultBuilder]: At program point s_run_returnLabel#1(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-12-13 22:09:06,779 INFO L895 garLoopResultBuilder]: At program point $Ultimate##430(lines 796 804) 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-12-13 22:09:06,779 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2022-12-13 22:09:06,779 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2022-12-13 22:09:06,779 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2022-12-13 22:09:06,779 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2022-12-13 22:09:06,779 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2022-12-13 22:09:06,779 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2022-12-13 22:09:06,779 INFO L895 garLoopResultBuilder]: At program point $Ultimate##200(lines 364 372) 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-12-13 22:09:06,780 INFO L895 garLoopResultBuilder]: At program point $Ultimate##442(lines 818 826) 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-12-13 22:09:06,780 INFO L895 garLoopResultBuilder]: At program point $Ultimate##600(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-12-13 22:09:06,780 INFO L895 garLoopResultBuilder]: At program point $Ultimate##606(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-12-13 22:09:06,780 INFO L895 garLoopResultBuilder]: At program point $Ultimate##612(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-12-13 22:09:06,781 INFO L895 garLoopResultBuilder]: At program point $Ultimate##618(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-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L895 garLoopResultBuilder]: At program point $Ultimate##624(lines 1303 1311) 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-12-13 22:09:06,781 INFO L895 garLoopResultBuilder]: At program point m_run_returnLabel#1(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-12-13 22:09:06,781 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-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L895 garLoopResultBuilder]: At program point $Ultimate##636(lines 1325 1333) 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-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2022-12-13 22:09:06,781 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-12-13 22:09:06,782 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-12-13 22:09:06,782 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1351 1376) the Hoare annotation is: true [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2022-12-13 22:09:06,782 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-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2022-12-13 22:09:06,782 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-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2022-12-13 22:09:06,782 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_MUTEX2#1(lines 101 843) the Hoare annotation is: false [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2022-12-13 22:09:06,783 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-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2022-12-13 22:09:06,783 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_GET2#1(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-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L895 garLoopResultBuilder]: At program point $Ultimate##299(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-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L895 garLoopResultBuilder]: At program point s_memory_read_returnLabel#1(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-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_GET#1(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-12-13 22:09:06,784 INFO L895 garLoopResultBuilder]: At program point s_run_L_SLAVE_RUN_PUT#1(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-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2022-12-13 22:09:06,784 INFO L895 garLoopResultBuilder]: At program point $Ultimate##494(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-12-13 22:09:06,785 INFO L895 garLoopResultBuilder]: At program point $Ultimate##251(lines 446 454) 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-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2022-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2022-12-13 22:09:06,785 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-12-13 22:09:06,785 INFO L895 garLoopResultBuilder]: At program point $Ultimate##263(lines 468 476) 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-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2022-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2022-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2022-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2022-12-13 22:09:06,785 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-12-13 22:09:06,785 INFO L895 garLoopResultBuilder]: At program point $Ultimate##212(lines 386 394) 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-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 22:09:06,785 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-12-13 22:09:06,785 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L895 garLoopResultBuilder]: At program point $Ultimate##227(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-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L895 garLoopResultBuilder]: At program point $Ultimate##233(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-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L895 garLoopResultBuilder]: At program point $Ultimate##239(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-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2022-12-13 22:09:06,786 INFO L895 garLoopResultBuilder]: At program point $Ultimate##482(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-12-13 22:09:06,786 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-12-13 22:09:06,786 INFO L895 garLoopResultBuilder]: At program point $Ultimate##488(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-12-13 22:09:06,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##245(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-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_PUT2#1(lines 101 843) the Hoare annotation is: false [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##305(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)) (.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-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2022-12-13 22:09:06,787 INFO L895 garLoopResultBuilder]: At program point $Ultimate##550(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-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##311(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-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##317(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-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##556(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-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##562(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-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##323(lines 604 612) 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-12-13 22:09:06,788 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-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##500(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-12-13 22:09:06,788 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2022-12-13 22:09:06,788 INFO L895 garLoopResultBuilder]: At program point $Ultimate##506(lines 951 959) 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-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2022-12-13 22:09:06,789 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-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L895 garLoopResultBuilder]: At program point $Ultimate##518(lines 973 981) 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-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) 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-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2022-12-13 22:09:06,789 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2022-12-13 22:09:06,790 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-12-13 22:09:06,790 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2022-12-13 22:09:06,790 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-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2022-12-13 22:09:06,790 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) 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-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) 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-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2022-12-13 22:09:06,791 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-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 1167 1350) the Hoare annotation is: true [2022-12-13 22:09:06,791 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) 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-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2022-12-13 22:09:06,791 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2022-12-13 22:09:06,792 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-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 885) no Hoare annotation was computed. [2022-12-13 22:09:06,792 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2022-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2022-12-13 22:09:06,792 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-12-13 22:09:06,792 INFO L895 garLoopResultBuilder]: At program point $Ultimate##176(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-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2022-12-13 22:09:06,792 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-12-13 22:09:06,792 INFO L895 garLoopResultBuilder]: At program point $Ultimate##182(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-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2022-12-13 22:09:06,792 INFO L895 garLoopResultBuilder]: At program point $Ultimate##188(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-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 491) no Hoare annotation was computed. [2022-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2022-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2022-12-13 22:09:06,792 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##50(lines 1244 1252) 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-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point s_run_L_SLAVE_RUN_GET#1(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-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##194(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-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2022-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##38(lines 1222 1230) 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-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(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-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##132(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-12-13 22:09:06,793 INFO L895 garLoopResultBuilder]: At program point $Ultimate##373(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-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##379(lines 714 722) 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-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_PUT#1(lines 101 843) the Hoare annotation is: false [2022-12-13 22:09:06,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2022-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##138(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-12-13 22:09:06,794 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##26(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-12-13 22:09:06,794 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-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##144(lines 254 262) 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-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##20(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-12-13 22:09:06,794 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2022-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##391(lines 736 744) 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-12-13 22:09:06,794 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##14(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-12-13 22:09:06,794 INFO L895 garLoopResultBuilder]: At program point $Ultimate##156(lines 276 284) 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-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L895 garLoopResultBuilder]: At program point $Ultimate##568(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-12-13 22:09:06,795 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(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-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L895 garLoopResultBuilder]: At program point $Ultimate##335(lines 626 634) 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-12-13 22:09:06,795 INFO L895 garLoopResultBuilder]: At program point $Ultimate##574(lines 1073 1081) 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-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2022-12-13 22:09:06,795 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-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2022-12-13 22:09:06,795 INFO L895 garLoopResultBuilder]: At program point $Ultimate##586(lines 1095 1103) 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-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##355(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-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point m_run_L_MASTER_RUN_MUTEX#1(lines 101 843) the Hoare annotation is: false [2022-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##120(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-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##361(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-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##126(lines 230 265) 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-12-13 22:09:06,796 INFO L895 garLoopResultBuilder]: At program point $Ultimate##367(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-12-13 22:09:06,796 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-12-13 22:09:06,796 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2022-12-13 22:09:06,796 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2022-12-13 22:09:06,797 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2022-12-13 22:09:06,799 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:09:06,800 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:09:06,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:09:06 BoogieIcfgContainer [2022-12-13 22:09:06,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:09:06,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:09:06,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:09:06,854 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:09:06,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:07:02" (3/4) ... [2022-12-13 22:09:06,856 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 22:09:06,861 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-13 22:09:06,868 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-13 22:09:06,869 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-12-13 22:09:06,869 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 22:09:06,870 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 22:09:06,931 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:09:06,932 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:09:06,932 INFO L158 Benchmark]: Toolchain (without parser) took 125993.43ms. Allocated memory was 197.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 165.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 586.6MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,932 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:09:06,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.46ms. Allocated memory is still 197.1MB. Free memory was 165.8MB in the beginning and 144.9MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.61ms. Allocated memory is still 197.1MB. Free memory was 144.9MB in the beginning and 141.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,933 INFO L158 Benchmark]: Boogie Preprocessor took 35.65ms. Allocated memory is still 197.1MB. Free memory was 141.3MB in the beginning and 138.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,933 INFO L158 Benchmark]: RCFGBuilder took 722.36ms. Allocated memory is still 197.1MB. Free memory was 138.5MB in the beginning and 153.6MB in the end (delta: -15.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,933 INFO L158 Benchmark]: TraceAbstraction took 124766.41ms. Allocated memory was 197.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 152.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 22:09:06,933 INFO L158 Benchmark]: Witness Printer took 77.81ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 22:09:06,934 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.15ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 65.1MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.46ms. Allocated memory is still 197.1MB. Free memory was 165.8MB in the beginning and 144.9MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.61ms. Allocated memory is still 197.1MB. Free memory was 144.9MB in the beginning and 141.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.65ms. Allocated memory is still 197.1MB. Free memory was 141.3MB in the beginning and 138.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 722.36ms. Allocated memory is still 197.1MB. Free memory was 138.5MB in the beginning and 153.6MB in the end (delta: -15.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 124766.41ms. Allocated memory was 197.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 152.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 77.81ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 285 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 124.7s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 104.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11341 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11341 mSDsluCounter, 23386 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11973 mSDsCounter, 419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2485 IncrementalHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 419 mSolverCounterUnsat, 11413 mSDtfsCounter, 2485 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 700 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=16, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 35918 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 118 PreInvPairs, 1464 NumberOfFragments, 11234 HoareAnnotationTreeSize, 118 FomulaSimplifications, 1128250 FormulaSimplificationTreeSizeReduction, 57.1s HoareSimplificationTime, 104 FomulaSimplificationsInter, 1872993 FormulaSimplificationTreeSizeReductionInter, 47.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 5552 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: 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: 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: 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: 364]: 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: 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: 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: 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: 626]: 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: 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: 1095]: 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: 818]: 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: 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: 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: 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: 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: 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: 1255]: 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: 973]: 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: 1073]: 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: 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: 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: 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: 101]: Loop Invariant Derived loop invariant: 0 - 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: 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: 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_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: 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: 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: 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: 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: 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: 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: 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: 604]: 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: 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: 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: 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: 714]: 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: 1222]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) || ((((((!(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: 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: 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: 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: 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: 254]: 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: 1351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 879]: 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: 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: 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: 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: 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: 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: 446]: 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: 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: 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: 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: 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: 101]: Loop Invariant Derived loop invariant: 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: 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: 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: 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: 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: 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: 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: 1167]: Loop Invariant Derived loop invariant: 1 - 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 == 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: 1303]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(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: 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: 876]: 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: 101]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1001]: 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: 796]: 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: 468]: 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: 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: 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: 736]: 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: 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: 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: 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: 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: 1325]: Loop Invariant Derived loop invariant: ((((((((((((((((2 <= c_write_req_ev && 0 <= a) && c_req_type == 1) && !(s_run_st == 0)) && req_tt_a == 0) && !(c_empty_req == 0)) && 2 == c_write_rsp_ev) && m_run_pc == 3) && a_t == 0) || ((((((((((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: 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: 951]: 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: 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: 276]: 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: 386]: 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: 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: 1244]: Loop Invariant Derived loop invariant: (((((((((c_req_type == 0 && 2 <= c_write_req_ev) && req_tt_a == 0) && c_empty_req == 1) && 2 == c_write_rsp_ev) && c_empty_rsp == 1) && a_t == 0) && m_run_pc == c_m_lock) && m_run_pc == 0) && m_run_pc == s_run_pc) || ((((((!(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: 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: 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: 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) - 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) RESULT: Ultimate proved your program to be correct! [2022-12-13 22:09:06,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8e1302-607a-4352-a7e1-a19bee6903fc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE