./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_3.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_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/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_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/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_402a681b-2ba9-463e-958a-987d0db013cb/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 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 --- 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 14:52:26,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:52:26,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:52:26,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:52:26,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:52:26,233 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:52:26,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:52:26,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:52:26,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:52:26,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:52:26,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:52:26,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:52:26,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:52:26,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:52:26,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:52:26,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:52:26,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:52:26,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:52:26,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:52:26,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:52:26,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:52:26,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:52:26,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:52:26,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:52:26,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:52:26,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:52:26,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:52:26,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:52:26,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:52:26,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:52:26,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:52:26,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:52:26,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:52:26,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:52:26,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:52:26,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:52:26,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:52:26,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:52:26,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:52:26,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:52:26,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:52:26,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 14:52:26,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:52:26,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:52:26,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:52:26,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:52:26,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:52:26,290 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:52:26,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:52:26,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:52:26,291 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:52:26,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:52:26,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:52:26,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:52:26,292 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:52:26,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:52:26,293 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 14:52:26,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:52:26,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:52:26,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:52:26,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:52:26,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:52:26,294 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:52:26,295 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_402a681b-2ba9-463e-958a-987d0db013cb/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_402a681b-2ba9-463e-958a-987d0db013cb/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 -> 677126e8d6773c92cc337bfe0a3ec155f49f784424155f33a8c9c24ee0a42113 [2022-12-13 14:52:26,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:52:26,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:52:26,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:52:26,490 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:52:26,491 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:52:26,492 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-13 14:52:29,088 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:52:29,214 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:52:29,214 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-12-13 14:52:29,220 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/data/6bd923eb3/6508aa7e385840ebbe56212a57110e99/FLAG2177eba28 [2022-12-13 14:52:29,230 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/data/6bd923eb3/6508aa7e385840ebbe56212a57110e99 [2022-12-13 14:52:29,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:52:29,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:52:29,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:52:29,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:52:29,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:52:29,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,239 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513a3338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29, skipping insertion in model container [2022-12-13 14:52:29,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:52:29,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:52:29,359 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_402a681b-2ba9-463e-958a-987d0db013cb/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-13 14:52:29,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:52:29,402 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:52:29,410 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_402a681b-2ba9-463e-958a-987d0db013cb/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-12-13 14:52:29,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:52:29,439 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:52:29,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29 WrapperNode [2022-12-13 14:52:29,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:52:29,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:52:29,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:52:29,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:52:29,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,468 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 231 [2022-12-13 14:52:29,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:52:29,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:52:29,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:52:29,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:52:29,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:52:29,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:52:29,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:52:29,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:52:29,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (1/1) ... [2022-12-13 14:52:29,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:52:29,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:29,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:52:29,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:52:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:52:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-13 14:52:29,552 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-13 14:52:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 14:52:29,553 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 14:52:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-12-13 14:52:29,553 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-12-13 14:52:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-12-13 14:52:29,553 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-12-13 14:52:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-13 14:52:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-13 14:52:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-12-13 14:52:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-12-13 14:52:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:52:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-12-13 14:52:29,554 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-12-13 14:52:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:52:29,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:52:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 14:52:29,555 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 14:52:29,624 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:52:29,626 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:52:29,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-12-13 14:52:29,911 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-12-13 14:52:29,927 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:52:29,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:52:29,936 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 14:52:29,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:52:29 BoogieIcfgContainer [2022-12-13 14:52:29,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:52:29,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:52:29,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:52:29,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:52:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:52:29" (1/3) ... [2022-12-13 14:52:29,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c387284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:52:29, skipping insertion in model container [2022-12-13 14:52:29,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:52:29" (2/3) ... [2022-12-13 14:52:29,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c387284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:52:29, skipping insertion in model container [2022-12-13 14:52:29,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:52:29" (3/3) ... [2022-12-13 14:52:29,946 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-12-13 14:52:29,961 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:52:29,961 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 14:52:30,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:52:30,008 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;@212db26c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:52:30,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 14:52:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 108 states have internal predecessors, (153), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-12-13 14:52:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 14:52:30,021 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:30,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:52:30,022 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 965633490, now seen corresponding path program 1 times [2022-12-13 14:52:30,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:30,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923353218] [2022-12-13 14:52:30,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:30,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 14:52:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 14:52:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:30,439 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 14:52:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:30,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923353218] [2022-12-13 14:52:30,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923353218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:30,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:30,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:52:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127263853] [2022-12-13 14:52:30,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:30,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:52:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:30,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:52:30,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:52:30,469 INFO L87 Difference]: Start difference. First operand has 130 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 108 states have internal predecessors, (153), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:31,048 INFO L93 Difference]: Finished difference Result 415 states and 607 transitions. [2022-12-13 14:52:31,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 14:52:31,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-12-13 14:52:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:31,062 INFO L225 Difference]: With dead ends: 415 [2022-12-13 14:52:31,062 INFO L226 Difference]: Without dead ends: 280 [2022-12-13 14:52:31,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:52:31,069 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 500 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:31,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 546 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:52:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-12-13 14:52:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 239. [2022-12-13 14:52:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 190 states have (on average 1.4421052631578948) internal successors, (274), 198 states have internal predecessors, (274), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-12-13 14:52:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2022-12-13 14:52:31,144 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 61 [2022-12-13 14:52:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:31,145 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2022-12-13 14:52:31,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:31,146 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2022-12-13 14:52:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 14:52:31,149 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:31,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:52:31,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:52:31,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:31,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1168969490, now seen corresponding path program 1 times [2022-12-13 14:52:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:31,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705705265] [2022-12-13 14:52:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 14:52:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 14:52:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:31,343 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 14:52:31,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:31,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705705265] [2022-12-13 14:52:31,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705705265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:31,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:31,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:52:31,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097360] [2022-12-13 14:52:31,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:31,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:52:31,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:52:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:52:31,347 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:31,973 INFO L93 Difference]: Finished difference Result 658 states and 923 transitions. [2022-12-13 14:52:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 14:52:31,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-12-13 14:52:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:31,977 INFO L225 Difference]: With dead ends: 658 [2022-12-13 14:52:31,977 INFO L226 Difference]: Without dead ends: 435 [2022-12-13 14:52:31,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 14:52:31,979 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 461 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:31,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 854 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:52:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-12-13 14:52:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 357. [2022-12-13 14:52:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 286 states have (on average 1.4335664335664335) internal successors, (410), 296 states have internal predecessors, (410), 40 states have call successors, (40), 21 states have call predecessors, (40), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-12-13 14:52:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 503 transitions. [2022-12-13 14:52:32,013 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 503 transitions. Word has length 61 [2022-12-13 14:52:32,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:32,014 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 503 transitions. [2022-12-13 14:52:32,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 503 transitions. [2022-12-13 14:52:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 14:52:32,018 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:32,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:52:32,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:52:32,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1186835760, now seen corresponding path program 1 times [2022-12-13 14:52:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:32,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532609161] [2022-12-13 14:52:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-12-13 14:52:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-12-13 14:52:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:32,160 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 14:52:32,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:32,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532609161] [2022-12-13 14:52:32,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532609161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:32,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:32,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 14:52:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823468528] [2022-12-13 14:52:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:32,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:52:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:32,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:52:32,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:52:32,163 INFO L87 Difference]: Start difference. First operand 357 states and 503 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 14:52:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:33,375 INFO L93 Difference]: Finished difference Result 2019 states and 2867 transitions. [2022-12-13 14:52:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 14:52:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 61 [2022-12-13 14:52:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:33,385 INFO L225 Difference]: With dead ends: 2019 [2022-12-13 14:52:33,385 INFO L226 Difference]: Without dead ends: 1666 [2022-12-13 14:52:33,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 14:52:33,390 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 1753 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:33,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 1269 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 14:52:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-12-13 14:52:33,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1444. [2022-12-13 14:52:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1168 states have (on average 1.3835616438356164) internal successors, (1616), 1193 states have internal predecessors, (1616), 150 states have call successors, (150), 104 states have call predecessors, (150), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-12-13 14:52:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1952 transitions. [2022-12-13 14:52:33,500 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1952 transitions. Word has length 61 [2022-12-13 14:52:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:33,500 INFO L495 AbstractCegarLoop]: Abstraction has 1444 states and 1952 transitions. [2022-12-13 14:52:33,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-12-13 14:52:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1952 transitions. [2022-12-13 14:52:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 14:52:33,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:33,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:52:33,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:52:33,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:33,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:33,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1687960756, now seen corresponding path program 1 times [2022-12-13 14:52:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:33,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824977075] [2022-12-13 14:52:33,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:33,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 14:52:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 14:52:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:33,643 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 14:52:33,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:33,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824977075] [2022-12-13 14:52:33,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824977075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:33,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:33,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:52:33,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841505252] [2022-12-13 14:52:33,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:33,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:52:33,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:52:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:52:33,645 INFO L87 Difference]: Start difference. First operand 1444 states and 1952 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 14:52:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:34,063 INFO L93 Difference]: Finished difference Result 3026 states and 4120 transitions. [2022-12-13 14:52:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 14:52:34,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-12-13 14:52:34,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:34,071 INFO L225 Difference]: With dead ends: 3026 [2022-12-13 14:52:34,071 INFO L226 Difference]: Without dead ends: 1592 [2022-12-13 14:52:34,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 14:52:34,075 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 193 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:34,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 615 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:52:34,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-12-13 14:52:34,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1484. [2022-12-13 14:52:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1200 states have (on average 1.3683333333333334) internal successors, (1642), 1225 states have internal predecessors, (1642), 150 states have call successors, (150), 104 states have call predecessors, (150), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-12-13 14:52:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1986 transitions. [2022-12-13 14:52:34,186 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1986 transitions. Word has length 63 [2022-12-13 14:52:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:34,186 INFO L495 AbstractCegarLoop]: Abstraction has 1484 states and 1986 transitions. [2022-12-13 14:52:34,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 14:52:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1986 transitions. [2022-12-13 14:52:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 14:52:34,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:34,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:52:34,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:52:34,188 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:34,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1293593970, now seen corresponding path program 1 times [2022-12-13 14:52:34,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:34,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714427146] [2022-12-13 14:52:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 14:52:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 14:52:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:34,302 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 14:52:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:34,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714427146] [2022-12-13 14:52:34,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714427146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:34,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:34,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 14:52:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518852012] [2022-12-13 14:52:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 14:52:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:34,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 14:52:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:52:34,305 INFO L87 Difference]: Start difference. First operand 1484 states and 1986 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 14:52:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:35,608 INFO L93 Difference]: Finished difference Result 5234 states and 7157 transitions. [2022-12-13 14:52:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 14:52:35,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-12-13 14:52:35,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:35,620 INFO L225 Difference]: With dead ends: 5234 [2022-12-13 14:52:35,621 INFO L226 Difference]: Without dead ends: 3760 [2022-12-13 14:52:35,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 14:52:35,625 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1828 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:35,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 1288 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 14:52:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-12-13 14:52:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3309. [2022-12-13 14:52:35,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 2664 states have (on average 1.3307057057057057) internal successors, (3545), 2710 states have internal predecessors, (3545), 345 states have call successors, (345), 245 states have call predecessors, (345), 294 states have return successors, (443), 355 states have call predecessors, (443), 345 states have call successors, (443) [2022-12-13 14:52:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4333 transitions. [2022-12-13 14:52:35,836 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4333 transitions. Word has length 63 [2022-12-13 14:52:35,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:35,836 INFO L495 AbstractCegarLoop]: Abstraction has 3309 states and 4333 transitions. [2022-12-13 14:52:35,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 14:52:35,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4333 transitions. [2022-12-13 14:52:35,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 14:52:35,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:35,838 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] [2022-12-13 14:52:35,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:52:35,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash 612204921, now seen corresponding path program 1 times [2022-12-13 14:52:35,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:35,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254734514] [2022-12-13 14:52:35,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 14:52:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:52:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:35,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254734514] [2022-12-13 14:52:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254734514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:35,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:35,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:52:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237552649] [2022-12-13 14:52:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:35,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:52:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:35,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:52:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:52:35,975 INFO L87 Difference]: Start difference. First operand 3309 states and 4333 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 14:52:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:36,532 INFO L93 Difference]: Finished difference Result 6996 states and 9257 transitions. [2022-12-13 14:52:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:52:36,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2022-12-13 14:52:36,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:36,548 INFO L225 Difference]: With dead ends: 6996 [2022-12-13 14:52:36,548 INFO L226 Difference]: Without dead ends: 3697 [2022-12-13 14:52:36,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 14:52:36,557 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 137 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:36,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 686 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 14:52:36,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2022-12-13 14:52:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3439. [2022-12-13 14:52:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 2768 states have (on average 1.3161127167630058) internal successors, (3643), 2814 states have internal predecessors, (3643), 345 states have call successors, (345), 245 states have call predecessors, (345), 320 states have return successors, (469), 381 states have call predecessors, (469), 345 states have call successors, (469) [2022-12-13 14:52:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4457 transitions. [2022-12-13 14:52:36,822 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4457 transitions. Word has length 79 [2022-12-13 14:52:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:36,822 INFO L495 AbstractCegarLoop]: Abstraction has 3439 states and 4457 transitions. [2022-12-13 14:52:36,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 14:52:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4457 transitions. [2022-12-13 14:52:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 14:52:36,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:36,824 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] [2022-12-13 14:52:36,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:52:36,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:36,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash 860351415, now seen corresponding path program 1 times [2022-12-13 14:52:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:36,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132053392] [2022-12-13 14:52:36,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 14:52:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:52:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132053392] [2022-12-13 14:52:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132053392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:52:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583238391] [2022-12-13 14:52:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:36,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 14:52:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 14:52:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 14:52:36,983 INFO L87 Difference]: Start difference. First operand 3439 states and 4457 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:37,639 INFO L93 Difference]: Finished difference Result 6774 states and 8788 transitions. [2022-12-13 14:52:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 14:52:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-12-13 14:52:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:37,655 INFO L225 Difference]: With dead ends: 6774 [2022-12-13 14:52:37,655 INFO L226 Difference]: Without dead ends: 3679 [2022-12-13 14:52:37,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-12-13 14:52:37,663 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 405 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:37,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 702 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 14:52:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2022-12-13 14:52:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3112. [2022-12-13 14:52:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2517 states have (on average 1.3150576082638061) internal successors, (3310), 2553 states have internal predecessors, (3310), 307 states have call successors, (307), 219 states have call predecessors, (307), 282 states have return successors, (408), 340 states have call predecessors, (408), 307 states have call successors, (408) [2022-12-13 14:52:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4025 transitions. [2022-12-13 14:52:37,905 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4025 transitions. Word has length 79 [2022-12-13 14:52:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:37,905 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4025 transitions. [2022-12-13 14:52:37,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4025 transitions. [2022-12-13 14:52:37,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 14:52:37,907 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:37,907 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] [2022-12-13 14:52:37,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:52:37,907 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1519882937, now seen corresponding path program 1 times [2022-12-13 14:52:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:37,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876347165] [2022-12-13 14:52:37,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 14:52:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 14:52:38,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876347165] [2022-12-13 14:52:38,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876347165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:38,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:38,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:52:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009236451] [2022-12-13 14:52:38,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:38,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:52:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:38,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:52:38,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:52:38,004 INFO L87 Difference]: Start difference. First operand 3112 states and 4025 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 14:52:38,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:38,588 INFO L93 Difference]: Finished difference Result 9565 states and 12594 transitions. [2022-12-13 14:52:38,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 14:52:38,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2022-12-13 14:52:38,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:38,607 INFO L225 Difference]: With dead ends: 9565 [2022-12-13 14:52:38,607 INFO L226 Difference]: Without dead ends: 6464 [2022-12-13 14:52:38,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 14:52:38,612 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 388 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:38,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 552 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 14:52:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2022-12-13 14:52:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 6042. [2022-12-13 14:52:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 4834 states have (on average 1.2941663218866364) internal successors, (6256), 4926 states have internal predecessors, (6256), 613 states have call successors, (613), 438 states have call predecessors, (613), 589 states have return successors, (961), 679 states have call predecessors, (961), 613 states have call successors, (961) [2022-12-13 14:52:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 7830 transitions. [2022-12-13 14:52:38,968 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 7830 transitions. Word has length 79 [2022-12-13 14:52:38,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:38,968 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 7830 transitions. [2022-12-13 14:52:38,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-13 14:52:38,969 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 7830 transitions. [2022-12-13 14:52:38,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 14:52:38,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:38,970 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] [2022-12-13 14:52:38,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:52:38,970 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -866626569, now seen corresponding path program 1 times [2022-12-13 14:52:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:38,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700242397] [2022-12-13 14:52:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:38,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 14:52:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 14:52:39,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:39,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700242397] [2022-12-13 14:52:39,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700242397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:39,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:39,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:52:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280134151] [2022-12-13 14:52:39,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:39,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:52:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:39,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:52:39,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:52:39,028 INFO L87 Difference]: Start difference. First operand 6042 states and 7830 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:39,429 INFO L93 Difference]: Finished difference Result 10891 states and 14110 transitions. [2022-12-13 14:52:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:52:39,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-12-13 14:52:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:39,442 INFO L225 Difference]: With dead ends: 10891 [2022-12-13 14:52:39,442 INFO L226 Difference]: Without dead ends: 4860 [2022-12-13 14:52:39,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 14:52:39,450 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 270 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:39,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 315 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 14:52:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2022-12-13 14:52:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4531. [2022-12-13 14:52:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3643 states have (on average 1.2920669777655778) internal successors, (4707), 3706 states have internal predecessors, (4707), 452 states have call successors, (452), 325 states have call predecessors, (452), 430 states have return successors, (678), 500 states have call predecessors, (678), 452 states have call successors, (678) [2022-12-13 14:52:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5837 transitions. [2022-12-13 14:52:39,649 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5837 transitions. Word has length 79 [2022-12-13 14:52:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:39,649 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 5837 transitions. [2022-12-13 14:52:39,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 14:52:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5837 transitions. [2022-12-13 14:52:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 14:52:39,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:39,650 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] [2022-12-13 14:52:39,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:52:39,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -372325524, now seen corresponding path program 1 times [2022-12-13 14:52:39,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:39,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397040294] [2022-12-13 14:52:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 14:52:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397040294] [2022-12-13 14:52:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397040294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:52:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 14:52:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680134621] [2022-12-13 14:52:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:52:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:52:39,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:52:39,780 INFO L87 Difference]: Start difference. First operand 4531 states and 5837 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 14:52:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:40,984 INFO L93 Difference]: Finished difference Result 11976 states and 15588 transitions. [2022-12-13 14:52:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 14:52:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2022-12-13 14:52:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:41,001 INFO L225 Difference]: With dead ends: 11976 [2022-12-13 14:52:41,002 INFO L226 Difference]: Without dead ends: 7456 [2022-12-13 14:52:41,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-12-13 14:52:41,009 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 1317 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:41,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 774 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 14:52:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2022-12-13 14:52:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 6949. [2022-12-13 14:52:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6949 states, 5485 states have (on average 1.2503190519598906) internal successors, (6858), 5590 states have internal predecessors, (6858), 740 states have call successors, (740), 507 states have call predecessors, (740), 718 states have return successors, (1149), 853 states have call predecessors, (1149), 740 states have call successors, (1149) [2022-12-13 14:52:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 8747 transitions. [2022-12-13 14:52:41,339 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 8747 transitions. Word has length 80 [2022-12-13 14:52:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:41,339 INFO L495 AbstractCegarLoop]: Abstraction has 6949 states and 8747 transitions. [2022-12-13 14:52:41,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 14:52:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 8747 transitions. [2022-12-13 14:52:41,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-12-13 14:52:41,341 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:41,341 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2022-12-13 14:52:41,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:52:41,341 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2052489113, now seen corresponding path program 1 times [2022-12-13 14:52:41,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:41,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927852084] [2022-12-13 14:52:41,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 14:52:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 14:52:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 14:52:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 14:52:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 14:52:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 14:52:41,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927852084] [2022-12-13 14:52:41,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927852084] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:41,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217141556] [2022-12-13 14:52:41,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:41,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:41,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:41,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 14:52:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:41,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:41,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 14:52:41,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:41,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217141556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:41,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:41,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2022-12-13 14:52:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573076762] [2022-12-13 14:52:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:41,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:41,654 INFO L87 Difference]: Start difference. First operand 6949 states and 8747 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:52:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:42,040 INFO L93 Difference]: Finished difference Result 6949 states and 8747 transitions. [2022-12-13 14:52:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:42,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2022-12-13 14:52:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:42,062 INFO L225 Difference]: With dead ends: 6949 [2022-12-13 14:52:42,062 INFO L226 Difference]: Without dead ends: 6948 [2022-12-13 14:52:42,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:42,065 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:42,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:42,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2022-12-13 14:52:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 6948. [2022-12-13 14:52:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6948 states, 5485 states have (on average 1.2379216043755696) internal successors, (6790), 5589 states have internal predecessors, (6790), 740 states have call successors, (740), 507 states have call predecessors, (740), 718 states have return successors, (1149), 853 states have call predecessors, (1149), 740 states have call successors, (1149) [2022-12-13 14:52:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6948 states to 6948 states and 8679 transitions. [2022-12-13 14:52:42,395 INFO L78 Accepts]: Start accepts. Automaton has 6948 states and 8679 transitions. Word has length 106 [2022-12-13 14:52:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:42,395 INFO L495 AbstractCegarLoop]: Abstraction has 6948 states and 8679 transitions. [2022-12-13 14:52:42,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:52:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 6948 states and 8679 transitions. [2022-12-13 14:52:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-12-13 14:52:42,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:42,397 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1] [2022-12-13 14:52:42,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:52:42,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:42,598 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:42,598 INFO L85 PathProgramCache]: Analyzing trace with hash 797347268, now seen corresponding path program 1 times [2022-12-13 14:52:42,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:42,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20178504] [2022-12-13 14:52:42,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:42,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-12-13 14:52:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-12-13 14:52:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 14:52:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 14:52:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 14:52:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-13 14:52:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20178504] [2022-12-13 14:52:42,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20178504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:42,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365258693] [2022-12-13 14:52:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:42,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:42,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 14:52:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:42,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:42,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-12-13 14:52:42,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:42,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365258693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:42,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:42,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2022-12-13 14:52:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994744379] [2022-12-13 14:52:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:42,862 INFO L87 Difference]: Start difference. First operand 6948 states and 8679 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:52:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:43,424 INFO L93 Difference]: Finished difference Result 20674 states and 25785 transitions. [2022-12-13 14:52:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2022-12-13 14:52:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:43,453 INFO L225 Difference]: With dead ends: 20674 [2022-12-13 14:52:43,453 INFO L226 Difference]: Without dead ends: 12377 [2022-12-13 14:52:43,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:43,471 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 88 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:43,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 362 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:43,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12377 states. [2022-12-13 14:52:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12377 to 12361. [2022-12-13 14:52:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12361 states, 9757 states have (on average 1.2265040483755252) internal successors, (11967), 9935 states have internal predecessors, (11967), 1310 states have call successors, (1310), 902 states have call predecessors, (1310), 1290 states have return successors, (2066), 1524 states have call predecessors, (2066), 1310 states have call successors, (2066) [2022-12-13 14:52:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 15343 transitions. [2022-12-13 14:52:44,326 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 15343 transitions. Word has length 107 [2022-12-13 14:52:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:44,326 INFO L495 AbstractCegarLoop]: Abstraction has 12361 states and 15343 transitions. [2022-12-13 14:52:44,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-12-13 14:52:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 15343 transitions. [2022-12-13 14:52:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-12-13 14:52:44,329 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:44,329 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:52:44,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 14:52:44,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-13 14:52:44,530 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:44,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1019989462, now seen corresponding path program 1 times [2022-12-13 14:52:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:44,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360816900] [2022-12-13 14:52:44,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:44,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 14:52:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:52:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 14:52:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 14:52:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,684 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 14:52:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360816900] [2022-12-13 14:52:44,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360816900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:44,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025170301] [2022-12-13 14:52:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:44,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:44,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 14:52:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:44,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:44,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:44,905 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-13 14:52:44,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:44,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025170301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:44,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:44,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-12-13 14:52:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470731938] [2022-12-13 14:52:44,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:44,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:44,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:44,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:44,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:44,907 INFO L87 Difference]: Start difference. First operand 12361 states and 15343 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:45,368 INFO L93 Difference]: Finished difference Result 12361 states and 15343 transitions. [2022-12-13 14:52:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:45,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 151 [2022-12-13 14:52:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:45,413 INFO L225 Difference]: With dead ends: 12361 [2022-12-13 14:52:45,413 INFO L226 Difference]: Without dead ends: 12360 [2022-12-13 14:52:45,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:45,416 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:45,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12360 states. [2022-12-13 14:52:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12360 to 12360. [2022-12-13 14:52:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12360 states, 9757 states have (on average 1.2242492569437327) internal successors, (11945), 9934 states have internal predecessors, (11945), 1310 states have call successors, (1310), 902 states have call predecessors, (1310), 1290 states have return successors, (2066), 1524 states have call predecessors, (2066), 1310 states have call successors, (2066) [2022-12-13 14:52:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12360 states to 12360 states and 15321 transitions. [2022-12-13 14:52:46,244 INFO L78 Accepts]: Start accepts. Automaton has 12360 states and 15321 transitions. Word has length 151 [2022-12-13 14:52:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:46,244 INFO L495 AbstractCegarLoop]: Abstraction has 12360 states and 15321 transitions. [2022-12-13 14:52:46,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 12360 states and 15321 transitions. [2022-12-13 14:52:46,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-12-13 14:52:46,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:46,248 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:52:46,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 14:52:46,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 14:52:46,448 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1554902016, now seen corresponding path program 1 times [2022-12-13 14:52:46,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:46,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453786246] [2022-12-13 14:52:46,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:46,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 14:52:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:52:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 14:52:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 14:52:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 14:52:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:46,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453786246] [2022-12-13 14:52:46,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453786246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:46,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729772829] [2022-12-13 14:52:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:46,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:46,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 14:52:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:46,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:46,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:46,840 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-12-13 14:52:46,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:46,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729772829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:46,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:46,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-12-13 14:52:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957264988] [2022-12-13 14:52:46,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:46,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:46,842 INFO L87 Difference]: Start difference. First operand 12360 states and 15321 transitions. Second operand has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:47,401 INFO L93 Difference]: Finished difference Result 13123 states and 16237 transitions. [2022-12-13 14:52:47,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:47,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2022-12-13 14:52:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:47,427 INFO L225 Difference]: With dead ends: 13123 [2022-12-13 14:52:47,427 INFO L226 Difference]: Without dead ends: 13122 [2022-12-13 14:52:47,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:47,432 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 31 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:47,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 310 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13122 states. [2022-12-13 14:52:47,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13122 to 13122. [2022-12-13 14:52:47,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13122 states, 10355 states have (on average 1.2203766296475134) internal successors, (12637), 10536 states have internal predecessors, (12637), 1394 states have call successors, (1394), 958 states have call predecessors, (1394), 1370 states have return successors, (2200), 1628 states have call predecessors, (2200), 1394 states have call successors, (2200) [2022-12-13 14:52:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13122 states to 13122 states and 16231 transitions. [2022-12-13 14:52:48,021 INFO L78 Accepts]: Start accepts. Automaton has 13122 states and 16231 transitions. Word has length 152 [2022-12-13 14:52:48,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:48,021 INFO L495 AbstractCegarLoop]: Abstraction has 13122 states and 16231 transitions. [2022-12-13 14:52:48,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:48,021 INFO L276 IsEmpty]: Start isEmpty. Operand 13122 states and 16231 transitions. [2022-12-13 14:52:48,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 14:52:48,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:48,024 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:52:48,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 14:52:48,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:48,225 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -237713245, now seen corresponding path program 1 times [2022-12-13 14:52:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:48,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682852485] [2022-12-13 14:52:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 14:52:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:52:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 14:52:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 14:52:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 14:52:48,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682852485] [2022-12-13 14:52:48,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682852485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:48,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225097522] [2022-12-13 14:52:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:48,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:48,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:48,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:48,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 14:52:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:48,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:48,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 14:52:48,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:48,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225097522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:48,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:48,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-12-13 14:52:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827979550] [2022-12-13 14:52:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:48,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:48,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:48,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:48,571 INFO L87 Difference]: Start difference. First operand 13122 states and 16231 transitions. Second operand has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:49,179 INFO L93 Difference]: Finished difference Result 13122 states and 16231 transitions. [2022-12-13 14:52:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:49,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 162 [2022-12-13 14:52:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:49,206 INFO L225 Difference]: With dead ends: 13122 [2022-12-13 14:52:49,206 INFO L226 Difference]: Without dead ends: 13121 [2022-12-13 14:52:49,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:49,211 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:49,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 155 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:49,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2022-12-13 14:52:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 13121. [2022-12-13 14:52:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13121 states, 10355 states have (on average 1.2182520521487203) internal successors, (12615), 10535 states have internal predecessors, (12615), 1394 states have call successors, (1394), 958 states have call predecessors, (1394), 1370 states have return successors, (2200), 1628 states have call predecessors, (2200), 1394 states have call successors, (2200) [2022-12-13 14:52:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13121 states to 13121 states and 16209 transitions. [2022-12-13 14:52:50,005 INFO L78 Accepts]: Start accepts. Automaton has 13121 states and 16209 transitions. Word has length 162 [2022-12-13 14:52:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:50,005 INFO L495 AbstractCegarLoop]: Abstraction has 13121 states and 16209 transitions. [2022-12-13 14:52:50,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 13121 states and 16209 transitions. [2022-12-13 14:52:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-12-13 14:52:50,007 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:50,007 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:52:50,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 14:52:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:50,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1220824281, now seen corresponding path program 1 times [2022-12-13 14:52:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:50,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402427844] [2022-12-13 14:52:50,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 14:52:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:52:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 14:52:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 14:52:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 14:52:50,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402427844] [2022-12-13 14:52:50,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402427844] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:50,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534125580] [2022-12-13 14:52:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:50,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:50,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:50,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:50,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 14:52:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:50,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:50,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-12-13 14:52:50,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:50,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534125580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:50,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-12-13 14:52:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079686154] [2022-12-13 14:52:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:50,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:50,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:50,565 INFO L87 Difference]: Start difference. First operand 13121 states and 16209 transitions. Second operand has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:51,642 INFO L93 Difference]: Finished difference Result 20086 states and 24849 transitions. [2022-12-13 14:52:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 163 [2022-12-13 14:52:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:51,682 INFO L225 Difference]: With dead ends: 20086 [2022-12-13 14:52:51,682 INFO L226 Difference]: Without dead ends: 20085 [2022-12-13 14:52:51,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:51,687 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:51,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20085 states. [2022-12-13 14:52:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20085 to 20064. [2022-12-13 14:52:52,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20064 states, 15813 states have (on average 1.2171630936571176) internal successors, (19247), 16106 states have internal predecessors, (19247), 2126 states have call successors, (2126), 1458 states have call predecessors, (2126), 2124 states have return successors, (3430), 2500 states have call predecessors, (3430), 2126 states have call successors, (3430) [2022-12-13 14:52:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20064 states to 20064 states and 24803 transitions. [2022-12-13 14:52:52,610 INFO L78 Accepts]: Start accepts. Automaton has 20064 states and 24803 transitions. Word has length 163 [2022-12-13 14:52:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:52,611 INFO L495 AbstractCegarLoop]: Abstraction has 20064 states and 24803 transitions. [2022-12-13 14:52:52,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-12-13 14:52:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20064 states and 24803 transitions. [2022-12-13 14:52:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-12-13 14:52:52,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:52,620 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-12-13 14:52:52,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 14:52:52,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:52,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:52,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1452872015, now seen corresponding path program 1 times [2022-12-13 14:52:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:52,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921499367] [2022-12-13 14:52:52,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:52,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-12-13 14:52:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-12-13 14:52:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 14:52:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-12-13 14:52:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-12-13 14:52:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-12-13 14:52:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-12-13 14:52:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-12-13 14:52:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-12-13 14:52:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-12-13 14:52:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-12-13 14:52:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-12-13 14:52:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2022-12-13 14:52:52,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921499367] [2022-12-13 14:52:52,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921499367] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:52,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200868855] [2022-12-13 14:52:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:52,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:52,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:52,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:52,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 14:52:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:53,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:53,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2022-12-13 14:52:53,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:53,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200868855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:53,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:53,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:52:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20582772] [2022-12-13 14:52:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:53,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:53,158 INFO L87 Difference]: Start difference. First operand 20064 states and 24803 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 14:52:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:52:54,895 INFO L93 Difference]: Finished difference Result 57806 states and 71372 transitions. [2022-12-13 14:52:54,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:52:54,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 249 [2022-12-13 14:52:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:52:54,966 INFO L225 Difference]: With dead ends: 57806 [2022-12-13 14:52:54,966 INFO L226 Difference]: Without dead ends: 38253 [2022-12-13 14:52:54,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:54,996 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:52:54,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 304 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:52:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38253 states. [2022-12-13 14:52:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38253 to 37992. [2022-12-13 14:52:57,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37992 states, 29915 states have (on average 1.2104629784389103) internal successors, (36211), 30498 states have internal predecessors, (36211), 3996 states have call successors, (3996), 2916 states have call predecessors, (3996), 4080 states have return successors, (6102), 4578 states have call predecessors, (6102), 3996 states have call successors, (6102) [2022-12-13 14:52:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37992 states to 37992 states and 46309 transitions. [2022-12-13 14:52:57,333 INFO L78 Accepts]: Start accepts. Automaton has 37992 states and 46309 transitions. Word has length 249 [2022-12-13 14:52:57,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:52:57,333 INFO L495 AbstractCegarLoop]: Abstraction has 37992 states and 46309 transitions. [2022-12-13 14:52:57,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-12-13 14:52:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37992 states and 46309 transitions. [2022-12-13 14:52:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 14:52:57,352 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:52:57,353 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-12-13 14:52:57,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 14:52:57,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 14:52:57,554 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:52:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:52:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash 272752078, now seen corresponding path program 1 times [2022-12-13 14:52:57,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:52:57,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941220900] [2022-12-13 14:52:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:57,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:52:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:52:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:52:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:52:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:52:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:52:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:52:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:52:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:52:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:52:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:52:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 14:52:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 14:52:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 14:52:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 14:52:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 14:52:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 14:52:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-12-13 14:52:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 14:52:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 14:52:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:52:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:52:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 14:52:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 14:52:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:52:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 14:52:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-12-13 14:52:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:52:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941220900] [2022-12-13 14:52:57,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941220900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:52:57,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833664520] [2022-12-13 14:52:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:52:57,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:52:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:52:57,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:52:57,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 14:52:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:52:57,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:52:57,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:52:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2022-12-13 14:52:58,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:52:58,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833664520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:52:58,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:52:58,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:52:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11791463] [2022-12-13 14:52:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:52:58,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:52:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:52:58,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:52:58,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:52:58,130 INFO L87 Difference]: Start difference. First operand 37992 states and 46309 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 14:53:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:01,560 INFO L93 Difference]: Finished difference Result 111390 states and 136390 transitions. [2022-12-13 14:53:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:53:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 283 [2022-12-13 14:53:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:01,743 INFO L225 Difference]: With dead ends: 111390 [2022-12-13 14:53:01,743 INFO L226 Difference]: Without dead ends: 73409 [2022-12-13 14:53:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:01,797 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 62 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 304 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:53:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73409 states. [2022-12-13 14:53:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73409 to 73408. [2022-12-13 14:53:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73408 states, 57813 states have (on average 1.1974988324425302) internal successors, (69231), 58902 states have internal predecessors, (69231), 7890 states have call successors, (7890), 5832 states have call predecessors, (7890), 7704 states have return successors, (11313), 8674 states have call predecessors, (11313), 7890 states have call successors, (11313) [2022-12-13 14:53:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73408 states to 73408 states and 88434 transitions. [2022-12-13 14:53:06,294 INFO L78 Accepts]: Start accepts. Automaton has 73408 states and 88434 transitions. Word has length 283 [2022-12-13 14:53:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:06,294 INFO L495 AbstractCegarLoop]: Abstraction has 73408 states and 88434 transitions. [2022-12-13 14:53:06,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-12-13 14:53:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 73408 states and 88434 transitions. [2022-12-13 14:53:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 14:53:06,310 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:06,310 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-12-13 14:53:06,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 14:53:06,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 14:53:06,512 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:53:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash 947912204, now seen corresponding path program 1 times [2022-12-13 14:53:06,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254116209] [2022-12-13 14:53:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:53:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:53:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:53:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:53:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:53:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:53:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:53:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:53:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 14:53:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 14:53:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 14:53:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 14:53:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 14:53:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 14:53:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-12-13 14:53:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 14:53:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 14:53:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 14:53:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 14:53:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:53:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 14:53:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-12-13 14:53:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254116209] [2022-12-13 14:53:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254116209] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338568306] [2022-12-13 14:53:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:06,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:06,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 14:53:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:06,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:53:06,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-12-13 14:53:06,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:53:06,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338568306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:53:06,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:53:06,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:53:06,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945609355] [2022-12-13 14:53:06,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:53:06,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:53:06,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:53:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:06,864 INFO L87 Difference]: Start difference. First operand 73408 states and 88434 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-12-13 14:53:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:10,211 INFO L93 Difference]: Finished difference Result 106984 states and 128628 transitions. [2022-12-13 14:53:10,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:53:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 283 [2022-12-13 14:53:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:10,300 INFO L225 Difference]: With dead ends: 106984 [2022-12-13 14:53:10,300 INFO L226 Difference]: Without dead ends: 47199 [2022-12-13 14:53:10,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:10,356 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 120 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:10,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 411 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:53:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47199 states. [2022-12-13 14:53:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47199 to 34858. [2022-12-13 14:53:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34858 states, 27574 states have (on average 1.161492710524407) internal successors, (32027), 28003 states have internal predecessors, (32027), 3783 states have call successors, (3783), 2848 states have call predecessors, (3783), 3500 states have return successors, (5052), 4007 states have call predecessors, (5052), 3783 states have call successors, (5052) [2022-12-13 14:53:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34858 states to 34858 states and 40862 transitions. [2022-12-13 14:53:12,385 INFO L78 Accepts]: Start accepts. Automaton has 34858 states and 40862 transitions. Word has length 283 [2022-12-13 14:53:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:12,386 INFO L495 AbstractCegarLoop]: Abstraction has 34858 states and 40862 transitions. [2022-12-13 14:53:12,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-12-13 14:53:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 34858 states and 40862 transitions. [2022-12-13 14:53:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-12-13 14:53:12,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:12,405 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2022-12-13 14:53:12,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 14:53:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:12,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:53:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -77798066, now seen corresponding path program 1 times [2022-12-13 14:53:12,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:12,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776211153] [2022-12-13 14:53:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:53:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:53:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:53:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:53:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:53:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:53:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:53:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:53:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 14:53:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 14:53:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 14:53:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 14:53:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 14:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 14:53:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-12-13 14:53:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 14:53:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 14:53:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-12-13 14:53:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-12-13 14:53:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:53:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-12-13 14:53:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-12-13 14:53:12,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776211153] [2022-12-13 14:53:12,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776211153] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:12,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044123723] [2022-12-13 14:53:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:12,785 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:12,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 14:53:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:12,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:53:12,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2022-12-13 14:53:12,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:53:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044123723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:53:12,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:53:12,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:53:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333122581] [2022-12-13 14:53:12,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:53:12,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:53:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:53:12,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:12,915 INFO L87 Difference]: Start difference. First operand 34858 states and 40862 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-12-13 14:53:14,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:14,122 INFO L93 Difference]: Finished difference Result 56377 states and 65986 transitions. [2022-12-13 14:53:14,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:53:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 283 [2022-12-13 14:53:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:14,176 INFO L225 Difference]: With dead ends: 56377 [2022-12-13 14:53:14,176 INFO L226 Difference]: Without dead ends: 21530 [2022-12-13 14:53:14,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:14,223 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 14 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:14,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 331 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:53:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21530 states. [2022-12-13 14:53:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21530 to 21530. [2022-12-13 14:53:15,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21530 states, 17014 states have (on average 1.1441753849770777) internal successors, (19467), 17271 states have internal predecessors, (19467), 2255 states have call successors, (2255), 1832 states have call predecessors, (2255), 2260 states have return successors, (2970), 2427 states have call predecessors, (2970), 2255 states have call successors, (2970) [2022-12-13 14:53:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21530 states to 21530 states and 24692 transitions. [2022-12-13 14:53:15,496 INFO L78 Accepts]: Start accepts. Automaton has 21530 states and 24692 transitions. Word has length 283 [2022-12-13 14:53:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:15,497 INFO L495 AbstractCegarLoop]: Abstraction has 21530 states and 24692 transitions. [2022-12-13 14:53:15,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-12-13 14:53:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 21530 states and 24692 transitions. [2022-12-13 14:53:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-12-13 14:53:15,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:15,507 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:53:15,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 14:53:15,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:15,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:53:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1674244107, now seen corresponding path program 1 times [2022-12-13 14:53:15,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:15,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978463879] [2022-12-13 14:53:15,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:53:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:53:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:53:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:53:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:53:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:53:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:53:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:53:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 14:53:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 14:53:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 14:53:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 14:53:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 14:53:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-12-13 14:53:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-12-13 14:53:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-12-13 14:53:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-12-13 14:53:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-12-13 14:53:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-12-13 14:53:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-12-13 14:53:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-12-13 14:53:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-12-13 14:53:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2022-12-13 14:53:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978463879] [2022-12-13 14:53:15,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978463879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384552644] [2022-12-13 14:53:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:15,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:15,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:15,874 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:15,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 14:53:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:15,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:53:15,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-12-13 14:53:16,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:53:16,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384552644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:53:16,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:53:16,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:53:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676069583] [2022-12-13 14:53:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:53:16,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:53:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:53:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:16,096 INFO L87 Difference]: Start difference. First operand 21530 states and 24692 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-12-13 14:53:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:17,374 INFO L93 Difference]: Finished difference Result 40972 states and 47306 transitions. [2022-12-13 14:53:17,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:53:17,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 315 [2022-12-13 14:53:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:17,405 INFO L225 Difference]: With dead ends: 40972 [2022-12-13 14:53:17,405 INFO L226 Difference]: Without dead ends: 16566 [2022-12-13 14:53:17,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:17,430 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 46 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:17,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 410 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:53:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16566 states. [2022-12-13 14:53:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16566 to 16406. [2022-12-13 14:53:18,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16406 states, 12876 states have (on average 1.1533861447654552) internal successors, (14851), 13052 states have internal predecessors, (14851), 1754 states have call successors, (1754), 1404 states have call predecessors, (1754), 1775 states have return successors, (2299), 1950 states have call predecessors, (2299), 1754 states have call successors, (2299) [2022-12-13 14:53:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16406 states to 16406 states and 18904 transitions. [2022-12-13 14:53:18,382 INFO L78 Accepts]: Start accepts. Automaton has 16406 states and 18904 transitions. Word has length 315 [2022-12-13 14:53:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:18,383 INFO L495 AbstractCegarLoop]: Abstraction has 16406 states and 18904 transitions. [2022-12-13 14:53:18,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-12-13 14:53:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16406 states and 18904 transitions. [2022-12-13 14:53:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-12-13 14:53:18,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 14:53:18,389 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:18,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 14:53:18,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 14:53:18,590 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-12-13 14:53:18,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:53:18,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1771155976, now seen corresponding path program 1 times [2022-12-13 14:53:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:53:18,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101606049] [2022-12-13 14:53:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:53:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 14:53:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 14:53:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 14:53:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 14:53:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-12-13 14:53:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-12-13 14:53:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-12-13 14:53:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 14:53:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 14:53:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-12-13 14:53:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-12-13 14:53:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 14:53:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-12-13 14:53:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-12-13 14:53:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-12-13 14:53:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-12-13 14:53:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-12-13 14:53:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 14:53:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 14:53:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-12-13 14:53:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-12-13 14:53:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-12-13 14:53:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 14:53:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 14:53:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-12-13 14:53:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-12-13 14:53:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2022-12-13 14:53:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:53:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101606049] [2022-12-13 14:53:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101606049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:53:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509256794] [2022-12-13 14:53:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:53:18,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:53:18,766 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:53:18,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 14:53:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:53:18,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:53:18,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:53:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-12-13 14:53:19,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:53:19,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509256794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:53:19,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:53:19,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-12-13 14:53:19,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205384694] [2022-12-13 14:53:19,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:53:19,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:53:19,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:53:19,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:53:19,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:19,074 INFO L87 Difference]: Start difference. First operand 16406 states and 18904 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-12-13 14:53:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:53:19,251 INFO L93 Difference]: Finished difference Result 17538 states and 20260 transitions. [2022-12-13 14:53:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:53:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 326 [2022-12-13 14:53:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 14:53:19,254 INFO L225 Difference]: With dead ends: 17538 [2022-12-13 14:53:19,254 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 14:53:19,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 14:53:19,267 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 14:53:19,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 14:53:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 14:53:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 14:53:19,268 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 14:53:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 14:53:19,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 326 [2022-12-13 14:53:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 14:53:19,269 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:53:19,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-12-13 14:53:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 14:53:19,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 14:53:19,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-12-13 14:53:19,271 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-12-13 14:53:19,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-12-13 14:53:19,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-12-13 14:53:19,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-12-13 14:53:19,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-12-13 14:53:19,276 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 14:53:19,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:53:19,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 14:54:28,239 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~q_free~0 0))) (.cse3 (not .cse19)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse17 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23)) (.cse20 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse12 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (and .cse23 (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse14 (not (<= ~c_num_read~0 0))) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse6 (not (<= 0 ~p_num_write~0))) (.cse16 (not .cse18)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse8 (not (<= 0 ~t~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse1 .cse12 .cse19 .cse20 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse22 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse22 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse18 .cse1 .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse19 .cse4 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse22 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse22 .cse12 .cse3 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse22 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse2 .cse3 .cse13 .cse14 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse22 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse17 .cse1 .cse12 .cse3 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse22 .cse1 .cse12 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse11 .cse22 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10)))) [2022-12-13 14:54:28,240 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 1))) (let ((.cse23 (= |old(~p_dw_st~0)| 0)) (.cse31 (= ~p_dw_st~0 0)) (.cse27 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse30 (= ~c_dr_pc~0 1)) (.cse34 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse32 (< 0 (+ activate_threads_~tmp~1 1))) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse29 (= ~q_req_up~0 0)) (.cse3 (not .cse24)) (.cse33 (<= activate_threads_~tmp~1 0))) (let ((.cse25 (and .cse34 .cse32 .cse28 .cse29 .cse3 .cse33)) (.cse21 (and .cse34 .cse27 .cse28 .cse29 .cse30 .cse24)) (.cse26 (and .cse34 .cse32 .cse28 .cse33)) (.cse16 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse20 (not (<= 2 ~fast_clk_edge~0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and .cse34 .cse28)) (.cse2 (not (= ~q_free~0 0))) (.cse4 (and .cse28 .cse31)) (.cse0 (not .cse29)) (.cse13 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse14 (not .cse27)) (.cse15 (and .cse32 .cse28 .cse31 .cse33)) (.cse5 (not .cse30)) (.cse17 (not (<= ~c_num_read~0 0))) (.cse6 (not (<= 0 ~c_num_read~0))) (.cse18 (not (<= ~p_num_write~0 0))) (.cse7 (not (<= 0 ~p_num_write~0))) (.cse19 (not .cse23)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse9 (not (<= 0 ~t~0))) (.cse10 (not (= ~fast_clk_edge~0 1))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse20 .cse21 .cse14 .cse3 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse23 .cse20 .cse2 .cse24 .cse17 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11) (or .cse0 .cse13 .cse20 .cse14 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse23 .cse2 .cse24 .cse17 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse14 .cse3 .cse16 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse26 .cse23 .cse24 .cse5 .cse8 .cse9 .cse11) (or .cse0 .cse21 .cse14 .cse3 (and .cse27 .cse28 .cse29 .cse30 .cse24 .cse31) .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse22 .cse0 .cse12 .cse20 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse26 .cse23 .cse24 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse26 .cse23 .cse14 .cse24 .cse16 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse20 .cse1 .cse14 .cse3 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse11) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse13 .cse14 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11))))) [2022-12-13 14:54:28,240 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-12-13 14:54:28,241 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-12-13 14:54:28,241 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-12-13 14:54:28,241 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 379 403) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~q_free~0 0))) (.cse3 (not .cse19)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse17 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23)) (.cse20 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse12 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (and .cse23 (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse14 (not (<= ~c_num_read~0 0))) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse6 (not (<= 0 ~p_num_write~0))) (.cse16 (not .cse18)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse8 (not (<= 0 ~t~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse1 .cse12 .cse19 .cse20 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse22 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse22 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse18 .cse1 .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse19 .cse4 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse22 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse22 .cse12 .cse3 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse22 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse2 .cse3 .cse13 .cse14 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse22 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse17 .cse1 .cse12 .cse3 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse22 .cse1 .cse12 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse11 .cse22 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10)))) [2022-12-13 14:54:28,241 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-12-13 14:54:28,241 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-12-13 14:54:28,242 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 287 306) the Hoare annotation is: true [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-12-13 14:54:28,242 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-12-13 14:54:28,243 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1)) (.cse15 (= ~p_dw_st~0 0))) (let ((.cse20 (not .cse15)) (.cse21 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse18 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse17 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse5 (not (<= ~c_num_read~0 0))) (.cse1 (not (= ~q_req_up~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 ~slow_clk_edge~0))) (.cse4 (not .cse14)) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse6 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse10 (not (<= 0 ~t~0))) (.cse11 (not (= ~fast_clk_edge~0 1))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 (not (<= ~q_free~0 0)) .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse20 .cse21 .cse17 .cse13 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse17 .cse14 .cse18 .cse15 .cse6 .cse9 .cse10 .cse12) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse22 .cse2 .cse17 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse20 .cse21 .cse22 .cse17 .cse13 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse2 .cse17 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse17 .cse13 .cse4 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse22 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse22 .cse3 .cse13 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse22 .cse17 .cse13 .cse4 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse3 .cse13 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-12-13 14:54:28,243 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-12-13 14:54:28,243 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-12-13 14:54:28,243 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 91 119) the Hoare annotation is: true [2022-12-13 14:54:28,243 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-12-13 14:54:28,243 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-12-13 14:54:28,243 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-12-13 14:54:28,244 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 307 324) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse18 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (<= 2 ~fast_clk_edge~0))) (.cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not .cse3)) (.cse14 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= ~p_num_write~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (<= 0 ~c_num_read~0))) (.cse16 (not (<= 0 ~p_num_write~0))) (.cse7 (not (<= 0 ~t~0))) (.cse8 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse2 .cse13 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse12 .cse13 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse2 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse13 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse3 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9)))) [2022-12-13 14:54:28,244 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-12-13 14:54:28,244 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-12-13 14:54:28,244 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-12-13 14:54:28,245 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 32 51) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~p_dw_pc~0 |old(~q_req_up~0)|))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (<= ~c_num_read~0 0))) (.cse16 (not .cse19)) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse3 (not (= ~q_free~0 0))) (.cse18 (not (= ~c_dr_pc~0 1))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse17 (and (= ~q_req_up~0 0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_read_ev~0 2))) (.cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (not (= |old(~q_req_up~0)| 0))) (.cse10 (not (<= 0 ~t~0))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse16 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse1 .cse12 .cse2 .cse16 .cse13 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse16 .cse5 .cse18 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse5 .cse18 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse18 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse19 .cse4 .cse5 .cse18 .cse9 .cse10 .cse11) (or .cse1 .cse3 .cse16 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse3 .cse13 .cse4 .cse5 .cse18 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse12 .cse2 .cse19 .cse13 .cse4 .cse5 .cse9 .cse10 .cse11)))) [2022-12-13 14:54:28,245 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-12-13 14:54:28,245 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 254 268) the Hoare annotation is: (let ((.cse1 (= ~p_dw_pc~0 1)) (.cse22 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse24 (= ~q_read_ev~0 2))) (let ((.cse8 (not (<= ~c_dr_pc~0 0))) (.cse9 (and .cse22 .cse23 .cse24 (= ~q_req_up~0 ~p_dw_pc~0))) (.cse15 (not (= ~p_dw_pc~0 |old(~q_req_up~0)|))) (.cse0 (and .cse22 .cse23 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse24)) (.cse13 (not (= ~q_free~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse10 (not (<= 2 ~fast_clk_edge~0))) (.cse11 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse20 (and .cse22 .cse23 .cse24 (= ~c_dr_pc~0 ~q_req_up~0))) (.cse12 (not (= ~c_dr_st~0 0))) (.cse14 (not .cse1)) (.cse21 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse3 (not (= |old(~q_read_ev~0)| 2))) (.cse16 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= 0 ~c_num_read~0))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse18 (not (<= 0 ~p_num_write~0))) (.cse5 (not (= |old(~q_req_up~0)| 0))) (.cse6 (not (<= 0 ~t~0))) (.cse7 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse3 .cse15 .cse16 .cse17 .cse18 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse14 .cse3 .cse4 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (<= ~q_free~0 0)) .cse2 .cse3 .cse4 .cse17 .cse18 .cse6 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse14 .cse3 .cse16 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse2 .cse3 .cse16 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse9 .cse10 .cse11 .cse3 .cse4 .cse15 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse11 .cse20 .cse12 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse10 .cse11 .cse20 .cse12 .cse21 .cse3 .cse15 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse13 .cse14 .cse3 .cse4 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse10 .cse20 .cse13 .cse21 .cse2 .cse3 .cse4 .cse17 .cse18 .cse6 .cse7) (or .cse10 .cse11 .cse20 .cse12 .cse14 .cse21 .cse3 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7)))) [2022-12-13 14:54:28,245 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-12-13 14:54:28,245 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-12-13 14:54:28,245 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-12-13 14:54:28,245 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 325 342) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse18 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (<= 2 ~fast_clk_edge~0))) (.cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not .cse3)) (.cse14 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= ~p_num_write~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (<= 0 ~c_num_read~0))) (.cse16 (not (<= 0 ~p_num_write~0))) (.cse7 (not (<= 0 ~t~0))) (.cse8 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse2 .cse13 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse12 .cse13 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse2 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse13 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse3 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9)))) [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-12-13 14:54:28,246 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-12-13 14:54:28,247 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse1 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse14 (not .cse8)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse2 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~fast_clk_edge~0 1)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse5 .cse6 .cse14 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse16 .cse15 .cse11) (and .cse0 .cse13 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse0 .cse13 .cse4 .cse5 .cse7 .cse14 .cse9 (<= ~q_free~0 0) .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse18 .cse11) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse18 .cse11)))) [2022-12-13 14:54:28,247 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-12-13 14:54:28,247 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-12-13 14:54:28,247 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-12-13 14:54:28,247 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-12-13 14:54:28,247 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 145 193) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1))) (let ((.cse15 (<= ~p_num_write~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse9 (<= ~c_num_read~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse6 (not .cse17)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse12 (<= 2 ~fast_clk_edge~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse14 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse12 .cse13 .cse14) (and .cse1 .cse15 .cse2 .cse9 .cse3 .cse10 .cse4 .cse5 .cse16 .cse7 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse9 .cse3 .cse10 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse16 .cse7 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse11 .cse17 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse16 .cse6 .cse7 (<= ~q_free~0 0) .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse17 .cse7 .cse12 .cse18 .cse8 .cse14)))) [2022-12-13 14:54:28,247 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 476 534) the Hoare annotation is: true [2022-12-13 14:54:28,248 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L351-1(line 351) no Hoare annotation was computed. [2022-12-13 14:54:28,248 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= 0 ~c_num_read~0)) [2022-12-13 14:54:28,248 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-12-13 14:54:28,249 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,249 INFO L895 garLoopResultBuilder]: At program point L171(lines 171 179) the Hoare annotation is: (let ((.cse0 (<= 0 ~t~0)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= ~c_num_read~0 0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (<= 2 ~fast_clk_edge~0)) (.cse9 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 1) .cse7 .cse8 .cse9) (and (= ~c_dr_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse8 (<= ~c_dr_pc~0 0) .cse9))) [2022-12-13 14:54:28,249 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-12-13 14:54:28,249 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,249 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-13 14:54:28,250 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-13 14:54:28,250 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-12-13 14:54:28,250 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 198 252) the Hoare annotation is: false [2022-12-13 14:54:28,250 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,250 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,251 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2022-12-13 14:54:28,251 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-13 14:54:28,251 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 14:54:28,251 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,251 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-12-13 14:54:28,251 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-12-13 14:54:28,251 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= 0 ~c_num_read~0)) [2022-12-13 14:54:28,252 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-12-13 14:54:28,252 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,252 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,252 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-12-13 14:54:28,252 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-12-13 14:54:28,252 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 554 565) the Hoare annotation is: true [2022-12-13 14:54:28,252 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-12-13 14:54:28,253 INFO L895 garLoopResultBuilder]: At program point $Ultimate##36(lines 171 179) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse12 (<= ~p_num_write~0 0)) (.cse3 (<= ~c_num_read~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_req_up~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (<= 2 ~fast_clk_edge~0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= ~c_dr_pc~0 ~q_req_up~0) .cse11) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8 .cse9 .cse10 .cse11))) [2022-12-13 14:54:28,253 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-12-13 14:54:28,253 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 14:54:28,253 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 491 528) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,253 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-12-13 14:54:28,253 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 195 253) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse13 (not .cse8)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse12 (not (= ~p_dw_st~0 0))) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (<= 2 ~fast_clk_edge~0)) (.cse14 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse5 .cse6 .cse7 .cse13 .cse9) (and .cse0 .cse12 .cse4 .cse5 .cse7 .cse13 .cse9 (<= ~q_free~0 0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11) (and .cse0 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse14 (= ~c_dr_pc~0 ~q_req_up~0) .cse11)))) [2022-12-13 14:54:28,254 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-12-13 14:54:28,254 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2022-12-13 14:54:28,254 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-12-13 14:54:28,254 INFO L895 garLoopResultBuilder]: At program point L244-1(lines 210 247) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse9 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (<= ~c_num_read~0 0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse5 (<= 2 ~fast_clk_edge~0)) (.cse0 (<= 0 ~t~0)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse13 (not .cse14)) (.cse8 (= ~q_read_ev~0 2)) (.cse10 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (and .cse6 .cse7 (= ~c_dr_pc~0 1) .cse8 .cse9) (and .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 ~q_req_up~0))) .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse12 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse4 .cse7 .cse13 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse3 .cse4 .cse7 .cse14 .cse8 .cse5 .cse10) (and .cse0 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse5 .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse13 .cse8 (<= ~q_free~0 0) .cse10)))) [2022-12-13 14:54:28,254 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-12-13 14:54:28,254 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 14:54:28,254 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-12-13 14:54:28,255 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 404 456) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,255 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-12-13 14:54:28,255 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-12-13 14:54:28,255 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,255 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 164 187) the Hoare annotation is: (let ((.cse16 (= ~p_dw_pc~0 1))) (let ((.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~p_num_write~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (not .cse16)) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (<= ~c_num_read~0 0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 0 ~p_num_write~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_free~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (<= 2 ~fast_clk_edge~0)) (.cse10 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse16 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~q_req_up~0 ~p_dw_pc~0) .cse10)))) [2022-12-13 14:54:28,255 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 14:54:28,255 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L231-1(line 231) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-13 14:54:28,256 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-12-13 14:54:28,257 INFO L899 garLoopResultBuilder]: For program point L183-1(line 183) no Hoare annotation was computed. [2022-12-13 14:54:28,257 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 457 475) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-12-13 14:54:28,257 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-12-13 14:54:28,257 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-12-13 14:54:28,257 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse1 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse14 (not .cse8)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse2 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~fast_clk_edge~0 1)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse5 .cse6 .cse14 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse16 .cse15 .cse11) (and .cse0 .cse13 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse0 .cse13 .cse4 .cse5 .cse7 .cse14 .cse9 (<= ~q_free~0 0) .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse18 .cse11) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse18 .cse11)))) [2022-12-13 14:54:28,257 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1))) (let ((.cse4 (not (= ~c_dr_pc~0 1))) (.cse8 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse13 (not (<= ~p_num_write~0 0))) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse10 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse16 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse3 (= ~p_dw_st~0 0)) (.cse19 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse9 (not (<= 2 ~fast_clk_edge~0))) (.cse15 (not (= ~c_dr_st~0 0))) (.cse1 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse20 (not (= ~q_free~0 0))) (.cse17 (not .cse2)) (.cse11 (not (<= ~c_num_read~0 0))) (.cse12 (not (<= 0 ~c_num_read~0))) (.cse14 (not (<= 0 ~p_num_write~0))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (<= 0 ~t~0))) (.cse7 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse1 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse1 .cse2 (not (<= ~q_free~0 0)) .cse3 .cse4 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse15 .cse10 .cse1 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse15 .cse10 .cse1 .cse17 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse10 .cse1 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse0 .cse9 .cse10 .cse1 .cse17 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse19 .cse0 .cse15 .cse1 .cse20 .cse2 .cse3 .cse11 .cse12 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse19 .cse0 .cse9 .cse15 .cse1 .cse20 .cse3 .cse11 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse1 .cse20 .cse17 .cse4 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse15 .cse10 .cse1 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse0 .cse15 .cse10 .cse1 .cse2 .cse16 .cse3 .cse5 .cse6 .cse7) (or .cse19 .cse0 .cse9 .cse15 .cse1 .cse20 .cse17 .cse11 .cse12 .cse14 .cse5 .cse6 .cse7)))) [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 62 90) the Hoare annotation is: true [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-12-13 14:54:28,258 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2022-12-13 14:54:28,259 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-12-13 14:54:28,262 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 14:54:28,264 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:54:28,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:54:28 BoogieIcfgContainer [2022-12-13 14:54:28,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:54:28,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:54:28,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:54:28,318 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:54:28,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:52:29" (3/4) ... [2022-12-13 14:54:28,322 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 14:54:28,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2022-12-13 14:54:28,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-13 14:54:28,328 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-13 14:54:28,334 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 14:54:28,334 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 14:54:28,335 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 14:54:28,335 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 14:54:28,359 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((p_dw_pc == 1 || !(q_free <= 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((p_dw_pc == 1 || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((!(\old(q_read_ev) == \old(q_write_ev)) || !(c_dr_st == 0)) || p_dw_pc == 1) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) [2022-12-13 14:54:28,409 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 14:54:28,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:54:28,410 INFO L158 Benchmark]: Toolchain (without parser) took 119176.73ms. Allocated memory was 138.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 98.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-13 14:54:28,410 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:54:28,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.59ms. Allocated memory is still 138.4MB. Free memory was 98.4MB in the beginning and 84.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 14:54:28,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.11ms. Allocated memory is still 138.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:54:28,411 INFO L158 Benchmark]: Boogie Preprocessor took 19.85ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 81.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:54:28,411 INFO L158 Benchmark]: RCFGBuilder took 449.04ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 61.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 14:54:28,412 INFO L158 Benchmark]: TraceAbstraction took 118377.23ms. Allocated memory was 138.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 61.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-12-13 14:54:28,412 INFO L158 Benchmark]: Witness Printer took 91.33ms. Allocated memory is still 3.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-13 14:54:28,413 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.14ms. Allocated memory is still 138.4MB. Free memory is still 108.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.59ms. Allocated memory is still 138.4MB. Free memory was 98.4MB in the beginning and 84.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.11ms. Allocated memory is still 138.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.85ms. Allocated memory is still 138.4MB. Free memory was 83.1MB in the beginning and 81.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.04ms. Allocated memory is still 138.4MB. Free memory was 81.1MB in the beginning and 61.8MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 118377.23ms. Allocated memory was 138.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 61.4MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 91.33ms. Allocated memory is still 3.8GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: 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 9 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 118.3s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 68.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8063 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7960 mSDsluCounter, 10928 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7147 mSDsCounter, 1765 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7313 IncrementalHoareTripleChecker+Invalid, 9078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1765 mSolverCounterUnsat, 3781 mSDtfsCounter, 7313 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3627 GetRequests, 3319 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73408occurred in iteration=18, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 15783 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46935 PreInvPairs, 50841 NumberOfFragments, 14194 HoareAnnotationTreeSize, 46935 FomulaSimplifications, 6060 FormulaSimplificationTreeSizeReduction, 30.9s HoareSimplificationTime, 46 FomulaSimplificationsInter, 1586803 FormulaSimplificationTreeSizeReductionInter, 37.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 5865 NumberOfCodeBlocks, 5865 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5831 ConstructedInterpolants, 0 QuantifiedInterpolants, 10548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7380 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 6248/6416 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 6 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) || ((((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(q_req_up == 0) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i)) && ((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(q_free <= 0)) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || p_dw_pc == 1) || p_dw_st == 0) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(c_dr_pc == q_req_up)) || p_dw_st == 0) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i)) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) && ((((((((((!(2 <= slow_clk_edge) || p_dw_pc == 1) || !(q_free <= 0)) || p_dw_st == 0) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || p_dw_pc == 1) || !(c_dr_pc == q_req_up)) || p_dw_st == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_free == 0)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(q_req_up == 0) || !(q_free == 0)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && t <= 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && 2 <= fast_clk_edge) && (((((q_write_ev == q_read_ev && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && q_req_up == p_dw_pc) || ((((q_write_ev == q_read_ev && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up))) && 0 <= c_num_read) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (((((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && t <= 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) || (((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && t <= 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || ((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((p_dw_pc == 1 || !(q_free <= 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((p_dw_pc == 1 || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((!(\old(q_read_ev) == \old(q_write_ev)) || !(c_dr_st == 0)) || p_dw_pc == 1) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && 0 <= c_num_read) || ((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && fast_clk_edge == 1) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc <= 0) && 0 <= c_num_read) RESULT: Ultimate proved your program to be correct! [2022-12-13 14:54:28,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_402a681b-2ba9-463e-958a-987d0db013cb/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