./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e8a051df57e56efae0cb5613a57ca5c3282a2fa11253acd8ce156f1494498073 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 22:51:52,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:51:52,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:51:52,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:51:52,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:51:52,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:51:52,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:51:52,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:51:52,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:51:52,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:51:52,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:51:52,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:51:52,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:51:52,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:51:52,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:51:52,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:51:52,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:51:52,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:51:52,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:51:52,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:51:52,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:51:52,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:51:52,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:51:52,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:51:52,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:51:52,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:51:52,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:51:52,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:51:52,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:51:52,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:51:52,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:51:52,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:51:52,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:51:52,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:51:52,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:51:52,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:51:52,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:51:52,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:51:52,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:51:52,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:51:52,250 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:51:52,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:51:52,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:51:52,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:51:52,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:51:52,316 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:51:52,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:51:52,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:51:52,318 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:51:52,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:51:52,319 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:51:52,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:51:52,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:51:52,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:51:52,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:51:52,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:51:52,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:51:52,322 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:51:52,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:51:52,323 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:51:52,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:51:52,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:51:52,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:51:52,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:51:52,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:51:52,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:51:52,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:51:52,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:51:52,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:51:52,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:51:52,326 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:51:52,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:51:52,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:51:52,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:51:52,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/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_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> e8a051df57e56efae0cb5613a57ca5c3282a2fa11253acd8ce156f1494498073 [2021-10-28 22:51:52,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:51:52,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:51:52,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:51:52,662 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:51:52,663 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:51:52,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-28 22:51:52,772 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/data/ebcb9a126/d4188980efe44ced90717532740142e6/FLAGfbe016e2e [2021-10-28 22:51:53,332 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:51:53,333 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/sv-benchmarks/c/systemc/toy.cil.c [2021-10-28 22:51:53,346 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/data/ebcb9a126/d4188980efe44ced90717532740142e6/FLAGfbe016e2e [2021-10-28 22:51:53,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/data/ebcb9a126/d4188980efe44ced90717532740142e6 [2021-10-28 22:51:53,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:51:53,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:51:53,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:51:53,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:51:53,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:51:53,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:51:53" (1/1) ... [2021-10-28 22:51:53,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec2fdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:53, skipping insertion in model container [2021-10-28 22:51:53,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:51:53" (1/1) ... [2021-10-28 22:51:53,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:51:53,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:51:53,965 WARN L228 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_2fcffd1b-af20-4a79-b3df-76768c9dbede/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-28 22:51:54,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:51:54,090 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:51:54,109 WARN L228 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_2fcffd1b-af20-4a79-b3df-76768c9dbede/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-28 22:51:54,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:51:54,181 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:51:54,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54 WrapperNode [2021-10-28 22:51:54,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:51:54,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:51:54,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:51:54,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:51:54,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:51:54,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:51:54,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:51:54,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:51:54,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:51:54,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:51:54,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:51:54,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:51:54,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (1/1) ... [2021-10-28 22:51:54,309 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:51:54,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:51:54,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:51:54,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:51:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:51:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:51:54,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:51:54,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:51:55,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:51:55,051 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-28 22:51:55,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:51:55 BoogieIcfgContainer [2021-10-28 22:51:55,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:51:55,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:51:55,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:51:55,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:51:55,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:51:53" (1/3) ... [2021-10-28 22:51:55,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcb6be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:51:55, skipping insertion in model container [2021-10-28 22:51:55,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:51:54" (2/3) ... [2021-10-28 22:51:55,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fcb6be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:51:55, skipping insertion in model container [2021-10-28 22:51:55,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:51:55" (3/3) ... [2021-10-28 22:51:55,069 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-28 22:51:55,076 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:51:55,076 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 22:51:55,138 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:51:55,147 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 22:51:55,147 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 22:51:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:55,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:55,180 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:55,181 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:55,181 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-10-28 22:51:55,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:55,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772532733] [2021-10-28 22:51:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:55,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:55,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:55,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772532733] [2021-10-28 22:51:55,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772532733] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:55,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:55,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:55,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829375220] [2021-10-28 22:51:55,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:55,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:55,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:55,577 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:55,675 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-10-28 22:51:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:55,699 INFO L225 Difference]: With dead ends: 244 [2021-10-28 22:51:55,699 INFO L226 Difference]: Without dead ends: 122 [2021-10-28 22:51:55,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-28 22:51:55,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-28 22:51:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 121 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-10-28 22:51:55,782 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-10-28 22:51:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:55,784 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-10-28 22:51:55,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-10-28 22:51:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:55,791 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:55,791 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:55,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:51:55,792 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-10-28 22:51:55,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:55,797 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861618063] [2021-10-28 22:51:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:55,798 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:55,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:55,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861618063] [2021-10-28 22:51:55,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861618063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:55,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:55,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:55,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071847123] [2021-10-28 22:51:55,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:55,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:55,961 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:56,076 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2021-10-28 22:51:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:51:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:56,086 INFO L225 Difference]: With dead ends: 328 [2021-10-28 22:51:56,086 INFO L226 Difference]: Without dead ends: 209 [2021-10-28 22:51:56,089 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-28 22:51:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2021-10-28 22:51:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7609756097560976) internal successors, (361), 205 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2021-10-28 22:51:56,137 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2021-10-28 22:51:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:56,138 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2021-10-28 22:51:56,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2021-10-28 22:51:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:56,146 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:56,147 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:56,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:51:56,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-10-28 22:51:56,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:56,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708166822] [2021-10-28 22:51:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:56,151 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:56,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:56,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708166822] [2021-10-28 22:51:56,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708166822] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:56,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:56,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:56,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951040299] [2021-10-28 22:51:56,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:56,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:56,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:56,237 INFO L87 Difference]: Start difference. First operand 206 states and 361 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:56,291 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2021-10-28 22:51:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:56,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:56,295 INFO L225 Difference]: With dead ends: 403 [2021-10-28 22:51:56,295 INFO L226 Difference]: Without dead ends: 206 [2021-10-28 22:51:56,297 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:56,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-10-28 22:51:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-10-28 22:51:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7024390243902439) internal successors, (349), 205 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2021-10-28 22:51:56,319 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2021-10-28 22:51:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:56,320 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2021-10-28 22:51:56,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2021-10-28 22:51:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:56,322 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:56,322 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:56,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:51:56,323 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-10-28 22:51:56,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:56,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225571911] [2021-10-28 22:51:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:56,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:56,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:56,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225571911] [2021-10-28 22:51:56,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225571911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:56,381 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:56,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:56,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414037800] [2021-10-28 22:51:56,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:56,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:56,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:56,384 INFO L87 Difference]: Start difference. First operand 206 states and 349 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:56,498 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2021-10-28 22:51:56,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:56,502 INFO L225 Difference]: With dead ends: 559 [2021-10-28 22:51:56,503 INFO L226 Difference]: Without dead ends: 363 [2021-10-28 22:51:56,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-10-28 22:51:56,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2021-10-28 22:51:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6878048780487804) internal successors, (346), 205 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2021-10-28 22:51:56,526 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2021-10-28 22:51:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:56,527 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2021-10-28 22:51:56,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2021-10-28 22:51:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:56,529 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:56,529 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:56,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:51:56,530 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:56,531 INFO L85 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-10-28 22:51:56,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:56,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428034712] [2021-10-28 22:51:56,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:56,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:56,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:56,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428034712] [2021-10-28 22:51:56,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428034712] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:56,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:56,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:56,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097473596] [2021-10-28 22:51:56,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:56,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:56,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:56,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:56,578 INFO L87 Difference]: Start difference. First operand 206 states and 346 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:56,666 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2021-10-28 22:51:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:56,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:56,670 INFO L225 Difference]: With dead ends: 562 [2021-10-28 22:51:56,670 INFO L226 Difference]: Without dead ends: 367 [2021-10-28 22:51:56,671 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-10-28 22:51:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2021-10-28 22:51:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.673170731707317) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2021-10-28 22:51:56,706 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2021-10-28 22:51:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:56,707 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2021-10-28 22:51:56,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2021-10-28 22:51:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:56,710 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:56,710 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:56,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:51:56,711 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-10-28 22:51:56,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:56,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067889580] [2021-10-28 22:51:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:56,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:56,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:56,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067889580] [2021-10-28 22:51:56,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067889580] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:56,795 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:56,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:56,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573300917] [2021-10-28 22:51:56,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:56,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:56,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:56,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:56,807 INFO L87 Difference]: Start difference. First operand 206 states and 343 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:56,900 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2021-10-28 22:51:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:56,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:56,915 INFO L225 Difference]: With dead ends: 574 [2021-10-28 22:51:56,915 INFO L226 Difference]: Without dead ends: 380 [2021-10-28 22:51:56,916 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-28 22:51:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-10-28 22:51:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.6445497630331753) internal successors, (347), 211 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2021-10-28 22:51:56,937 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2021-10-28 22:51:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:56,940 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2021-10-28 22:51:56,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2021-10-28 22:51:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:56,943 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:56,943 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:56,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:51:56,944 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:56,945 INFO L85 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-10-28 22:51:56,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:56,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557471785] [2021-10-28 22:51:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:56,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:57,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:57,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557471785] [2021-10-28 22:51:57,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557471785] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:57,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:57,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:57,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549706365] [2021-10-28 22:51:57,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:57,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:57,036 INFO L87 Difference]: Start difference. First operand 212 states and 347 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:57,162 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2021-10-28 22:51:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:57,170 INFO L225 Difference]: With dead ends: 721 [2021-10-28 22:51:57,170 INFO L226 Difference]: Without dead ends: 522 [2021-10-28 22:51:57,172 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-10-28 22:51:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2021-10-28 22:51:57,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.6337209302325582) internal successors, (562), 344 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2021-10-28 22:51:57,202 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2021-10-28 22:51:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:57,203 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2021-10-28 22:51:57,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2021-10-28 22:51:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:57,205 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:57,205 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:57,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:51:57,206 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-10-28 22:51:57,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:57,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838729651] [2021-10-28 22:51:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:57,209 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:57,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:57,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838729651] [2021-10-28 22:51:57,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838729651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:57,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:57,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:57,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297764222] [2021-10-28 22:51:57,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:57,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:57,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:57,279 INFO L87 Difference]: Start difference. First operand 345 states and 562 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:57,348 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2021-10-28 22:51:57,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:57,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:57,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:57,353 INFO L225 Difference]: With dead ends: 822 [2021-10-28 22:51:57,354 INFO L226 Difference]: Without dead ends: 501 [2021-10-28 22:51:57,355 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-28 22:51:57,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2021-10-28 22:51:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6305220883534137) internal successors, (812), 498 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2021-10-28 22:51:57,396 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2021-10-28 22:51:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:57,397 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2021-10-28 22:51:57,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2021-10-28 22:51:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:57,398 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:57,398 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:57,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:51:57,399 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:57,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-10-28 22:51:57,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:57,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584054366] [2021-10-28 22:51:57,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:57,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:57,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:57,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584054366] [2021-10-28 22:51:57,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584054366] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:57,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:57,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:57,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661106708] [2021-10-28 22:51:57,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:57,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:57,478 INFO L87 Difference]: Start difference. First operand 499 states and 812 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:57,593 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2021-10-28 22:51:57,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:51:57,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:57,600 INFO L225 Difference]: With dead ends: 1271 [2021-10-28 22:51:57,601 INFO L226 Difference]: Without dead ends: 789 [2021-10-28 22:51:57,602 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-10-28 22:51:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2021-10-28 22:51:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6144578313253013) internal successors, (804), 498 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2021-10-28 22:51:57,650 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2021-10-28 22:51:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:57,650 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2021-10-28 22:51:57,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,651 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2021-10-28 22:51:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:57,651 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:57,652 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:57,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:51:57,652 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:57,653 INFO L85 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-10-28 22:51:57,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:57,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018529915] [2021-10-28 22:51:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:57,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:57,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:57,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018529915] [2021-10-28 22:51:57,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018529915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:57,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:57,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:57,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388158502] [2021-10-28 22:51:57,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:57,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:57,730 INFO L87 Difference]: Start difference. First operand 499 states and 804 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:57,875 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2021-10-28 22:51:57,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:51:57,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:57,882 INFO L225 Difference]: With dead ends: 1267 [2021-10-28 22:51:57,882 INFO L226 Difference]: Without dead ends: 791 [2021-10-28 22:51:57,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-28 22:51:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2021-10-28 22:51:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.5983935742971886) internal successors, (796), 498 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2021-10-28 22:51:57,944 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2021-10-28 22:51:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:57,946 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2021-10-28 22:51:57,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2021-10-28 22:51:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:57,948 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:57,949 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:57,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:51:57,949 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-10-28 22:51:57,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:57,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947964776] [2021-10-28 22:51:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:57,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:58,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:58,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947964776] [2021-10-28 22:51:58,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947964776] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:58,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:58,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:58,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517919871] [2021-10-28 22:51:58,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:58,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:58,018 INFO L87 Difference]: Start difference. First operand 499 states and 796 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:58,170 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2021-10-28 22:51:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:51:58,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:58,176 INFO L225 Difference]: With dead ends: 1206 [2021-10-28 22:51:58,177 INFO L226 Difference]: Without dead ends: 724 [2021-10-28 22:51:58,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-10-28 22:51:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2021-10-28 22:51:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5622710622710623) internal successors, (853), 546 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2021-10-28 22:51:58,235 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2021-10-28 22:51:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:58,235 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2021-10-28 22:51:58,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2021-10-28 22:51:58,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-28 22:51:58,237 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:58,237 INFO L513 BasicCegarLoop]: 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] [2021-10-28 22:51:58,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:51:58,238 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-10-28 22:51:58,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:58,239 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500746649] [2021-10-28 22:51:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:58,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:58,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:58,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500746649] [2021-10-28 22:51:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500746649] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:58,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241792286] [2021-10-28 22:51:58,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:58,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,302 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:58,409 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2021-10-28 22:51:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-10-28 22:51:58,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:58,416 INFO L225 Difference]: With dead ends: 1300 [2021-10-28 22:51:58,416 INFO L226 Difference]: Without dead ends: 767 [2021-10-28 22:51:58,418 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-10-28 22:51:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2021-10-28 22:51:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.54259501965924) internal successors, (1177), 763 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2021-10-28 22:51:58,486 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2021-10-28 22:51:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:58,487 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2021-10-28 22:51:58,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2021-10-28 22:51:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 22:51:58,488 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:58,488 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:51:58,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:51:58,489 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-10-28 22:51:58,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:58,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311717836] [2021-10-28 22:51:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:58,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:58,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:58,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311717836] [2021-10-28 22:51:58,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311717836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:58,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:58,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:58,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783687289] [2021-10-28 22:51:58,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:58,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:58,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,531 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:58,630 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2021-10-28 22:51:58,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:58,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-28 22:51:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:58,638 INFO L225 Difference]: With dead ends: 1882 [2021-10-28 22:51:58,638 INFO L226 Difference]: Without dead ends: 1145 [2021-10-28 22:51:58,640 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-10-28 22:51:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2021-10-28 22:51:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.5551663747810858) internal successors, (1776), 1142 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2021-10-28 22:51:58,772 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2021-10-28 22:51:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:58,773 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2021-10-28 22:51:58,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2021-10-28 22:51:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 22:51:58,775 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:58,775 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:51:58,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:51:58,776 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:58,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-10-28 22:51:58,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:58,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196116897] [2021-10-28 22:51:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:58,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 22:51:58,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:58,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196116897] [2021-10-28 22:51:58,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196116897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:58,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:58,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:58,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008782236] [2021-10-28 22:51:58,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:58,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:58,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,819 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:58,929 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2021-10-28 22:51:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-28 22:51:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:58,938 INFO L225 Difference]: With dead ends: 2237 [2021-10-28 22:51:58,939 INFO L226 Difference]: Without dead ends: 1121 [2021-10-28 22:51:58,944 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-10-28 22:51:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2021-10-28 22:51:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5616071428571427) internal successors, (1749), 1120 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2021-10-28 22:51:59,042 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2021-10-28 22:51:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:59,043 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2021-10-28 22:51:59,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2021-10-28 22:51:59,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 22:51:59,044 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:59,045 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:51:59,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:51:59,045 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-10-28 22:51:59,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:59,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270260807] [2021-10-28 22:51:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:59,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:59,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:59,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270260807] [2021-10-28 22:51:59,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270260807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:59,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:59,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:59,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175226626] [2021-10-28 22:51:59,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:59,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:59,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:59,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:59,089 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:59,265 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2021-10-28 22:51:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:59,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-28 22:51:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:59,280 INFO L225 Difference]: With dead ends: 2849 [2021-10-28 22:51:59,280 INFO L226 Difference]: Without dead ends: 1755 [2021-10-28 22:51:59,282 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-10-28 22:51:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2021-10-28 22:51:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.5747716894977168) internal successors, (2759), 1752 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2021-10-28 22:51:59,445 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2021-10-28 22:51:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:59,446 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2021-10-28 22:51:59,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2021-10-28 22:51:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 22:51:59,448 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:59,448 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:51:59,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:51:59,449 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-10-28 22:51:59,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:59,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532313262] [2021-10-28 22:51:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:59,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:51:59,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:59,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532313262] [2021-10-28 22:51:59,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532313262] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:59,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:59,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:59,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741067802] [2021-10-28 22:51:59,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:59,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:59,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:59,485 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:51:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:59,768 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2021-10-28 22:51:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-10-28 22:51:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:59,791 INFO L225 Difference]: With dead ends: 4716 [2021-10-28 22:51:59,791 INFO L226 Difference]: Without dead ends: 2992 [2021-10-28 22:51:59,795 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:59,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2021-10-28 22:52:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2021-10-28 22:52:00,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2989 states have (on average 1.5878220140515222) internal successors, (4746), 2989 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2021-10-28 22:52:00,136 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2021-10-28 22:52:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:00,137 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2021-10-28 22:52:00,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2021-10-28 22:52:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 22:52:00,139 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:00,140 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:00,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 22:52:00,140 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-10-28 22:52:00,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:00,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108503999] [2021-10-28 22:52:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:00,142 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-28 22:52:00,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:00,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108503999] [2021-10-28 22:52:00,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108503999] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:00,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:00,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:00,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785766769] [2021-10-28 22:52:00,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:00,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:00,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:00,168 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:00,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:00,430 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2021-10-28 22:52:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:00,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-10-28 22:52:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:00,452 INFO L225 Difference]: With dead ends: 5929 [2021-10-28 22:52:00,452 INFO L226 Difference]: Without dead ends: 2968 [2021-10-28 22:52:00,461 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2021-10-28 22:52:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2021-10-28 22:52:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2967 states have (on average 1.5908324907313784) internal successors, (4720), 2967 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2021-10-28 22:52:00,748 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2021-10-28 22:52:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:00,748 INFO L470 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2021-10-28 22:52:00,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2021-10-28 22:52:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-28 22:52:00,750 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:00,750 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:00,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 22:52:00,750 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:00,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-10-28 22:52:00,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:00,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320558770] [2021-10-28 22:52:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:00,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:52:00,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:00,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320558770] [2021-10-28 22:52:00,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320558770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:00,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:00,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:52:00,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494122417] [2021-10-28 22:52:00,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:52:00,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:52:00,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:52:00,795 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:01,231 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2021-10-28 22:52:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:52:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-10-28 22:52:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:01,260 INFO L225 Difference]: With dead ends: 7517 [2021-10-28 22:52:01,261 INFO L226 Difference]: Without dead ends: 3845 [2021-10-28 22:52:01,267 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-10-28 22:52:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-10-28 22:52:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5832466181061395) internal successors, (6086), 3844 states have internal predecessors, (6086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2021-10-28 22:52:01,728 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2021-10-28 22:52:01,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:01,729 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2021-10-28 22:52:01,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2021-10-28 22:52:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 22:52:01,732 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:01,732 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:01,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 22:52:01,733 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1609174737, now seen corresponding path program 1 times [2021-10-28 22:52:01,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:01,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88551300] [2021-10-28 22:52:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:01,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:52:01,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:01,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88551300] [2021-10-28 22:52:01,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88551300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:01,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:01,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:52:01,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582348279] [2021-10-28 22:52:01,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:52:01,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:01,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:52:01,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:01,781 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:02,423 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2021-10-28 22:52:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 22:52:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-28 22:52:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:02,467 INFO L225 Difference]: With dead ends: 9812 [2021-10-28 22:52:02,467 INFO L226 Difference]: Without dead ends: 5990 [2021-10-28 22:52:02,473 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:52:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2021-10-28 22:52:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2021-10-28 22:52:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.5481646273637375) internal successors, (6959), 4495 states have internal predecessors, (6959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2021-10-28 22:52:02,908 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2021-10-28 22:52:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:02,908 INFO L470 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2021-10-28 22:52:02,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2021-10-28 22:52:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-28 22:52:02,913 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:02,913 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:02,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 22:52:02,914 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:02,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-10-28 22:52:02,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:02,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673168294] [2021-10-28 22:52:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:02,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:52:02,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:02,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673168294] [2021-10-28 22:52:02,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673168294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:02,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:02,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:02,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136676121] [2021-10-28 22:52:02,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:02,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:02,954 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:03,434 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2021-10-28 22:52:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:03,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-10-28 22:52:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:03,450 INFO L225 Difference]: With dead ends: 9315 [2021-10-28 22:52:03,450 INFO L226 Difference]: Without dead ends: 4848 [2021-10-28 22:52:03,457 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2021-10-28 22:52:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2021-10-28 22:52:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4816 states, 4815 states have (on average 1.4969885773624092) internal successors, (7208), 4815 states have internal predecessors, (7208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:04,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2021-10-28 22:52:04,022 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2021-10-28 22:52:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:04,022 INFO L470 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2021-10-28 22:52:04,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2021-10-28 22:52:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-28 22:52:04,028 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:04,028 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:04,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 22:52:04,029 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-10-28 22:52:04,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:04,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552390388] [2021-10-28 22:52:04,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:04,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:52:04,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:04,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552390388] [2021-10-28 22:52:04,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552390388] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:04,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:04,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:04,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859942640] [2021-10-28 22:52:04,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:04,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:04,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:04,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:04,068 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:04,460 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2021-10-28 22:52:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-10-28 22:52:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:04,474 INFO L225 Difference]: With dead ends: 10113 [2021-10-28 22:52:04,474 INFO L226 Difference]: Without dead ends: 5338 [2021-10-28 22:52:04,484 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-10-28 22:52:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2021-10-28 22:52:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 5289 states have (on average 1.4465872565702402) internal successors, (7651), 5289 states have internal predecessors, (7651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2021-10-28 22:52:04,881 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2021-10-28 22:52:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:04,882 INFO L470 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2021-10-28 22:52:04,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2021-10-28 22:52:04,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-28 22:52:04,887 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:04,888 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:04,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 22:52:04,888 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:04,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-10-28 22:52:04,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:04,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278857475] [2021-10-28 22:52:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:04,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 22:52:04,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:04,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278857475] [2021-10-28 22:52:04,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278857475] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:04,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:04,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:04,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956660930] [2021-10-28 22:52:04,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:04,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:04,931 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:05,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:05,489 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2021-10-28 22:52:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:05,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2021-10-28 22:52:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:05,504 INFO L225 Difference]: With dead ends: 10887 [2021-10-28 22:52:05,504 INFO L226 Difference]: Without dead ends: 5658 [2021-10-28 22:52:05,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2021-10-28 22:52:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2021-10-28 22:52:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5075 states have (on average 1.383448275862069) internal successors, (7021), 5075 states have internal predecessors, (7021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2021-10-28 22:52:05,992 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2021-10-28 22:52:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:05,993 INFO L470 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2021-10-28 22:52:05,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2021-10-28 22:52:06,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-28 22:52:06,002 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:06,003 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:06,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 22:52:06,003 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-10-28 22:52:06,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:06,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670458673] [2021-10-28 22:52:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:06,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 22:52:06,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:06,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670458673] [2021-10-28 22:52:06,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670458673] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:06,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:06,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:52:06,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662844858] [2021-10-28 22:52:06,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:52:06,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:52:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:52:06,064 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:06,819 INFO L93 Difference]: Finished difference Result 9480 states and 13045 transitions. [2021-10-28 22:52:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:52:06,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-10-28 22:52:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:06,834 INFO L225 Difference]: With dead ends: 9480 [2021-10-28 22:52:06,835 INFO L226 Difference]: Without dead ends: 4855 [2021-10-28 22:52:06,843 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2021-10-28 22:52:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2021-10-28 22:52:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.3356540084388187) internal successors, (6331), 4740 states have internal predecessors, (6331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:07,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6331 transitions. [2021-10-28 22:52:07,279 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6331 transitions. Word has length 89 [2021-10-28 22:52:07,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:07,280 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 6331 transitions. [2021-10-28 22:52:07,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6331 transitions. [2021-10-28 22:52:07,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-28 22:52:07,298 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:07,298 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:07,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 22:52:07,299 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-10-28 22:52:07,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:07,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391663487] [2021-10-28 22:52:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:07,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-28 22:52:07,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:07,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391663487] [2021-10-28 22:52:07,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391663487] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:07,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:07,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:07,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127387364] [2021-10-28 22:52:07,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:07,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:07,347 INFO L87 Difference]: Start difference. First operand 4741 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:07,824 INFO L93 Difference]: Finished difference Result 9037 states and 12059 transitions. [2021-10-28 22:52:07,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:07,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-10-28 22:52:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:07,837 INFO L225 Difference]: With dead ends: 9037 [2021-10-28 22:52:07,837 INFO L226 Difference]: Without dead ends: 4687 [2021-10-28 22:52:07,844 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-10-28 22:52:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2021-10-28 22:52:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4686 states have (on average 1.3284250960307298) internal successors, (6225), 4686 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6225 transitions. [2021-10-28 22:52:08,345 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6225 transitions. Word has length 116 [2021-10-28 22:52:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:08,345 INFO L470 AbstractCegarLoop]: Abstraction has 4687 states and 6225 transitions. [2021-10-28 22:52:08,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6225 transitions. [2021-10-28 22:52:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-28 22:52:08,360 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:08,360 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:08,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 22:52:08,361 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-10-28 22:52:08,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:08,362 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143695900] [2021-10-28 22:52:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:08,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-28 22:52:08,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:08,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143695900] [2021-10-28 22:52:08,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143695900] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:08,412 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:08,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:52:08,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953505710] [2021-10-28 22:52:08,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:52:08,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:52:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:52:08,414 INFO L87 Difference]: Start difference. First operand 4687 states and 6225 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:08,821 INFO L93 Difference]: Finished difference Result 8325 states and 11081 transitions. [2021-10-28 22:52:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:52:08,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-10-28 22:52:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:08,832 INFO L225 Difference]: With dead ends: 8325 [2021-10-28 22:52:08,833 INFO L226 Difference]: Without dead ends: 4607 [2021-10-28 22:52:08,838 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2021-10-28 22:52:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2021-10-28 22:52:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.3040834057341442) internal successors, (6004), 4604 states have internal predecessors, (6004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:09,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6004 transitions. [2021-10-28 22:52:09,278 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6004 transitions. Word has length 128 [2021-10-28 22:52:09,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:09,278 INFO L470 AbstractCegarLoop]: Abstraction has 4605 states and 6004 transitions. [2021-10-28 22:52:09,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6004 transitions. [2021-10-28 22:52:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-28 22:52:09,292 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:09,293 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:09,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 22:52:09,293 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-10-28 22:52:09,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:09,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658094490] [2021-10-28 22:52:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:09,296 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-28 22:52:09,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:09,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658094490] [2021-10-28 22:52:09,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658094490] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:09,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:09,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:09,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10960587] [2021-10-28 22:52:09,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:09,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:09,366 INFO L87 Difference]: Start difference. First operand 4605 states and 6004 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:09,839 INFO L93 Difference]: Finished difference Result 8823 states and 11496 transitions. [2021-10-28 22:52:09,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-10-28 22:52:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:09,845 INFO L225 Difference]: With dead ends: 8823 [2021-10-28 22:52:09,845 INFO L226 Difference]: Without dead ends: 4604 [2021-10-28 22:52:09,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2021-10-28 22:52:10,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2021-10-28 22:52:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4563 states have (on average 1.2976112206881438) internal successors, (5921), 4563 states have internal predecessors, (5921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:10,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5921 transitions. [2021-10-28 22:52:10,206 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5921 transitions. Word has length 134 [2021-10-28 22:52:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:10,206 INFO L470 AbstractCegarLoop]: Abstraction has 4564 states and 5921 transitions. [2021-10-28 22:52:10,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:10,207 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5921 transitions. [2021-10-28 22:52:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-28 22:52:10,218 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:10,218 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:10,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 22:52:10,219 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:10,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:10,219 INFO L85 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-10-28 22:52:10,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:10,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186250862] [2021-10-28 22:52:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:10,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-28 22:52:10,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:10,264 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186250862] [2021-10-28 22:52:10,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186250862] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:10,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:10,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:10,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116036024] [2021-10-28 22:52:10,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:10,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:10,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:10,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:10,267 INFO L87 Difference]: Start difference. First operand 4564 states and 5921 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:10,612 INFO L93 Difference]: Finished difference Result 8762 states and 11357 transitions. [2021-10-28 22:52:10,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:10,613 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2021-10-28 22:52:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:10,618 INFO L225 Difference]: With dead ends: 8762 [2021-10-28 22:52:10,619 INFO L226 Difference]: Without dead ends: 4574 [2021-10-28 22:52:10,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2021-10-28 22:52:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2021-10-28 22:52:11,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 4533 states have (on average 1.2905360688285903) internal successors, (5850), 4533 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5850 transitions. [2021-10-28 22:52:11,073 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5850 transitions. Word has length 134 [2021-10-28 22:52:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:11,074 INFO L470 AbstractCegarLoop]: Abstraction has 4534 states and 5850 transitions. [2021-10-28 22:52:11,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5850 transitions. [2021-10-28 22:52:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-28 22:52:11,086 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:11,086 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:11,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 22:52:11,087 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:11,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:11,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-10-28 22:52:11,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:11,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725575054] [2021-10-28 22:52:11,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:11,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-28 22:52:11,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:11,139 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725575054] [2021-10-28 22:52:11,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725575054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:11,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:11,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:52:11,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730421508] [2021-10-28 22:52:11,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:52:11,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:11,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:52:11,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:52:11,142 INFO L87 Difference]: Start difference. First operand 4534 states and 5850 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:11,484 INFO L93 Difference]: Finished difference Result 7387 states and 9578 transitions. [2021-10-28 22:52:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:52:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-10-28 22:52:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:11,490 INFO L225 Difference]: With dead ends: 7387 [2021-10-28 22:52:11,490 INFO L226 Difference]: Without dead ends: 3225 [2021-10-28 22:52:11,496 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:11,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2021-10-28 22:52:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2021-10-28 22:52:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 1.2576039726877715) internal successors, (4052), 3222 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:11,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4052 transitions. [2021-10-28 22:52:11,837 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4052 transitions. Word has length 137 [2021-10-28 22:52:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:11,838 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 4052 transitions. [2021-10-28 22:52:11,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4052 transitions. [2021-10-28 22:52:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-28 22:52:11,845 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:11,845 INFO L513 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:11,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 22:52:11,846 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-10-28 22:52:11,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:11,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130241778] [2021-10-28 22:52:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:11,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-28 22:52:11,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:11,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130241778] [2021-10-28 22:52:11,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130241778] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:11,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:11,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:52:11,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761931919] [2021-10-28 22:52:11,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:52:11,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:11,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:52:11,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:52:11,905 INFO L87 Difference]: Start difference. First operand 3223 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:12,166 INFO L93 Difference]: Finished difference Result 5208 states and 6552 transitions. [2021-10-28 22:52:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:52:12,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2021-10-28 22:52:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:12,170 INFO L225 Difference]: With dead ends: 5208 [2021-10-28 22:52:12,170 INFO L226 Difference]: Without dead ends: 2057 [2021-10-28 22:52:12,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:52:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2021-10-28 22:52:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2021-10-28 22:52:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2054 states have (on average 1.2239532619279454) internal successors, (2514), 2054 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2514 transitions. [2021-10-28 22:52:12,339 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2514 transitions. Word has length 137 [2021-10-28 22:52:12,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:12,340 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 2514 transitions. [2021-10-28 22:52:12,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2514 transitions. [2021-10-28 22:52:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-28 22:52:12,343 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:12,343 INFO L513 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:12,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 22:52:12,344 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-10-28 22:52:12,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:12,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400221267] [2021-10-28 22:52:12,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:12,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-28 22:52:12,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:12,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400221267] [2021-10-28 22:52:12,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400221267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:12,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:12,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:12,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249060888] [2021-10-28 22:52:12,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:12,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:12,400 INFO L87 Difference]: Start difference. First operand 2055 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:12,687 INFO L93 Difference]: Finished difference Result 3727 states and 4591 transitions. [2021-10-28 22:52:12,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:12,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2021-10-28 22:52:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:12,691 INFO L225 Difference]: With dead ends: 3727 [2021-10-28 22:52:12,691 INFO L226 Difference]: Without dead ends: 2013 [2021-10-28 22:52:12,693 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-10-28 22:52:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2021-10-28 22:52:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.2078593588417788) internal successors, (2336), 1934 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2336 transitions. [2021-10-28 22:52:12,972 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2336 transitions. Word has length 176 [2021-10-28 22:52:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:12,972 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2336 transitions. [2021-10-28 22:52:12,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2336 transitions. [2021-10-28 22:52:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-28 22:52:12,977 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:12,978 INFO L513 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:12,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 22:52:12,978 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-10-28 22:52:12,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:12,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583923903] [2021-10-28 22:52:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:12,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-28 22:52:13,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:13,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583923903] [2021-10-28 22:52:13,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583923903] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:13,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:13,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:13,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135977758] [2021-10-28 22:52:13,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:13,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:13,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:13,050 INFO L87 Difference]: Start difference. First operand 1935 states and 2336 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:13,347 INFO L93 Difference]: Finished difference Result 4164 states and 5063 transitions. [2021-10-28 22:52:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2021-10-28 22:52:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:13,352 INFO L225 Difference]: With dead ends: 4164 [2021-10-28 22:52:13,352 INFO L226 Difference]: Without dead ends: 2566 [2021-10-28 22:52:13,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2021-10-28 22:52:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2021-10-28 22:52:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.1916817359855334) internal successors, (2636), 2212 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2636 transitions. [2021-10-28 22:52:13,565 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2636 transitions. Word has length 182 [2021-10-28 22:52:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:13,566 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 2636 transitions. [2021-10-28 22:52:13,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2636 transitions. [2021-10-28 22:52:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-28 22:52:13,569 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:13,569 INFO L513 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:13,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 22:52:13,570 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-10-28 22:52:13,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:13,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797289957] [2021-10-28 22:52:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:13,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-28 22:52:13,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:13,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797289957] [2021-10-28 22:52:13,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797289957] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:13,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970883756] [2021-10-28 22:52:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:13,885 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:52:13,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:52:13,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:52:13,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 22:52:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:14,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-28 22:52:14,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:52:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-28 22:52:15,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970883756] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:15,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:52:15,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-10-28 22:52:15,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684418108] [2021-10-28 22:52:15,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-28 22:52:15,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-28 22:52:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-28 22:52:15,018 INFO L87 Difference]: Start difference. First operand 2213 states and 2636 transitions. Second operand has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:16,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:16,866 INFO L93 Difference]: Finished difference Result 7188 states and 8534 transitions. [2021-10-28 22:52:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-28 22:52:16,867 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2021-10-28 22:52:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:16,875 INFO L225 Difference]: With dead ends: 7188 [2021-10-28 22:52:16,876 INFO L226 Difference]: Without dead ends: 5299 [2021-10-28 22:52:16,881 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2021-10-28 22:52:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2021-10-28 22:52:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2902. [2021-10-28 22:52:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2901 states have (on average 1.1889003791795933) internal successors, (3449), 2901 states have internal predecessors, (3449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3449 transitions. [2021-10-28 22:52:17,264 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3449 transitions. Word has length 185 [2021-10-28 22:52:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:17,265 INFO L470 AbstractCegarLoop]: Abstraction has 2902 states and 3449 transitions. [2021-10-28 22:52:17,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3449 transitions. [2021-10-28 22:52:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-28 22:52:17,268 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:17,269 INFO L513 BasicCegarLoop]: trace histogram [7, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:17,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 22:52:17,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:52:17,493 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:17,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-10-28 22:52:17,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:17,493 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959239134] [2021-10-28 22:52:17,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:17,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:17,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-28 22:52:17,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:17,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959239134] [2021-10-28 22:52:17,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959239134] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:17,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202717198] [2021-10-28 22:52:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:17,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:52:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:52:17,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:52:17,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 22:52:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:17,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-28 22:52:17,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:52:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-28 22:52:19,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202717198] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:19,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:52:19,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-10-28 22:52:19,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642197763] [2021-10-28 22:52:19,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 22:52:19,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:19,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 22:52:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-28 22:52:19,802 INFO L87 Difference]: Start difference. First operand 2902 states and 3449 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:20,698 INFO L93 Difference]: Finished difference Result 6480 states and 7693 transitions. [2021-10-28 22:52:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 22:52:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2021-10-28 22:52:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:20,704 INFO L225 Difference]: With dead ends: 6480 [2021-10-28 22:52:20,704 INFO L226 Difference]: Without dead ends: 3902 [2021-10-28 22:52:20,708 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-10-28 22:52:20,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2021-10-28 22:52:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3099. [2021-10-28 22:52:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3098 states have (on average 1.185280826339574) internal successors, (3672), 3098 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3672 transitions. [2021-10-28 22:52:21,015 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3672 transitions. Word has length 191 [2021-10-28 22:52:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:21,015 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 3672 transitions. [2021-10-28 22:52:21,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3672 transitions. [2021-10-28 22:52:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-28 22:52:21,019 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:21,019 INFO L513 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:21,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 22:52:21,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-10-28 22:52:21,220 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-10-28 22:52:21,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:21,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153416704] [2021-10-28 22:52:21,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:21,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-28 22:52:21,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:21,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153416704] [2021-10-28 22:52:21,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153416704] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:21,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:21,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:21,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373999897] [2021-10-28 22:52:21,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:21,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:21,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:21,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:21,286 INFO L87 Difference]: Start difference. First operand 3099 states and 3672 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:21,578 INFO L93 Difference]: Finished difference Result 4753 states and 5608 transitions. [2021-10-28 22:52:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2021-10-28 22:52:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:21,581 INFO L225 Difference]: With dead ends: 4753 [2021-10-28 22:52:21,582 INFO L226 Difference]: Without dead ends: 2114 [2021-10-28 22:52:21,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2021-10-28 22:52:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2081. [2021-10-28 22:52:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.1576923076923078) internal successors, (2408), 2080 states have internal predecessors, (2408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2408 transitions. [2021-10-28 22:52:21,756 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2408 transitions. Word has length 251 [2021-10-28 22:52:21,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:21,756 INFO L470 AbstractCegarLoop]: Abstraction has 2081 states and 2408 transitions. [2021-10-28 22:52:21,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2408 transitions. [2021-10-28 22:52:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-10-28 22:52:21,759 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:21,759 INFO L513 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:21,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 22:52:21,760 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2068647826, now seen corresponding path program 1 times [2021-10-28 22:52:21,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:21,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059781139] [2021-10-28 22:52:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:21,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-10-28 22:52:21,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:21,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059781139] [2021-10-28 22:52:21,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059781139] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:21,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:21,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:21,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292091365] [2021-10-28 22:52:21,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:21,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:21,840 INFO L87 Difference]: Start difference. First operand 2081 states and 2408 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:21,971 INFO L93 Difference]: Finished difference Result 2385 states and 2747 transitions. [2021-10-28 22:52:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2021-10-28 22:52:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:21,973 INFO L225 Difference]: With dead ends: 2385 [2021-10-28 22:52:21,973 INFO L226 Difference]: Without dead ends: 815 [2021-10-28 22:52:21,974 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-10-28 22:52:22,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2021-10-28 22:52:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.106879606879607) internal successors, (901), 814 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:22,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 901 transitions. [2021-10-28 22:52:22,053 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 901 transitions. Word has length 275 [2021-10-28 22:52:22,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:22,054 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 901 transitions. [2021-10-28 22:52:22,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:22,054 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 901 transitions. [2021-10-28 22:52:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-10-28 22:52:22,056 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:22,057 INFO L513 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:22,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 22:52:22,057 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 625161699, now seen corresponding path program 1 times [2021-10-28 22:52:22,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:22,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702299974] [2021-10-28 22:52:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:22,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-10-28 22:52:22,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:22,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702299974] [2021-10-28 22:52:22,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702299974] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:52:22,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:52:22,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:52:22,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15922963] [2021-10-28 22:52:22,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:52:22,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:22,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:52:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:22,139 INFO L87 Difference]: Start difference. First operand 815 states and 901 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:22,242 INFO L93 Difference]: Finished difference Result 1159 states and 1277 transitions. [2021-10-28 22:52:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:52:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2021-10-28 22:52:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:22,244 INFO L225 Difference]: With dead ends: 1159 [2021-10-28 22:52:22,244 INFO L226 Difference]: Without dead ends: 745 [2021-10-28 22:52:22,245 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:52:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-10-28 22:52:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 737. [2021-10-28 22:52:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.0991847826086956) internal successors, (809), 736 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2021-10-28 22:52:22,308 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 277 [2021-10-28 22:52:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:22,308 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2021-10-28 22:52:22,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2021-10-28 22:52:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-10-28 22:52:22,310 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:52:22,311 INFO L513 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:52:22,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 22:52:22,311 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:52:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:52:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash -469819346, now seen corresponding path program 1 times [2021-10-28 22:52:22,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:52:22,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074607184] [2021-10-28 22:52:22,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:22,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:52:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-28 22:52:22,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:52:22,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074607184] [2021-10-28 22:52:22,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074607184] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:22,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377059966] [2021-10-28 22:52:22,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:52:22,507 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 22:52:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:52:22,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 22:52:22,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-28 22:52:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:52:22,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-28 22:52:22,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 22:52:24,360 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-28 22:52:24,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377059966] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 22:52:24,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 22:52:24,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-10-28 22:52:24,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132810685] [2021-10-28 22:52:24,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 22:52:24,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:52:24,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 22:52:24,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-28 22:52:24,364 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:24,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:52:24,704 INFO L93 Difference]: Finished difference Result 1053 states and 1149 transitions. [2021-10-28 22:52:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 22:52:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2021-10-28 22:52:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:52:24,706 INFO L225 Difference]: With dead ends: 1053 [2021-10-28 22:52:24,706 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 22:52:24,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-28 22:52:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 22:52:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 22:52:24,707 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) [2021-10-28 22:52:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 22:52:24,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2021-10-28 22:52:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:52:24,708 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 22:52:24,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 22:52:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 22:52:24,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 22:52:24,712 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:52:24,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-28 22:52:24,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-28 22:52:24,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 22:52:24,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:24,956 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:25,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:25,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:26,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:26,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:26,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:28,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:29,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:29,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:29,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:29,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:29,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:30,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:30,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:31,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:31,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:31,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:32,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:32,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 22:52:43,085 WARN L207 SmtUtils]: Spent 5.10 s on a formula simplification. DAG size of input: 290 DAG size of output: 151 [2021-10-28 22:52:50,340 WARN L207 SmtUtils]: Spent 7.25 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-10-28 22:52:59,974 WARN L207 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 303 DAG size of output: 150 [2021-10-28 22:53:10,695 WARN L207 SmtUtils]: Spent 7.24 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-10-28 22:53:17,629 WARN L207 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 308 DAG size of output: 152 [2021-10-28 22:53:17,632 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-10-28 22:53:17,633 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse27 (= ~c2_st~0 0)) (.cse39 (+ ~t_b~0 1)) (.cse35 (= ~c1_st~0 0))) (let ((.cse2 (not .cse35)) (.cse37 (not (= ~e_c~0 0))) (.cse33 (= ~c2_pc~0 0)) (.cse25 (<= ~c_t~0 .cse39)) (.cse26 (= ~wb_pc~0 1)) (.cse28 (<= .cse39 ~c_t~0)) (.cse18 (= ~c1_pc~0 1)) (.cse29 (<= .cse39 ~data~0)) (.cse30 (not (= ~r_st~0 0))) (.cse32 (<= ~data~0 .cse39)) (.cse0 (not (= 0 ~wl_st~0))) (.cse9 (not (= 2 ~wl_pc~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse27)) (.cse34 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (= ~wb_pc~0 0)) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse19 (not (= ~wb_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse36 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse25 .cse2 .cse26 .cse27 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse32 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse5 .cse7 .cse37 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse36 .cse23) (let ((.cse38 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse26 (= .cse38 ~data~0) .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 (= .cse38 ~c_t~0) .cse31 .cse23)) (and .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse26 .cse5 .cse7 .cse37 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse31 .cse23) (and .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse25 .cse4 .cse26 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse35 .cse32 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24)))) [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-10-28 22:53:17,634 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-10-28 22:53:17,635 INFO L857 garLoopResultBuilder]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-10-28 22:53:17,635 INFO L857 garLoopResultBuilder]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,635 INFO L857 garLoopResultBuilder]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,635 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-10-28 22:53:17,635 INFO L857 garLoopResultBuilder]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-10-28 22:53:17,636 INFO L853 garLoopResultBuilder]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse22 (= ~wb_st~0 0)) (.cse24 (= ~c2_st~0 0))) (let ((.cse4 (not .cse24)) (.cse2 (+ ~t_b~0 1)) (.cse3 (not (= ~c1_st~0 0))) (.cse12 (= ~e_c~0 2)) (.cse16 (not .cse22)) (.cse17 (not (= ~r_st~0 0))) (.cse21 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse23 (not (= ~e_c~0 0))) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (<= ~c_t~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse2 ~c_t~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse2 ~data~0) .cse17 .cse18 .cse19 (<= ~data~0 .cse2) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse19 (= ~data~0 .cse2) .cse22 .cse20) (and .cse0 .cse1 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse23 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20)))) [2021-10-28 22:53:17,636 INFO L853 garLoopResultBuilder]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse26 (= ~c2_st~0 0)) (.cse29 (= ~c1_st~0 0)) (.cse31 (= ~wb_st~0 0))) (let ((.cse5 (= ~wb_pc~0 1)) (.cse20 (not .cse31)) (.cse27 (= ~c2_pc~0 0)) (.cse2 (not .cse29)) (.cse19 (= ~c1_pc~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse26)) (.cse28 (= ~c1_pc~0 0)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (= ~t_b~0 0)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~data~0 0)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 2 ~wl_pc~0))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_e~0 1))) (.cse30 (= ~wb_pc~0 0)) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse21 (= ~c2_pc~0 1)) (.cse22 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1)) (.cse25 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse5 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25)))) [2021-10-28 22:53:17,636 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-10-28 22:53:17,636 INFO L853 garLoopResultBuilder]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (not (= ~r_i~0 1))) (.cse2 (= ~e_g~0 ~e_f~0)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_c~0 2)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~e_wl~0 ~e_c~0)) (.cse7 (= ~e_f~0 2)) (.cse8 (= ~e_e~0 ~e_f~0)) (.cse9 (= ~c1_st~0 0)) (.cse10 (= 0 ~wl_pc~0)) (.cse11 (= ~wb_st~0 0)) (.cse12 (= ~c_req_up~0 ~r_i~0)) (.cse13 (= ~wb_i~0 1))) (or (and (not (= 0 ~wl_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~d~0 0) .cse0 (= ~c2_pc~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) .cse1 (= ~wb_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~processed~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~r_st~0 ~e_f~0)))) [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-10-28 22:53:17,637 INFO L857 garLoopResultBuilder]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,638 INFO L857 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-10-28 22:53:17,638 INFO L857 garLoopResultBuilder]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,638 INFO L857 garLoopResultBuilder]: For program point L538(line 538) no Hoare annotation was computed. [2021-10-28 22:53:17,638 INFO L857 garLoopResultBuilder]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,639 INFO L853 garLoopResultBuilder]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse20 (= ~c1_st~0 0)) (.cse40 (+ ~t_b~0 1)) (.cse47 (+ ~t_b~0 2))) (let ((.cse43 (= 2 ~wl_pc~0)) (.cse45 (= .cse47 ~data~0)) (.cse33 (= ~data~0 .cse40)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse27 (not .cse20)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse38 (= ~data~0 ~t_b~0)) (.cse17 (= ~e_f~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not .cse21)) (.cse32 (not (= ~r_st~0 0))) (.cse18 (= ~c2_pc~0 1)) (.cse31 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_i~0 1)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0))) (let ((.cse46 (= .cse47 ~c~0)) (.cse48 (= .cse47 ~c_t~0)) (.cse41 (<= .cse40 ~c~0)) (.cse42 (<= ~c~0 .cse40)) (.cse54 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse40)) (.cse35 (<= .cse40 ~c_t~0)) (.cse36 (<= .cse40 ~data~0)) (.cse37 (<= ~data~0 .cse40)) (.cse49 (<= 1 ~c~0)) (.cse50 (<= 1 ~c_t~0)) (.cse51 (<= ~c_t~0 1)) (.cse52 (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse33 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39))) (.cse53 (<= ~c~0 1)) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse43)) (.cse2 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse19 (= ~processed~0 0)) (.cse44 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse33 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse40) .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse42 (<= .cse40 ~d~0) .cse43 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse32 .cse18 (= .cse47 ~d~0) .cse48 .cse31 .cse43 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse18 .cse48 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse54 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse44 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse48 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse44 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse42 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse54 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse2 .cse6 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24))))) [2021-10-28 22:53:17,639 INFO L857 garLoopResultBuilder]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,639 INFO L857 garLoopResultBuilder]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,639 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L853 garLoopResultBuilder]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-10-28 22:53:17,640 INFO L853 garLoopResultBuilder]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2021-10-28 22:53:17,641 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-10-28 22:53:17,641 INFO L857 garLoopResultBuilder]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,641 INFO L857 garLoopResultBuilder]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-10-28 22:53:17,641 INFO L853 garLoopResultBuilder]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse41 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse37 (<= .cse33 ~c~0)) (.cse40 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse34 (= ~data~0 ~t_b~0)) (.cse35 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse36 (<= ~c_t~0 .cse33)) (.cse38 (<= .cse33 ~c_t~0)) (.cse39 (<= .cse33 ~data~0)) (.cse42 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse41)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse35) (and .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse40 (<= .cse33 ~d~0) .cse41 .cse42 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse42 .cse23) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse41 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse39 .cse32 .cse18 .cse19 .cse31 .cse42 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse18 .cse31 .cse40 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse35)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse20 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-28 22:53:17,642 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-10-28 22:53:17,642 INFO L853 garLoopResultBuilder]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_c~0 2)) (.cse10 (= ~c2_i~0 1)) (.cse11 (= ~e_f~0 2)) (.cse12 (= ~c1_pc~0 1)) (.cse13 (not (= ~wb_st~0 0))) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= ~e_wl~0 0))) (.cse16 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~data~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~processed~0 0) .cse15 (= ~c_req_up~0 ~r_i~0) .cse16 (= ~r_st~0 ~e_f~0)) (and (let ((.cse17 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= (+ ~t_b~0 2) ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 (= ~data~0 (+ ~t_b~0 1)) .cse16))) (= 2 ~wl_pc~0)))) [2021-10-28 22:53:17,642 INFO L857 garLoopResultBuilder]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-10-28 22:53:17,642 INFO L857 garLoopResultBuilder]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,642 INFO L857 garLoopResultBuilder]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-10-28 22:53:17,643 INFO L857 garLoopResultBuilder]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,643 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-10-28 22:53:17,643 INFO L853 garLoopResultBuilder]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse19 (= ~c1_st~0 0)) (.cse23 (= ~wb_st~0 0))) (let ((.cse14 (not .cse23)) (.cse22 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse10 (= ~e_c~0 2)) (.cse15 (not (= ~r_st~0 0))) (.cse17 (= ~processed~0 0)) (.cse21 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse24 (not (= ~e_c~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse16 (= ~c2_pc~0 1)) (.cse18 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~data~0 ~t_b~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse21 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse21 ~data~0) .cse15 .cse16 .cse18 (<= ~data~0 .cse21) .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= ~data~0 .cse21) .cse23 .cse20) (and .cse0 .cse1 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse18 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse24 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse16 .cse18 .cse20)))) [2021-10-28 22:53:17,643 INFO L853 garLoopResultBuilder]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2021-10-28 22:53:17,643 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-10-28 22:53:17,644 INFO L857 garLoopResultBuilder]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,644 INFO L853 garLoopResultBuilder]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse34 (= ~wb_st~0 0)) (.cse31 (= ~c2_st~0 0)) (.cse26 (+ ~t_b~0 1))) (let ((.cse28 (<= .cse26 ~data~0)) (.cse30 (<= ~data~0 .cse26)) (.cse35 (not (= ~e_c~0 0))) (.cse10 (not (= 2 ~wl_pc~0))) (.cse3 (= ~d~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse33 (= ~wb_pc~0 0)) (.cse20 (= ~processed~0 0)) (.cse25 (= 0 ~wl_pc~0)) (.cse23 (= ~r_st~0 ~e_f~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not .cse31)) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse27 (= ~c1_pc~0 1)) (.cse18 (not .cse34)) (.cse29 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse24 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= ~c_t~0 .cse26) .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 (<= .cse26 ~c_t~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse28 .cse29 .cse19 .cse24 .cse30 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse6 .cse8 .cse35 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse24 .cse25 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse31 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse28 .cse29 .cse19 .cse20 .cse24 .cse30 .cse34 .cse22) (and .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= (+ ~t_b~0 2) ~data~0) .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse29 .cse19 .cse20 .cse24 .cse34 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse35 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse27 .cse19 .cse24 .cse22) (and .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse29 .cse19 .cse24 .cse21 .cse22)))) [2021-10-28 22:53:17,644 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-10-28 22:53:17,644 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,645 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-10-28 22:53:17,646 INFO L857 garLoopResultBuilder]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-10-28 22:53:17,647 INFO L857 garLoopResultBuilder]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,648 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,648 INFO L853 garLoopResultBuilder]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse32 (+ ~t_b~0 2))) (let ((.cse31 (= .cse32 ~data~0)) (.cse22 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not (= ~c2_st~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse25 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse26 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_i~0 1))) (let ((.cse9 (not (= 2 ~wl_pc~0))) (.cse24 (not (= ~e_c~0 0))) (.cse3 (= ~d~0 0)) (.cse7 (= ~t_b~0 0)) (.cse27 (<= 1 ~c~0)) (.cse28 (<= 1 ~c_t~0)) (.cse29 (<= ~c_t~0 1)) (.cse23 (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 (= ~data~0 .cse22) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~data~0 ~t_b~0) .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)))) (.cse30 (<= ~c~0 1)) (.cse20 (= ~c_req_up~0 ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~data~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~processed~0 0) .cse20 .cse21 (= ~r_st~0 ~e_f~0)) (and (<= ~c_t~0 .cse22) (<= .cse22 ~c_t~0) .cse23 (<= .cse22 ~data~0) (<= ~data~0 .cse22)) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse25 .cse19 .cse26 .cse21) (and (<= 1 ~d~0) .cse7 (<= ~d~0 1) .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse6 .cse8 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse26 (= 0 ~wl_pc~0) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 (= .cse32 ~c_t~0) .cse26 .cse21) (and .cse3 .cse7 .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse20 .cse21))))) [2021-10-28 22:53:17,648 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-10-28 22:53:17,649 INFO L853 garLoopResultBuilder]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse5 (not (= ~e_c~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse17 (not (= ~c1_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse16 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse20 (not (= ~wb_st~0 0))) (.cse12 (not (= ~r_st~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse14 (not (= ~e_wl~0 0))) (.cse15 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse14 (= 0 ~wl_pc~0) .cse15) (let ((.cse19 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse17 .cse18 .cse2 (= .cse19 ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 (= .cse19 ~c~0) .cse20 .cse12 .cse13 (= .cse19 ~c_t~0) .cse14 .cse15)) (let ((.cse21 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse17 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse21 ~c~0) .cse7 (<= .cse21 ~c_t~0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 (= ~data~0 .cse21) (<= ~c~0 .cse21) .cse15)) (and .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 (= ~e_c~0 2) .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15))) [2021-10-28 22:53:17,649 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-28 22:53:17,649 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,649 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-10-28 22:53:17,649 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-10-28 22:53:17,649 INFO L857 garLoopResultBuilder]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,650 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-10-28 22:53:17,650 INFO L857 garLoopResultBuilder]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,650 INFO L853 garLoopResultBuilder]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse47 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-28 22:53:17,651 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-10-28 22:53:17,651 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-10-28 22:53:17,651 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-10-28 22:53:17,651 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 22:53:17,651 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-10-28 22:53:17,652 INFO L853 garLoopResultBuilder]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse22 (= ~c2_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse13 (not .cse24)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse14 (not .cse22)) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse11 (not (= ~e_wl~0 0))) (.cse23 (+ ~t_b~0 1)) (.cse12 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~wl_pc~0) .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= (+ ~t_b~0 2) ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse15 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 (<= .cse23 ~data~0) .cse19 .cse20 .cse21 .cse11 (<= ~data~0 .cse23) .cse12) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse20 .cse11 .cse12) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 (= ~data~0 .cse23) .cse24 .cse12)))) [2021-10-28 22:53:17,652 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-10-28 22:53:17,652 INFO L853 garLoopResultBuilder]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse15 (not (= ~r_st~0 0))) (.cse16 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse18 (= 2 ~wl_pc~0)) (.cse19 (= ~wb_i~0 1))) (or (let ((.cse3 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 (= .cse3 ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse3 ~c~0) .cse14 .cse15 .cse16 (= .cse3 ~d~0) (= .cse3 ~c_t~0) .cse17 .cse18 .cse19)) (let ((.cse20 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse20) .cse2 .cse4 .cse5 (<= ~d~0 .cse20) .cse6 (<= .cse20 ~c~0) .cse7 (<= .cse20 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse20 ~data~0) .cse15 .cse16 .cse17 (<= ~c~0 .cse20) (<= .cse20 ~d~0) .cse18 (<= ~data~0 .cse20) .cse19)))) [2021-10-28 22:53:17,652 INFO L857 garLoopResultBuilder]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,653 INFO L857 garLoopResultBuilder]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,653 INFO L853 garLoopResultBuilder]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-28 22:53:17,654 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-10-28 22:53:17,654 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse20 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0))) (let ((.cse18 (+ ~t_b~0 1)) (.cse32 (= ~wb_pc~0 0)) (.cse27 (= 0 ~wl_pc~0)) (.cse33 (not (= ~e_c~0 0))) (.cse30 (not .cse19)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~r_st~0 0))) (.cse15 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse22 (= ~d~0 0)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse23 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse24 (= ~t_b~0 0)) (.cse5 (not (= ~e_e~0 0))) (.cse25 (= ~data~0 0)) (.cse31 (not (= 2 ~wl_pc~0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse26 (not .cse20)) (.cse16 (= ~processed~0 0)) (.cse28 (= ~c_req_up~0 ~r_i~0)) (.cse21 (= ~wb_i~0 1)) (.cse29 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~data~0 .cse18) .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse17 .cse19 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 (<= ~c_t~0 .cse18) .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse18 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 (<= .cse18 ~data~0) .cse14 .cse15 .cse17 (<= ~data~0 .cse18) .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse19 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse27 .cse21) (and .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse30 .cse2 .cse3 (= (+ ~t_b~0 2) ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse33 .cse31 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse21) (and .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse17 .cse28 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse19 .cse28 .cse21 .cse29)))) [2021-10-28 22:53:17,654 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-10-28 22:53:17,654 INFO L857 garLoopResultBuilder]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-10-28 22:53:17,655 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-10-28 22:53:17,656 INFO L853 garLoopResultBuilder]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse13 (not (= ~c1_st~0 0))) (.cse14 (not (= ~c2_st~0 0))) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_wl~0 1))) (.cse7 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse8 (= ~c2_i~0 1)) (.cse9 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse10 (not (= ~e_wl~0 0))) (.cse11 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~wl_pc~0) .cse11) (let ((.cse12 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse12) .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 (<= ~d~0 .cse12) .cse5 (<= .cse12 ~c~0) (<= .cse12 ~c_t~0) .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse18 (<= .cse12 ~data~0) .cse19 .cse20 .cse10 (<= ~c~0 .cse12) (<= .cse12 ~d~0) (<= ~data~0 .cse12) .cse11)) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse19 .cse20 .cse10 .cse11) (let ((.cse21 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= .cse21 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 (= .cse21 ~c~0) .cse18 .cse19 .cse20 (= .cse21 ~d~0) (= .cse21 ~c_t~0) .cse10 .cse11)))) [2021-10-28 22:53:17,656 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-10-28 22:53:17,656 INFO L857 garLoopResultBuilder]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-10-28 22:53:17,656 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-10-28 22:53:17,657 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-10-28 22:53:17,658 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-10-28 22:53:17,658 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-10-28 22:53:17,661 INFO L731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 22:53:17,663 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 22:53:17,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 10:53:17 BoogieIcfgContainer [2021-10-28 22:53:17,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 22:53:17,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:53:17,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:53:17,850 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:53:17,850 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:51:55" (3/4) ... [2021-10-28 22:53:17,854 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 22:53:17,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 22:53:17,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 22:53:17,875 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 22:53:17,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 22:53:18,067 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:53:18,069 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:53:18,070 INFO L168 Benchmark]: Toolchain (without parser) took 84390.92 ms. Allocated memory was 96.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 61.0 MB in the beginning and 1.0 GB in the end (delta: -943.3 MB). Peak memory consumption was 848.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,071 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 96.5 MB. Free memory was 65.5 MB in the beginning and 65.4 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:53:18,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.54 ms. Allocated memory is still 96.5 MB. Free memory was 60.7 MB in the beginning and 68.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,072 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.67 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 65.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,073 INFO L168 Benchmark]: Boogie Preprocessor took 52.79 ms. Allocated memory is still 96.5 MB. Free memory was 65.9 MB in the beginning and 64.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,073 INFO L168 Benchmark]: RCFGBuilder took 755.07 ms. Allocated memory is still 96.5 MB. Free memory was 63.8 MB in the beginning and 44.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,073 INFO L168 Benchmark]: TraceAbstraction took 82792.71 ms. Allocated memory was 96.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 43.7 MB in the beginning and 1.0 GB in the end (delta: -984.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,075 INFO L168 Benchmark]: Witness Printer took 219.96 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-28 22:53:18,077 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.30 ms. Allocated memory is still 96.5 MB. Free memory was 65.5 MB in the beginning and 65.4 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 501.54 ms. Allocated memory is still 96.5 MB. Free memory was 60.7 MB in the beginning and 68.3 MB in the end (delta: -7.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.67 ms. Allocated memory is still 96.5 MB. Free memory was 68.3 MB in the beginning and 65.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.79 ms. Allocated memory is still 96.5 MB. Free memory was 65.9 MB in the beginning and 64.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 755.07 ms. Allocated memory is still 96.5 MB. Free memory was 63.8 MB in the beginning and 44.1 MB in the end (delta: 19.6 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 82792.71 ms. Allocated memory was 96.5 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 43.7 MB in the beginning and 1.0 GB in the end (delta: -984.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 219.96 ms. Allocated memory is still 1.9 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * 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: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 82.5s, OverallIterations: 37, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7966 SDtfs, 10702 SDslu, 14350 SDs, 0 SdLazy, 1550 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 765 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 867 NumberOfFragments, 21159 HoareAnnotationTreeSize, 20 FomulaSimplifications, 28919915 FormulaSimplificationTreeSizeReduction, 8.9s HoareSimplificationTime, 20 FomulaSimplificationsInter, 1256104 FormulaSimplificationTreeSizeReductionInter, 43.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 11459 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 2353/2774 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && c2_st == 0) && !(r_i == 1)) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) || (((((((((((((((((((((d == 0 && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && t_b == 0) && data == 0) && !(r_i == 1)) && wb_pc == 0) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && processed == 0) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && c <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1) && t == data)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || (((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((c_t <= t_b + 1 && t_b + 1 <= c_t) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && t_b + 1 <= data) && data <= t_b + 1)) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) RESULT: Ultimate proved your program to be correct! [2021-10-28 22:53:18,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fcffd1b-af20-4a79-b3df-76768c9dbede/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...