./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa --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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:01:08,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:01:08,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:01:08,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:01:08,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:01:08,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:01:08,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:01:08,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:01:08,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:01:08,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:01:08,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:01:08,522 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:01:08,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:01:08,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:01:08,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:01:08,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:01:08,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:01:08,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:01:08,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:01:08,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:01:08,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:01:08,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:01:08,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:01:08,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:01:08,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:01:08,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:01:08,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:01:08,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:01:08,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:01:08,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:01:08,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:01:08,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:01:08,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:01:08,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:01:08,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:01:08,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:01:08,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:01:08,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:01:08,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:01:08,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:01:08,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:01:08,545 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:01:08,563 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:01:08,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:01:08,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:01:08,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:01:08,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:01:08,564 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:01:08,564 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:01:08,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:01:08,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:01:08,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:01:08,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:01:08,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:01:08,567 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:01:08,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:01:08,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:01:08,568 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_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/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_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2021-12-07 00:01:08,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:01:08,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:01:08,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:01:08,776 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:01:08,777 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:01:08,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/systemc/toy.cil.c [2021-12-07 00:01:08,823 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/data/b0498ab83/7c9ecf0391a54751b30864004cb8e438/FLAG1ecb85c64 [2021-12-07 00:01:09,214 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:01:09,214 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/sv-benchmarks/c/systemc/toy.cil.c [2021-12-07 00:01:09,223 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/data/b0498ab83/7c9ecf0391a54751b30864004cb8e438/FLAG1ecb85c64 [2021-12-07 00:01:09,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/data/b0498ab83/7c9ecf0391a54751b30864004cb8e438 [2021-12-07 00:01:09,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:01:09,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:01:09,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:01:09,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:01:09,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:01:09,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7d5c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09, skipping insertion in model container [2021-12-07 00:01:09,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:01:09,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:01:09,381 WARN L230 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_89f17acc-db7c-4581-81d6-fe7dfff789d1/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2021-12-07 00:01:09,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:01:09,445 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:01:09,455 WARN L230 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_89f17acc-db7c-4581-81d6-fe7dfff789d1/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2021-12-07 00:01:09,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:01:09,498 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:01:09,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09 WrapperNode [2021-12-07 00:01:09,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:01:09,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:01:09,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:01:09,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:01:09,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,531 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 362 [2021-12-07 00:01:09,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:01:09,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:01:09,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:01:09,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:01:09,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:01:09,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:01:09,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:01:09,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:01:09,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (1/1) ... [2021-12-07 00:01:09,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:01:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:01:09,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:01:09,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:01:09,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:01:09,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:01:09,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:01:09,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:01:09,676 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:01:09,677 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:01:09,955 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:01:09,963 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:01:09,964 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-07 00:01:09,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:01:09 BoogieIcfgContainer [2021-12-07 00:01:09,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:01:09,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:01:09,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:01:09,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:01:09,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:01:09" (1/3) ... [2021-12-07 00:01:09,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6b6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:01:09, skipping insertion in model container [2021-12-07 00:01:09,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:01:09" (2/3) ... [2021-12-07 00:01:09,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff6b6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:01:09, skipping insertion in model container [2021-12-07 00:01:09,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:01:09" (3/3) ... [2021-12-07 00:01:09,974 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-12-07 00:01:09,979 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:01:09,980 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 00:01:10,026 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:01:10,033 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-12-07 00:01:10,033 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 00:01:10,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 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-12-07 00:01:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,060 INFO L514 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-12-07 00:01:10,061 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,066 INFO L85 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-12-07 00:01:10,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925463441] [2021-12-07 00:01:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925463441] [2021-12-07 00:01:10,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925463441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:10,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566152958] [2021-12-07 00:01:10,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:10,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:10,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:10,247 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 0 states have call successors, (0), 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-12-07 00:01:10,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,281 INFO L93 Difference]: Finished difference Result 255 states and 464 transitions. [2021-12-07 00:01:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:10,283 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-12-07 00:01:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,291 INFO L225 Difference]: With dead ends: 255 [2021-12-07 00:01:10,291 INFO L226 Difference]: Without dead ends: 127 [2021-12-07 00:01:10,293 INFO L932 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-12-07 00:01:10,296 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-07 00:01:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-07 00:01:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 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-12-07 00:01:10,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2021-12-07 00:01:10,330 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 36 [2021-12-07 00:01:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,330 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2021-12-07 00:01:10,330 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-12-07 00:01:10,330 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2021-12-07 00:01:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,332 INFO L514 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-12-07 00:01:10,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:01:10,332 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-12-07 00:01:10,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309632066] [2021-12-07 00:01:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,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-12-07 00:01:10,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309632066] [2021-12-07 00:01:10,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309632066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,381 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:10,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964385895] [2021-12-07 00:01:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:10,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:10,383 INFO L87 Difference]: Start difference. First operand 127 states and 220 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-12-07 00:01:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,427 INFO L93 Difference]: Finished difference Result 343 states and 592 transitions. [2021-12-07 00:01:10,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:01:10,428 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-12-07 00:01:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,430 INFO L225 Difference]: With dead ends: 343 [2021-12-07 00:01:10,430 INFO L226 Difference]: Without dead ends: 219 [2021-12-07 00:01:10,431 INFO L932 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-12-07 00:01:10,432 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 574 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 370 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-07 00:01:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2021-12-07 00:01:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.7255813953488373) internal successors, (371), 215 states have internal predecessors, (371), 0 states have call successors, (0), 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-12-07 00:01:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 371 transitions. [2021-12-07 00:01:10,452 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 371 transitions. Word has length 36 [2021-12-07 00:01:10,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,452 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 371 transitions. [2021-12-07 00:01:10,452 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-12-07 00:01:10,452 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 371 transitions. [2021-12-07 00:01:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,454 INFO L514 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-12-07 00:01:10,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:01:10,454 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,454 INFO L85 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-12-07 00:01:10,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018552634] [2021-12-07 00:01:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018552634] [2021-12-07 00:01:10,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018552634] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:10,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142144308] [2021-12-07 00:01:10,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:10,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:10,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:10,494 INFO L87 Difference]: Start difference. First operand 216 states and 371 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-12-07 00:01:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,534 INFO L93 Difference]: Finished difference Result 423 states and 729 transitions. [2021-12-07 00:01:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:10,535 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-12-07 00:01:10,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,537 INFO L225 Difference]: With dead ends: 423 [2021-12-07 00:01:10,537 INFO L226 Difference]: Without dead ends: 216 [2021-12-07 00:01:10,539 INFO L932 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-12-07 00:01:10,540 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-07 00:01:10,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2021-12-07 00:01:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.669767441860465) internal successors, (359), 215 states have internal predecessors, (359), 0 states have call successors, (0), 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-12-07 00:01:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 359 transitions. [2021-12-07 00:01:10,563 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 359 transitions. Word has length 36 [2021-12-07 00:01:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,563 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 359 transitions. [2021-12-07 00:01:10,563 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-12-07 00:01:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 359 transitions. [2021-12-07 00:01:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,565 INFO L514 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-12-07 00:01:10,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:01:10,565 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-12-07 00:01:10,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480735896] [2021-12-07 00:01:10,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480735896] [2021-12-07 00:01:10,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480735896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:10,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476785042] [2021-12-07 00:01:10,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:10,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:10,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:10,610 INFO L87 Difference]: Start difference. First operand 216 states and 359 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-12-07 00:01:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,680 INFO L93 Difference]: Finished difference Result 589 states and 980 transitions. [2021-12-07 00:01:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:10,681 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-12-07 00:01:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,683 INFO L225 Difference]: With dead ends: 589 [2021-12-07 00:01:10,683 INFO L226 Difference]: Without dead ends: 383 [2021-12-07 00:01:10,684 INFO L932 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-12-07 00:01:10,685 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 458 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-12-07 00:01:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 216. [2021-12-07 00:01:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.655813953488372) internal successors, (356), 215 states have internal predecessors, (356), 0 states have call successors, (0), 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-12-07 00:01:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2021-12-07 00:01:10,706 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 36 [2021-12-07 00:01:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,706 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2021-12-07 00:01:10,706 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-12-07 00:01:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2021-12-07 00:01:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,707 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,707 INFO L514 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-12-07 00:01:10,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:01:10,708 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-12-07 00:01:10,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443676861] [2021-12-07 00:01:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443676861] [2021-12-07 00:01:10,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443676861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:10,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419377605] [2021-12-07 00:01:10,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:10,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:10,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:10,742 INFO L87 Difference]: Start difference. First operand 216 states and 356 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-12-07 00:01:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,793 INFO L93 Difference]: Finished difference Result 590 states and 974 transitions. [2021-12-07 00:01:10,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:10,793 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-12-07 00:01:10,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,795 INFO L225 Difference]: With dead ends: 590 [2021-12-07 00:01:10,796 INFO L226 Difference]: Without dead ends: 385 [2021-12-07 00:01:10,796 INFO L932 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-12-07 00:01:10,797 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 367 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 465 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-07 00:01:10,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 216. [2021-12-07 00:01:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.6418604651162791) internal successors, (353), 215 states have internal predecessors, (353), 0 states have call successors, (0), 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-12-07 00:01:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 353 transitions. [2021-12-07 00:01:10,810 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 353 transitions. Word has length 36 [2021-12-07 00:01:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,810 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 353 transitions. [2021-12-07 00:01:10,810 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-12-07 00:01:10,810 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 353 transitions. [2021-12-07 00:01:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,811 INFO L514 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-12-07 00:01:10,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:01:10,812 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-12-07 00:01:10,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205113534] [2021-12-07 00:01:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205113534] [2021-12-07 00:01:10,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205113534] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:10,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540308468] [2021-12-07 00:01:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:10,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:10,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:10,841 INFO L87 Difference]: Start difference. First operand 216 states and 353 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-12-07 00:01:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:10,894 INFO L93 Difference]: Finished difference Result 604 states and 987 transitions. [2021-12-07 00:01:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:10,895 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-12-07 00:01:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:10,897 INFO L225 Difference]: With dead ends: 604 [2021-12-07 00:01:10,897 INFO L226 Difference]: Without dead ends: 400 [2021-12-07 00:01:10,897 INFO L932 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-12-07 00:01:10,898 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 373 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:10,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 473 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-12-07 00:01:10,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 222. [2021-12-07 00:01:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 221 states have internal predecessors, (357), 0 states have call successors, (0), 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-12-07 00:01:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 357 transitions. [2021-12-07 00:01:10,913 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 357 transitions. Word has length 36 [2021-12-07 00:01:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:10,913 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 357 transitions. [2021-12-07 00:01:10,914 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-12-07 00:01:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2021-12-07 00:01:10,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:10,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:10,915 INFO L514 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-12-07 00:01:10,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:01:10,916 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:10,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-12-07 00:01:10,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:10,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921833369] [2021-12-07 00:01:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:10,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:10,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:10,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921833369] [2021-12-07 00:01:10,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921833369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:10,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:10,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:10,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944797620] [2021-12-07 00:01:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:10,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:10,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:10,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:10,952 INFO L87 Difference]: Start difference. First operand 222 states and 357 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-12-07 00:01:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,032 INFO L93 Difference]: Finished difference Result 759 states and 1219 transitions. [2021-12-07 00:01:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:11,032 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-12-07 00:01:11,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,037 INFO L225 Difference]: With dead ends: 759 [2021-12-07 00:01:11,037 INFO L226 Difference]: Without dead ends: 550 [2021-12-07 00:01:11,037 INFO L932 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-12-07 00:01:11,038 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 569 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-07 00:01:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 365. [2021-12-07 00:01:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.598901098901099) internal successors, (582), 364 states have internal predecessors, (582), 0 states have call successors, (0), 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-12-07 00:01:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 582 transitions. [2021-12-07 00:01:11,071 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 582 transitions. Word has length 36 [2021-12-07 00:01:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,071 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 582 transitions. [2021-12-07 00:01:11,071 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-12-07 00:01:11,072 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 582 transitions. [2021-12-07 00:01:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:11,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,073 INFO L514 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-12-07 00:01:11,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:01:11,073 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-12-07 00:01:11,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029794836] [2021-12-07 00:01:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029794836] [2021-12-07 00:01:11,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029794836] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:11,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046668860] [2021-12-07 00:01:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:11,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:11,105 INFO L87 Difference]: Start difference. First operand 365 states and 582 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-12-07 00:01:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,150 INFO L93 Difference]: Finished difference Result 872 states and 1395 transitions. [2021-12-07 00:01:11,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:11,151 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-12-07 00:01:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,155 INFO L225 Difference]: With dead ends: 872 [2021-12-07 00:01:11,155 INFO L226 Difference]: Without dead ends: 531 [2021-12-07 00:01:11,156 INFO L932 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-12-07 00:01:11,157 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 177 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 342 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2021-12-07 00:01:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2021-12-07 00:01:11,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5946969696969697) internal successors, (842), 528 states have internal predecessors, (842), 0 states have call successors, (0), 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-12-07 00:01:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 842 transitions. [2021-12-07 00:01:11,190 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 842 transitions. Word has length 36 [2021-12-07 00:01:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,191 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 842 transitions. [2021-12-07 00:01:11,191 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-12-07 00:01:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 842 transitions. [2021-12-07 00:01:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:11,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,192 INFO L514 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-12-07 00:01:11,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 00:01:11,193 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-12-07 00:01:11,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49981659] [2021-12-07 00:01:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49981659] [2021-12-07 00:01:11,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49981659] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:11,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773920713] [2021-12-07 00:01:11,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:11,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:11,227 INFO L87 Difference]: Start difference. First operand 529 states and 842 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-12-07 00:01:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,305 INFO L93 Difference]: Finished difference Result 1347 states and 2145 transitions. [2021-12-07 00:01:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:01:11,306 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-12-07 00:01:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,311 INFO L225 Difference]: With dead ends: 1347 [2021-12-07 00:01:11,311 INFO L226 Difference]: Without dead ends: 835 [2021-12-07 00:01:11,312 INFO L932 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-12-07 00:01:11,313 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 484 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 330 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-12-07 00:01:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 529. [2021-12-07 00:01:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5795454545454546) internal successors, (834), 528 states have internal predecessors, (834), 0 states have call successors, (0), 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-12-07 00:01:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 834 transitions. [2021-12-07 00:01:11,346 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 834 transitions. Word has length 36 [2021-12-07 00:01:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,346 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 834 transitions. [2021-12-07 00:01:11,346 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-12-07 00:01:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 834 transitions. [2021-12-07 00:01:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:11,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,347 INFO L514 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-12-07 00:01:11,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 00:01:11,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-12-07 00:01:11,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127784226] [2021-12-07 00:01:11,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127784226] [2021-12-07 00:01:11,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127784226] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:11,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531981660] [2021-12-07 00:01:11,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:11,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:11,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:11,379 INFO L87 Difference]: Start difference. First operand 529 states and 834 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-12-07 00:01:11,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,443 INFO L93 Difference]: Finished difference Result 1347 states and 2122 transitions. [2021-12-07 00:01:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:01:11,443 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-12-07 00:01:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,447 INFO L225 Difference]: With dead ends: 1347 [2021-12-07 00:01:11,447 INFO L226 Difference]: Without dead ends: 841 [2021-12-07 00:01:11,448 INFO L932 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-12-07 00:01:11,449 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 468 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 319 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2021-12-07 00:01:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 529. [2021-12-07 00:01:11,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5643939393939394) internal successors, (826), 528 states have internal predecessors, (826), 0 states have call successors, (0), 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-12-07 00:01:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 826 transitions. [2021-12-07 00:01:11,471 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 826 transitions. Word has length 36 [2021-12-07 00:01:11,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,471 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 826 transitions. [2021-12-07 00:01:11,472 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-12-07 00:01:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 826 transitions. [2021-12-07 00:01:11,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:11,472 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,472 INFO L514 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-12-07 00:01:11,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 00:01:11,472 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-12-07 00:01:11,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878214375] [2021-12-07 00:01:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878214375] [2021-12-07 00:01:11,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878214375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:11,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501548727] [2021-12-07 00:01:11,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:11,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:11,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:11,498 INFO L87 Difference]: Start difference. First operand 529 states and 826 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-12-07 00:01:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,571 INFO L93 Difference]: Finished difference Result 1276 states and 1990 transitions. [2021-12-07 00:01:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 00:01:11,572 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-12-07 00:01:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,576 INFO L225 Difference]: With dead ends: 1276 [2021-12-07 00:01:11,576 INFO L226 Difference]: Without dead ends: 764 [2021-12-07 00:01:11,577 INFO L932 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-12-07 00:01:11,578 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 480 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 349 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2021-12-07 00:01:11,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 577. [2021-12-07 00:01:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.5329861111111112) internal successors, (883), 576 states have internal predecessors, (883), 0 states have call successors, (0), 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-12-07 00:01:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 883 transitions. [2021-12-07 00:01:11,610 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 883 transitions. Word has length 36 [2021-12-07 00:01:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,611 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 883 transitions. [2021-12-07 00:01:11,611 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-12-07 00:01:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 883 transitions. [2021-12-07 00:01:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 00:01:11,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,612 INFO L514 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-12-07 00:01:11,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 00:01:11,612 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-12-07 00:01:11,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037947989] [2021-12-07 00:01:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037947989] [2021-12-07 00:01:11,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037947989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:11,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912227549] [2021-12-07 00:01:11,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:11,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:11,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:11,642 INFO L87 Difference]: Start difference. First operand 577 states and 883 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-12-07 00:01:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,688 INFO L93 Difference]: Finished difference Result 1372 states and 2104 transitions. [2021-12-07 00:01:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:11,688 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-12-07 00:01:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,692 INFO L225 Difference]: With dead ends: 1372 [2021-12-07 00:01:11,692 INFO L226 Difference]: Without dead ends: 809 [2021-12-07 00:01:11,693 INFO L932 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-12-07 00:01:11,693 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 312 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-07 00:01:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2021-12-07 00:01:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.5142857142857142) internal successors, (1219), 805 states have internal predecessors, (1219), 0 states have call successors, (0), 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-12-07 00:01:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1219 transitions. [2021-12-07 00:01:11,721 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1219 transitions. Word has length 36 [2021-12-07 00:01:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,721 INFO L470 AbstractCegarLoop]: Abstraction has 806 states and 1219 transitions. [2021-12-07 00:01:11,721 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-12-07 00:01:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1219 transitions. [2021-12-07 00:01:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-07 00:01:11,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,722 INFO L514 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-12-07 00:01:11,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 00:01:11,722 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1539863823, now seen corresponding path program 1 times [2021-12-07 00:01:11,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247100347] [2021-12-07 00:01:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:11,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247100347] [2021-12-07 00:01:11,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247100347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:11,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391726495] [2021-12-07 00:01:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:11,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:11,751 INFO L87 Difference]: Start difference. First operand 806 states and 1219 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-12-07 00:01:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,818 INFO L93 Difference]: Finished difference Result 1999 states and 3056 transitions. [2021-12-07 00:01:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:11,819 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-12-07 00:01:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,826 INFO L225 Difference]: With dead ends: 1999 [2021-12-07 00:01:11,826 INFO L226 Difference]: Without dead ends: 1220 [2021-12-07 00:01:11,827 INFO L932 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-12-07 00:01:11,828 INFO L933 BasicCegarLoop]: 247 mSDtfsCounter, 81 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 414 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2021-12-07 00:01:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2021-12-07 00:01:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.5209531635168447) internal successors, (1851), 1217 states have internal predecessors, (1851), 0 states have call successors, (0), 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-12-07 00:01:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1851 transitions. [2021-12-07 00:01:11,894 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1851 transitions. Word has length 47 [2021-12-07 00:01:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:11,895 INFO L470 AbstractCegarLoop]: Abstraction has 1218 states and 1851 transitions. [2021-12-07 00:01:11,895 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-12-07 00:01:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1851 transitions. [2021-12-07 00:01:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-07 00:01:11,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:11,896 INFO L514 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-12-07 00:01:11,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 00:01:11,897 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:11,897 INFO L85 PathProgramCache]: Analyzing trace with hash 642470545, now seen corresponding path program 1 times [2021-12-07 00:01:11,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:11,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594198491] [2021-12-07 00:01:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:11,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:01:11,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594198491] [2021-12-07 00:01:11,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594198491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:11,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:11,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:11,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386281647] [2021-12-07 00:01:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:11,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:11,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:11,919 INFO L87 Difference]: Start difference. First operand 1218 states and 1851 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-12-07 00:01:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:11,976 INFO L93 Difference]: Finished difference Result 2387 states and 3643 transitions. [2021-12-07 00:01:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:11,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-12-07 00:01:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:11,981 INFO L225 Difference]: With dead ends: 2387 [2021-12-07 00:01:11,981 INFO L226 Difference]: Without dead ends: 1196 [2021-12-07 00:01:11,983 INFO L932 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-12-07 00:01:11,983 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:11,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 182 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2021-12-07 00:01:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2021-12-07 00:01:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.5263598326359833) internal successors, (1824), 1195 states have internal predecessors, (1824), 0 states have call successors, (0), 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-12-07 00:01:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1824 transitions. [2021-12-07 00:01:12,027 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1824 transitions. Word has length 47 [2021-12-07 00:01:12,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:12,027 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1824 transitions. [2021-12-07 00:01:12,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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-12-07 00:01:12,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1824 transitions. [2021-12-07 00:01:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-07 00:01:12,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:12,028 INFO L514 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-12-07 00:01:12,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 00:01:12,028 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1991530956, now seen corresponding path program 1 times [2021-12-07 00:01:12,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:12,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729385700] [2021-12-07 00:01:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:12,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:12,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:12,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729385700] [2021-12-07 00:01:12,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729385700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:12,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:12,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:12,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141109697] [2021-12-07 00:01:12,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:12,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:12,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:12,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:12,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:12,055 INFO L87 Difference]: Start difference. First operand 1196 states and 1824 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-12-07 00:01:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:12,130 INFO L93 Difference]: Finished difference Result 3056 states and 4711 transitions. [2021-12-07 00:01:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:12,130 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-12-07 00:01:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:12,138 INFO L225 Difference]: With dead ends: 3056 [2021-12-07 00:01:12,138 INFO L226 Difference]: Without dead ends: 1887 [2021-12-07 00:01:12,140 INFO L932 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-12-07 00:01:12,140 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:12,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 322 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:12,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2021-12-07 00:01:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1885. [2021-12-07 00:01:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 1.5345010615711252) internal successors, (2891), 1884 states have internal predecessors, (2891), 0 states have call successors, (0), 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-12-07 00:01:12,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2891 transitions. [2021-12-07 00:01:12,211 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2891 transitions. Word has length 48 [2021-12-07 00:01:12,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:12,211 INFO L470 AbstractCegarLoop]: Abstraction has 1885 states and 2891 transitions. [2021-12-07 00:01:12,211 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-12-07 00:01:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2891 transitions. [2021-12-07 00:01:12,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-07 00:01:12,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:12,212 INFO L514 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-12-07 00:01:12,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 00:01:12,212 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash 253027899, now seen corresponding path program 1 times [2021-12-07 00:01:12,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:12,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472209195] [2021-12-07 00:01:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:12,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:12,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472209195] [2021-12-07 00:01:12,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472209195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:12,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:12,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:12,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466403307] [2021-12-07 00:01:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:12,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:12,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:12,250 INFO L87 Difference]: Start difference. First operand 1885 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-12-07 00:01:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:12,367 INFO L93 Difference]: Finished difference Result 5076 states and 7877 transitions. [2021-12-07 00:01:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:12,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-12-07 00:01:12,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:12,387 INFO L225 Difference]: With dead ends: 5076 [2021-12-07 00:01:12,388 INFO L226 Difference]: Without dead ends: 3220 [2021-12-07 00:01:12,391 INFO L932 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-12-07 00:01:12,392 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:12,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 385 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2021-12-07 00:01:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3218. [2021-12-07 00:01:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.5461610195834627) internal successors, (4974), 3217 states have internal predecessors, (4974), 0 states have call successors, (0), 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-12-07 00:01:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4974 transitions. [2021-12-07 00:01:12,550 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4974 transitions. Word has length 49 [2021-12-07 00:01:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:12,550 INFO L470 AbstractCegarLoop]: Abstraction has 3218 states and 4974 transitions. [2021-12-07 00:01:12,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-12-07 00:01:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4974 transitions. [2021-12-07 00:01:12,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-07 00:01:12,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:12,552 INFO L514 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-12-07 00:01:12,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 00:01:12,552 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash -644365379, now seen corresponding path program 1 times [2021-12-07 00:01:12,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:12,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88551300] [2021-12-07 00:01:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:12,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-07 00:01:12,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:12,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88551300] [2021-12-07 00:01:12,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88551300] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:12,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:12,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:12,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361570133] [2021-12-07 00:01:12,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:12,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:12,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:12,570 INFO L87 Difference]: Start difference. First operand 3218 states and 4974 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-07 00:01:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:12,680 INFO L93 Difference]: Finished difference Result 6385 states and 9889 transitions. [2021-12-07 00:01:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-07 00:01:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:12,694 INFO L225 Difference]: With dead ends: 6385 [2021-12-07 00:01:12,694 INFO L226 Difference]: Without dead ends: 3196 [2021-12-07 00:01:12,697 INFO L932 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-12-07 00:01:12,697 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:12,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2021-12-07 00:01:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3196. [2021-12-07 00:01:12,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3195 states have (on average 1.5486697965571206) internal successors, (4948), 3195 states have internal predecessors, (4948), 0 states have call successors, (0), 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-12-07 00:01:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4948 transitions. [2021-12-07 00:01:12,820 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4948 transitions. Word has length 49 [2021-12-07 00:01:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:12,820 INFO L470 AbstractCegarLoop]: Abstraction has 3196 states and 4948 transitions. [2021-12-07 00:01:12,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-07 00:01:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4948 transitions. [2021-12-07 00:01:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-07 00:01:12,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:12,822 INFO L514 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] [2021-12-07 00:01:12,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 00:01:12,822 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1777423200, now seen corresponding path program 1 times [2021-12-07 00:01:12,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:12,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315717016] [2021-12-07 00:01:12,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:12,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:12,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:12,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315717016] [2021-12-07 00:01:12,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315717016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:12,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:12,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:12,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574548174] [2021-12-07 00:01:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:12,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:12,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:12,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:12,850 INFO L87 Difference]: Start difference. First operand 3196 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-07 00:01:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:13,112 INFO L93 Difference]: Finished difference Result 8133 states and 12621 transitions. [2021-12-07 00:01:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2021-12-07 00:01:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:13,130 INFO L225 Difference]: With dead ends: 8133 [2021-12-07 00:01:13,130 INFO L226 Difference]: Without dead ends: 4173 [2021-12-07 00:01:13,135 INFO L932 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-12-07 00:01:13,135 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 401 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:13,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [401 Valid, 305 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2021-12-07 00:01:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2021-12-07 00:01:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4172 states have (on average 1.537392138063279) internal successors, (6414), 4172 states have internal predecessors, (6414), 0 states have call successors, (0), 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-12-07 00:01:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6414 transitions. [2021-12-07 00:01:13,369 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6414 transitions. Word has length 50 [2021-12-07 00:01:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:13,370 INFO L470 AbstractCegarLoop]: Abstraction has 4173 states and 6414 transitions. [2021-12-07 00:01:13,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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-12-07 00:01:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6414 transitions. [2021-12-07 00:01:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-07 00:01:13,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:13,373 INFO L514 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, 1, 1] [2021-12-07 00:01:13,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 00:01:13,373 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:13,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1800183507, now seen corresponding path program 1 times [2021-12-07 00:01:13,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504259222] [2021-12-07 00:01:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:13,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:13,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:13,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504259222] [2021-12-07 00:01:13,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504259222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:13,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:13,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 00:01:13,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364470958] [2021-12-07 00:01:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:13,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 00:01:13,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:13,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 00:01:13,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 00:01:13,408 INFO L87 Difference]: Start difference. First operand 4173 states and 6414 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-07 00:01:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:13,724 INFO L93 Difference]: Finished difference Result 10612 states and 16218 transitions. [2021-12-07 00:01:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 00:01:13,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-12-07 00:01:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:13,748 INFO L225 Difference]: With dead ends: 10612 [2021-12-07 00:01:13,748 INFO L226 Difference]: Without dead ends: 6462 [2021-12-07 00:01:13,753 INFO L932 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-12-07 00:01:13,754 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 684 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:13,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 514 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2021-12-07 00:01:14,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 4868. [2021-12-07 00:01:14,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5062666940620506) internal successors, (7331), 4867 states have internal predecessors, (7331), 0 states have call successors, (0), 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-12-07 00:01:14,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7331 transitions. [2021-12-07 00:01:14,016 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7331 transitions. Word has length 56 [2021-12-07 00:01:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:14,016 INFO L470 AbstractCegarLoop]: Abstraction has 4868 states and 7331 transitions. [2021-12-07 00:01:14,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-07 00:01:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7331 transitions. [2021-12-07 00:01:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-07 00:01:14,020 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:14,020 INFO L514 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, 1] [2021-12-07 00:01:14,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 00:01:14,020 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 138410889, now seen corresponding path program 1 times [2021-12-07 00:01:14,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:14,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751555449] [2021-12-07 00:01:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:14,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:14,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:14,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751555449] [2021-12-07 00:01:14,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751555449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:14,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:14,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:14,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734163073] [2021-12-07 00:01:14,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:14,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:14,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:14,048 INFO L87 Difference]: Start difference. First operand 4868 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-07 00:01:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:14,232 INFO L93 Difference]: Finished difference Result 10083 states and 15152 transitions. [2021-12-07 00:01:14,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:14,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2021-12-07 00:01:14,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:14,240 INFO L225 Difference]: With dead ends: 10083 [2021-12-07 00:01:14,240 INFO L226 Difference]: Without dead ends: 5244 [2021-12-07 00:01:14,244 INFO L932 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-12-07 00:01:14,244 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:14,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 311 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:14,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-12-07 00:01:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5212. [2021-12-07 00:01:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5211 states have (on average 1.459220878909998) internal successors, (7604), 5211 states have internal predecessors, (7604), 0 states have call successors, (0), 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-12-07 00:01:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7604 transitions. [2021-12-07 00:01:14,437 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7604 transitions. Word has length 90 [2021-12-07 00:01:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:14,437 INFO L470 AbstractCegarLoop]: Abstraction has 5212 states and 7604 transitions. [2021-12-07 00:01:14,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-12-07 00:01:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7604 transitions. [2021-12-07 00:01:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-07 00:01:14,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:14,440 INFO L514 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, 1, 1] [2021-12-07 00:01:14,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 00:01:14,441 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:14,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -56607288, now seen corresponding path program 1 times [2021-12-07 00:01:14,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:14,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485623648] [2021-12-07 00:01:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:14,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:14,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:14,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485623648] [2021-12-07 00:01:14,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485623648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:14,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:14,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:14,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446116865] [2021-12-07 00:01:14,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:14,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:14,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:14,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:14,464 INFO L87 Difference]: Start difference. First operand 5212 states and 7604 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-07 00:01:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:14,722 INFO L93 Difference]: Finished difference Result 10937 states and 15918 transitions. [2021-12-07 00:01:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-12-07 00:01:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:14,730 INFO L225 Difference]: With dead ends: 10937 [2021-12-07 00:01:14,730 INFO L226 Difference]: Without dead ends: 5766 [2021-12-07 00:01:14,735 INFO L932 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-12-07 00:01:14,735 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 127 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:14,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2021-12-07 00:01:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5718. [2021-12-07 00:01:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4131537519678152) internal successors, (8079), 5717 states have internal predecessors, (8079), 0 states have call successors, (0), 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-12-07 00:01:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8079 transitions. [2021-12-07 00:01:14,987 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8079 transitions. Word has length 91 [2021-12-07 00:01:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:14,988 INFO L470 AbstractCegarLoop]: Abstraction has 5718 states and 8079 transitions. [2021-12-07 00:01:14,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-12-07 00:01:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8079 transitions. [2021-12-07 00:01:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-07 00:01:14,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:14,992 INFO L514 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, 1, 1, 1] [2021-12-07 00:01:14,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 00:01:14,992 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1840400199, now seen corresponding path program 1 times [2021-12-07 00:01:14,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:14,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030691478] [2021-12-07 00:01:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:14,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 00:01:15,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:15,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030691478] [2021-12-07 00:01:15,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030691478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:15,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:15,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:15,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678363267] [2021-12-07 00:01:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:15,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:15,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:15,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:15,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:15,017 INFO L87 Difference]: Start difference. First operand 5718 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-07 00:01:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:15,272 INFO L93 Difference]: Finished difference Result 11756 states and 16622 transitions. [2021-12-07 00:01:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-12-07 00:01:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:15,281 INFO L225 Difference]: With dead ends: 11756 [2021-12-07 00:01:15,281 INFO L226 Difference]: Without dead ends: 6099 [2021-12-07 00:01:15,286 INFO L932 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-12-07 00:01:15,287 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 123 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:15,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 307 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:15,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6099 states. [2021-12-07 00:01:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5484. [2021-12-07 00:01:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.3549151924129126) internal successors, (7429), 5483 states have internal predecessors, (7429), 0 states have call successors, (0), 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-12-07 00:01:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7429 transitions. [2021-12-07 00:01:15,497 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7429 transitions. Word has length 92 [2021-12-07 00:01:15,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:15,497 INFO L470 AbstractCegarLoop]: Abstraction has 5484 states and 7429 transitions. [2021-12-07 00:01:15,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-07 00:01:15,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7429 transitions. [2021-12-07 00:01:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-07 00:01:15,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:15,500 INFO L514 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, 1, 1, 1, 1] [2021-12-07 00:01:15,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 00:01:15,500 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:15,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash -195529206, now seen corresponding path program 1 times [2021-12-07 00:01:15,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:15,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259440046] [2021-12-07 00:01:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:15,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-07 00:01:15,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:15,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259440046] [2021-12-07 00:01:15,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259440046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:15,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:15,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:15,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687388536] [2021-12-07 00:01:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:15,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:15,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:15,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:15,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:15,528 INFO L87 Difference]: Start difference. First operand 5484 states and 7429 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-07 00:01:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:15,834 INFO L93 Difference]: Finished difference Result 10260 states and 13825 transitions. [2021-12-07 00:01:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:15,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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 93 [2021-12-07 00:01:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:15,842 INFO L225 Difference]: With dead ends: 10260 [2021-12-07 00:01:15,842 INFO L226 Difference]: Without dead ends: 5263 [2021-12-07 00:01:15,846 INFO L932 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-12-07 00:01:15,847 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 441 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:15,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 390 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2021-12-07 00:01:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5149. [2021-12-07 00:01:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.3090520590520591) internal successors, (6739), 5148 states have internal predecessors, (6739), 0 states have call successors, (0), 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-12-07 00:01:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6739 transitions. [2021-12-07 00:01:16,050 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6739 transitions. Word has length 93 [2021-12-07 00:01:16,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:16,051 INFO L470 AbstractCegarLoop]: Abstraction has 5149 states and 6739 transitions. [2021-12-07 00:01:16,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-12-07 00:01:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6739 transitions. [2021-12-07 00:01:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-07 00:01:16,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:16,057 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:01:16,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 00:01:16,057 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:16,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1965826331, now seen corresponding path program 1 times [2021-12-07 00:01:16,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:16,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396511849] [2021-12-07 00:01:16,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:16,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 00:01:16,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:16,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396511849] [2021-12-07 00:01:16,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396511849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:16,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:16,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:16,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491488182] [2021-12-07 00:01:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:16,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:16,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:16,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:16,078 INFO L87 Difference]: Start difference. First operand 5149 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:01:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:16,270 INFO L93 Difference]: Finished difference Result 9832 states and 12854 transitions. [2021-12-07 00:01:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-12-07 00:01:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:16,274 INFO L225 Difference]: With dead ends: 9832 [2021-12-07 00:01:16,274 INFO L226 Difference]: Without dead ends: 5095 [2021-12-07 00:01:16,277 INFO L932 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-12-07 00:01:16,278 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 34 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:16,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:16,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2021-12-07 00:01:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2021-12-07 00:01:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5094 states have (on average 1.302120141342756) internal successors, (6633), 5094 states have internal predecessors, (6633), 0 states have call successors, (0), 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-12-07 00:01:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 6633 transitions. [2021-12-07 00:01:16,483 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 6633 transitions. Word has length 122 [2021-12-07 00:01:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:16,483 INFO L470 AbstractCegarLoop]: Abstraction has 5095 states and 6633 transitions. [2021-12-07 00:01:16,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:01:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 6633 transitions. [2021-12-07 00:01:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-07 00:01:16,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:16,491 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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-12-07 00:01:16,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 00:01:16,491 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:16,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1720762163, now seen corresponding path program 1 times [2021-12-07 00:01:16,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:16,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490780179] [2021-12-07 00:01:16,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:16,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 00:01:16,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490780179] [2021-12-07 00:01:16,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490780179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:16,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:16,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:16,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027388091] [2021-12-07 00:01:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:16,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:16,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:16,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:16,524 INFO L87 Difference]: Start difference. First operand 5095 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-12-07 00:01:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:16,804 INFO L93 Difference]: Finished difference Result 9065 states and 11821 transitions. [2021-12-07 00:01:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:16,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 135 [2021-12-07 00:01:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:16,809 INFO L225 Difference]: With dead ends: 9065 [2021-12-07 00:01:16,809 INFO L226 Difference]: Without dead ends: 5011 [2021-12-07 00:01:16,813 INFO L932 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-12-07 00:01:16,813 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 306 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:16,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 312 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2021-12-07 00:01:17,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 5009. [2021-12-07 00:01:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5009 states, 5008 states have (on average 1.279552715654952) internal successors, (6408), 5008 states have internal predecessors, (6408), 0 states have call successors, (0), 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-12-07 00:01:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6408 transitions. [2021-12-07 00:01:17,033 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6408 transitions. Word has length 135 [2021-12-07 00:01:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:17,034 INFO L470 AbstractCegarLoop]: Abstraction has 5009 states and 6408 transitions. [2021-12-07 00:01:17,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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-12-07 00:01:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6408 transitions. [2021-12-07 00:01:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-07 00:01:17,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:17,039 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:01:17,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 00:01:17,040 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1604483709, now seen corresponding path program 1 times [2021-12-07 00:01:17,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:17,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025178996] [2021-12-07 00:01:17,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:17,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 00:01:17,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:17,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025178996] [2021-12-07 00:01:17,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025178996] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:17,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:17,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:17,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364620746] [2021-12-07 00:01:17,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:17,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:17,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:17,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:17,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:17,064 INFO L87 Difference]: Start difference. First operand 5009 states and 6408 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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-12-07 00:01:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:17,282 INFO L93 Difference]: Finished difference Result 9599 states and 12268 transitions. [2021-12-07 00:01:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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 141 [2021-12-07 00:01:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:17,287 INFO L225 Difference]: With dead ends: 9599 [2021-12-07 00:01:17,287 INFO L226 Difference]: Without dead ends: 5009 [2021-12-07 00:01:17,291 INFO L932 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-12-07 00:01:17,291 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:17,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5009 states. [2021-12-07 00:01:17,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5009 to 4969. [2021-12-07 00:01:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4969 states, 4968 states have (on average 1.2733494363929148) internal successors, (6326), 4968 states have internal predecessors, (6326), 0 states have call successors, (0), 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-12-07 00:01:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4969 states to 4969 states and 6326 transitions. [2021-12-07 00:01:17,486 INFO L78 Accepts]: Start accepts. Automaton has 4969 states and 6326 transitions. Word has length 141 [2021-12-07 00:01:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:17,486 INFO L470 AbstractCegarLoop]: Abstraction has 4969 states and 6326 transitions. [2021-12-07 00:01:17,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 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-12-07 00:01:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4969 states and 6326 transitions. [2021-12-07 00:01:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-07 00:01:17,491 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:17,491 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:01:17,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 00:01:17,492 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash -371935883, now seen corresponding path program 1 times [2021-12-07 00:01:17,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:17,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233270967] [2021-12-07 00:01:17,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:17,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-07 00:01:17,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:17,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233270967] [2021-12-07 00:01:17,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233270967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:17,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:17,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:17,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28980215] [2021-12-07 00:01:17,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:17,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:17,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:17,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:17,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:17,516 INFO L87 Difference]: Start difference. First operand 4969 states and 6326 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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-12-07 00:01:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:17,709 INFO L93 Difference]: Finished difference Result 9547 states and 12146 transitions. [2021-12-07 00:01:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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 141 [2021-12-07 00:01:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:17,713 INFO L225 Difference]: With dead ends: 9547 [2021-12-07 00:01:17,713 INFO L226 Difference]: Without dead ends: 4978 [2021-12-07 00:01:17,717 INFO L932 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-12-07 00:01:17,717 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 21 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:17,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 299 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2021-12-07 00:01:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4938. [2021-12-07 00:01:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2667611910066843) internal successors, (6254), 4937 states have internal predecessors, (6254), 0 states have call successors, (0), 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-12-07 00:01:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6254 transitions. [2021-12-07 00:01:17,902 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6254 transitions. Word has length 141 [2021-12-07 00:01:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:17,902 INFO L470 AbstractCegarLoop]: Abstraction has 4938 states and 6254 transitions. [2021-12-07 00:01:17,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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-12-07 00:01:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6254 transitions. [2021-12-07 00:01:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-07 00:01:17,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:17,908 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:01:17,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-07 00:01:17,908 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1226586588, now seen corresponding path program 1 times [2021-12-07 00:01:17,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244028597] [2021-12-07 00:01:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:17,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:17,932 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-07 00:01:17,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244028597] [2021-12-07 00:01:17,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244028597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:17,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:17,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:17,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367590783] [2021-12-07 00:01:17,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:17,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:17,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:17,934 INFO L87 Difference]: Start difference. First operand 4938 states and 6254 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-07 00:01:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:18,090 INFO L93 Difference]: Finished difference Result 8060 states and 10251 transitions. [2021-12-07 00:01:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 145 [2021-12-07 00:01:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:18,093 INFO L225 Difference]: With dead ends: 8060 [2021-12-07 00:01:18,093 INFO L226 Difference]: Without dead ends: 3522 [2021-12-07 00:01:18,097 INFO L932 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-12-07 00:01:18,097 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 278 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:18,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 291 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2021-12-07 00:01:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3520. [2021-12-07 00:01:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3519 states have (on average 1.2358624609263995) internal successors, (4349), 3519 states have internal predecessors, (4349), 0 states have call successors, (0), 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-12-07 00:01:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4349 transitions. [2021-12-07 00:01:18,243 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4349 transitions. Word has length 145 [2021-12-07 00:01:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:18,243 INFO L470 AbstractCegarLoop]: Abstraction has 3520 states and 4349 transitions. [2021-12-07 00:01:18,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-07 00:01:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4349 transitions. [2021-12-07 00:01:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-07 00:01:18,246 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:18,246 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:01:18,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-07 00:01:18,246 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 546835114, now seen corresponding path program 1 times [2021-12-07 00:01:18,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:18,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141035845] [2021-12-07 00:01:18,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:18,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:18,268 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-07 00:01:18,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:18,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141035845] [2021-12-07 00:01:18,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141035845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:18,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:18,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:18,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651362857] [2021-12-07 00:01:18,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:18,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:18,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:18,270 INFO L87 Difference]: Start difference. First operand 3520 states and 4349 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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-12-07 00:01:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:18,380 INFO L93 Difference]: Finished difference Result 5695 states and 7039 transitions. [2021-12-07 00:01:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:18,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 145 [2021-12-07 00:01:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:18,383 INFO L225 Difference]: With dead ends: 5695 [2021-12-07 00:01:18,383 INFO L226 Difference]: Without dead ends: 2256 [2021-12-07 00:01:18,385 INFO L932 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-12-07 00:01:18,385 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 282 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:18,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 284 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2021-12-07 00:01:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2021-12-07 00:01:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.2041722148246783) internal successors, (2713), 2253 states have internal predecessors, (2713), 0 states have call successors, (0), 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-12-07 00:01:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2713 transitions. [2021-12-07 00:01:18,474 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2713 transitions. Word has length 145 [2021-12-07 00:01:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:18,474 INFO L470 AbstractCegarLoop]: Abstraction has 2254 states and 2713 transitions. [2021-12-07 00:01:18,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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-12-07 00:01:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2713 transitions. [2021-12-07 00:01:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-12-07 00:01:18,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:18,476 INFO L514 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] [2021-12-07 00:01:18,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-07 00:01:18,476 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1626731220, now seen corresponding path program 1 times [2021-12-07 00:01:18,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:18,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940557233] [2021-12-07 00:01:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:18,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-07 00:01:18,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:18,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940557233] [2021-12-07 00:01:18,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940557233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:18,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:18,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:18,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664749388] [2021-12-07 00:01:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:18,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:18,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:18,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:18,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:18,502 INFO L87 Difference]: Start difference. First operand 2254 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-12-07 00:01:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:18,588 INFO L93 Difference]: Finished difference Result 4070 states and 4934 transitions. [2021-12-07 00:01:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:18,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 184 [2021-12-07 00:01:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:18,590 INFO L225 Difference]: With dead ends: 4070 [2021-12-07 00:01:18,590 INFO L226 Difference]: Without dead ends: 2192 [2021-12-07 00:01:18,591 INFO L932 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-12-07 00:01:18,591 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:18,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2021-12-07 00:01:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2114. [2021-12-07 00:01:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.1902508282063418) internal successors, (2515), 2113 states have internal predecessors, (2515), 0 states have call successors, (0), 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-12-07 00:01:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2515 transitions. [2021-12-07 00:01:18,673 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2515 transitions. Word has length 184 [2021-12-07 00:01:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:18,673 INFO L470 AbstractCegarLoop]: Abstraction has 2114 states and 2515 transitions. [2021-12-07 00:01:18,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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-12-07 00:01:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2515 transitions. [2021-12-07 00:01:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-12-07 00:01:18,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:18,674 INFO L514 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, 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-12-07 00:01:18,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-07 00:01:18,674 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1822764650, now seen corresponding path program 1 times [2021-12-07 00:01:18,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:18,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902986980] [2021-12-07 00:01:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:18,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-07 00:01:18,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:18,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902986980] [2021-12-07 00:01:18,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902986980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:18,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:18,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:18,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260261470] [2021-12-07 00:01:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:18,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:18,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:18,699 INFO L87 Difference]: Start difference. First operand 2114 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-12-07 00:01:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:18,835 INFO L93 Difference]: Finished difference Result 4533 states and 5432 transitions. [2021-12-07 00:01:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-12-07 00:01:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:18,839 INFO L225 Difference]: With dead ends: 4533 [2021-12-07 00:01:18,839 INFO L226 Difference]: Without dead ends: 2789 [2021-12-07 00:01:18,840 INFO L932 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-12-07 00:01:18,840 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 132 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:18,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2021-12-07 00:01:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2408. [2021-12-07 00:01:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2407 states have (on average 1.1761528874117158) internal successors, (2831), 2407 states have internal predecessors, (2831), 0 states have call successors, (0), 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-12-07 00:01:18,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2831 transitions. [2021-12-07 00:01:18,973 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2831 transitions. Word has length 191 [2021-12-07 00:01:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:18,973 INFO L470 AbstractCegarLoop]: Abstraction has 2408 states and 2831 transitions. [2021-12-07 00:01:18,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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-12-07 00:01:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2831 transitions. [2021-12-07 00:01:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2021-12-07 00:01:18,975 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:18,975 INFO L514 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, 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-12-07 00:01:18,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-07 00:01:18,975 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:18,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 377236115, now seen corresponding path program 1 times [2021-12-07 00:01:18,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:18,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132634639] [2021-12-07 00:01:18,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:18,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 00:01:19,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132634639] [2021-12-07 00:01:19,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132634639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 00:01:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053888495] [2021-12-07 00:01:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:19,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:01:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:01:19,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 00:01:19,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 00:01:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:19,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-07 00:01:19,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 00:01:19,557 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 00:01:19,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 00:01:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-07 00:01:20,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053888495] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 00:01:20,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 00:01:20,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2021-12-07 00:01:20,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981269898] [2021-12-07 00:01:20,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 00:01:20,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-07 00:01:20,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:20,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-07 00:01:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-12-07 00:01:20,056 INFO L87 Difference]: Start difference. First operand 2408 states and 2831 transitions. Second operand has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 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-12-07 00:01:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:21,620 INFO L93 Difference]: Finished difference Result 9992 states and 11725 transitions. [2021-12-07 00:01:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-12-07 00:01:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 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 194 [2021-12-07 00:01:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:21,626 INFO L225 Difference]: With dead ends: 9992 [2021-12-07 00:01:21,626 INFO L226 Difference]: Without dead ends: 7941 [2021-12-07 00:01:21,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=745, Invalid=5735, Unknown=0, NotChecked=0, Total=6480 [2021-12-07 00:01:21,629 INFO L933 BasicCegarLoop]: 602 mSDtfsCounter, 3720 mSDsluCounter, 10174 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3720 SdHoareTripleChecker+Valid, 10776 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:21,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3720 Valid, 10776 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:01:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2021-12-07 00:01:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 3429. [2021-12-07 00:01:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3428 states have (on average 1.175029171528588) internal successors, (4028), 3428 states have internal predecessors, (4028), 0 states have call successors, (0), 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-12-07 00:01:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4028 transitions. [2021-12-07 00:01:21,804 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4028 transitions. Word has length 194 [2021-12-07 00:01:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:21,804 INFO L470 AbstractCegarLoop]: Abstraction has 3429 states and 4028 transitions. [2021-12-07 00:01:21,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 0 states have call successors, (0), 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-12-07 00:01:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4028 transitions. [2021-12-07 00:01:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2021-12-07 00:01:21,807 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:21,808 INFO L514 BasicCegarLoop]: trace histogram [9, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 00:01:21,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 00:01:22,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 00:01:22,009 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:22,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:22,010 INFO L85 PathProgramCache]: Analyzing trace with hash -714863608, now seen corresponding path program 1 times [2021-12-07 00:01:22,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:22,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062416885] [2021-12-07 00:01:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:22,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-12-07 00:01:22,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:22,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062416885] [2021-12-07 00:01:22,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062416885] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:22,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:22,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:22,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911363019] [2021-12-07 00:01:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:22,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:22,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:22,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:22,081 INFO L87 Difference]: Start difference. First operand 3429 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:01:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:22,189 INFO L93 Difference]: Finished difference Result 5329 states and 6235 transitions. [2021-12-07 00:01:22,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2021-12-07 00:01:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:22,191 INFO L225 Difference]: With dead ends: 5329 [2021-12-07 00:01:22,192 INFO L226 Difference]: Without dead ends: 2305 [2021-12-07 00:01:22,193 INFO L932 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-12-07 00:01:22,193 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:22,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2021-12-07 00:01:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2272. [2021-12-07 00:01:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.1501541171290182) internal successors, (2612), 2271 states have internal predecessors, (2612), 0 states have call successors, (0), 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-12-07 00:01:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2612 transitions. [2021-12-07 00:01:22,295 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2612 transitions. Word has length 263 [2021-12-07 00:01:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:22,296 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 2612 transitions. [2021-12-07 00:01:22,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 00:01:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2612 transitions. [2021-12-07 00:01:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-12-07 00:01:22,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:22,298 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-07 00:01:22,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-07 00:01:22,298 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:22,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1759293355, now seen corresponding path program 1 times [2021-12-07 00:01:22,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:22,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15543430] [2021-12-07 00:01:22,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:22,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-07 00:01:22,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:22,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15543430] [2021-12-07 00:01:22,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15543430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:22,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:22,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 00:01:22,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488347687] [2021-12-07 00:01:22,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:22,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 00:01:22,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:22,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 00:01:22,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 00:01:22,345 INFO L87 Difference]: Start difference. First operand 2272 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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-12-07 00:01:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:22,476 INFO L93 Difference]: Finished difference Result 4253 states and 4901 transitions. [2021-12-07 00:01:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 00:01:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 271 [2021-12-07 00:01:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:22,478 INFO L225 Difference]: With dead ends: 4253 [2021-12-07 00:01:22,478 INFO L226 Difference]: Without dead ends: 2273 [2021-12-07 00:01:22,479 INFO L932 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-12-07 00:01:22,480 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 191 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:22,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 225 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2021-12-07 00:01:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2272. [2021-12-07 00:01:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.141347424042272) internal successors, (2592), 2271 states have internal predecessors, (2592), 0 states have call successors, (0), 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-12-07 00:01:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2592 transitions. [2021-12-07 00:01:22,576 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2592 transitions. Word has length 271 [2021-12-07 00:01:22,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:22,576 INFO L470 AbstractCegarLoop]: Abstraction has 2272 states and 2592 transitions. [2021-12-07 00:01:22,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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-12-07 00:01:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2592 transitions. [2021-12-07 00:01:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2021-12-07 00:01:22,578 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:22,578 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-07 00:01:22,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-07 00:01:22,578 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 550996924, now seen corresponding path program 1 times [2021-12-07 00:01:22,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:22,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243388222] [2021-12-07 00:01:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:22,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-07 00:01:22,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:22,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243388222] [2021-12-07 00:01:22,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243388222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:22,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:22,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:22,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448451346] [2021-12-07 00:01:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:22,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:22,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:22,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:22,618 INFO L87 Difference]: Start difference. First operand 2272 states and 2592 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-12-07 00:01:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:22,675 INFO L93 Difference]: Finished difference Result 2676 states and 3041 transitions. [2021-12-07 00:01:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 273 [2021-12-07 00:01:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:22,677 INFO L225 Difference]: With dead ends: 2676 [2021-12-07 00:01:22,677 INFO L226 Difference]: Without dead ends: 809 [2021-12-07 00:01:22,678 INFO L932 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-12-07 00:01:22,678 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:22,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-07 00:01:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2021-12-07 00:01:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.103960396039604) internal successors, (892), 808 states have internal predecessors, (892), 0 states have call successors, (0), 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-12-07 00:01:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 892 transitions. [2021-12-07 00:01:22,717 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 892 transitions. Word has length 273 [2021-12-07 00:01:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:22,717 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 892 transitions. [2021-12-07 00:01:22,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-12-07 00:01:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 892 transitions. [2021-12-07 00:01:22,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2021-12-07 00:01:22,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:01:22,719 INFO L514 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 00:01:22,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-07 00:01:22,719 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:01:22,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:01:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 249689584, now seen corresponding path program 1 times [2021-12-07 00:01:22,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:01:22,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504384670] [2021-12-07 00:01:22,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:01:22,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:01:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:01:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2021-12-07 00:01:22,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:01:22,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504384670] [2021-12-07 00:01:22,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504384670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:01:22,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:01:22,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 00:01:22,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081267764] [2021-12-07 00:01:22,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:01:22,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 00:01:22,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:01:22,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 00:01:22,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 00:01:22,768 INFO L87 Difference]: Start difference. First operand 809 states and 892 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 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-12-07 00:01:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:01:22,813 INFO L93 Difference]: Finished difference Result 1090 states and 1202 transitions. [2021-12-07 00:01:22,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 00:01:22,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2021-12-07 00:01:22,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:01:22,814 INFO L225 Difference]: With dead ends: 1090 [2021-12-07 00:01:22,814 INFO L226 Difference]: Without dead ends: 0 [2021-12-07 00:01:22,815 INFO L932 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-12-07 00:01:22,815 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 00:01:22,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 00:01:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-07 00:01:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-07 00:01:22,816 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-12-07 00:01:22,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-07 00:01:22,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2021-12-07 00:01:22,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:01:22,816 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-07 00:01:22,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 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-12-07 00:01:22,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-07 00:01:22,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-07 00:01:22,819 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 00:01:22,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-07 00:01:22,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-07 00:01:51,069 WARN L227 SmtUtils]: Spent 22.97s on a formula simplification. DAG size of input: 225 DAG size of output: 225 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 00:02:10,875 WARN L227 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 404 DAG size of output: 404 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L597(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L564(lines 564 568) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L564-2(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L366(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 238) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 110) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 77) no Hoare annotation was computed. [2021-12-07 00:02:24,943 INFO L858 garLoopResultBuilder]: For program point L598(lines 598 602) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L854 garLoopResultBuilder]: At program point L235(lines 230 257) 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 (= ~data~0 (+ ~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 .cse19 .cse20 .cse21 .cse11 .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 .cse23 .cse24 .cse12)))) [2021-12-07 00:02:24,944 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 107) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L854 garLoopResultBuilder]: At program point L70(lines 65 135) the Hoare annotation is: (and (let ((.cse21 (+ ~t_b~0 1)) (.cse4 (+ ~t_b~0 2))) (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (or (= .cse21 ~d~0) (= .cse4 ~d~0))) (.cse3 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (not (= ~r_i~0 1))) (.cse8 (or (= .cse4 ~c~0) (= .cse21 ~c~0))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~c1_pc~0 1)) (.cse15 (not (= ~wb_st~0 0))) (.cse16 (not (= ~r_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse18 (or (= ~c_t~0 .cse21) (= .cse4 ~c_t~0))) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 ~data~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~data~0 .cse21) .cse20)))) (= ~e_f~0 2) (= 2 ~wl_pc~0)) [2021-12-07 00:02:24,944 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L858 garLoopResultBuilder]: For program point L534-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L858 garLoopResultBuilder]: For program point L336(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L858 garLoopResultBuilder]: For program point L303(lines 303 319) no Hoare annotation was computed. [2021-12-07 00:02:24,944 INFO L854 garLoopResultBuilder]: At program point L204-1(lines 185 225) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse33 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0)) (.cse20 (= 0 ~wl_pc~0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse26 (= .cse38 ~data~0)) (.cse1 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse35 (not (= 2 ~wl_pc~0))) (.cse36 (not .cse20)) (.cse32 (= ~wb_pc~0 0)) (.cse17 (= ~processed~0 0)) (.cse23 (= ~r_st~0 ~e_f~0)) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse24 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse25 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse27 (not (= ~e_c~0 0))) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse28 (= ~c1_pc~0 1)) (.cse16 (not .cse33)) (.cse29 (not (= ~r_st~0 0))) (.cse30 (= ~c2_pc~0 1)) (.cse31 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse18 (not (= ~e_wl~0 0))) (.cse34 (= ~data~0 .cse37)) (.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 .cse24 .cse0 .cse25 .cse2 .cse3 .cse26 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse31 .cse18 .cse22) (and .cse0 .cse25 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse18 .cse20 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse2 .cse3 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse17 .cse18 .cse34 .cse19 .cse33 .cse22) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse26 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse29 .cse30 .cse17 .cse18 .cse33 .cse22) (and .cse24 .cse0 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse18 .cse20 .cse22) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse33 .cse21 .cse22 .cse23) (and .cse0 .cse25 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse3 .cse5 .cse7 .cse27 .cse35 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse28 .cse30 .cse18 .cse22) (and .cse24 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse35 .cse36 .cse9 .cse10 .cse32 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse33 .cse21 .cse22 .cse23) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse18 .cse21 .cse22) (and .cse24 .cse0 .cse25 .cse2 .cse3 .cse5 .cse7 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse29 .cse30 .cse31 .cse18 .cse34 .cse22)))) [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 76) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L667(lines 667 683) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L634-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L370(lines 370 377) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L854 garLoopResultBuilder]: At program point L272(lines 265 282) the Hoare annotation is: (let ((.cse24 (+ ~t_b~0 1)) (.cse6 (+ ~t_b~0 2))) (let ((.cse2 (not (= ~c1_st~0 0))) (.cse3 (or (= .cse24 ~d~0) (= .cse6 ~d~0))) (.cse4 (not (= ~c2_st~0 0))) (.cse11 (or (= .cse6 ~c~0) (= .cse24 ~c~0))) (.cse14 (= ~e_c~0 2)) (.cse18 (not (= ~wb_st~0 0))) (.cse21 (or (= ~c_t~0 .cse24) (= .cse6 ~c_t~0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse9 (not (= ~e_c~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse22 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 ~data~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~data~0 .cse24) .cse23) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse15 .cse16 .cse22 (= 0 ~wl_pc~0) .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse8 .cse9 (not (= 2 ~wl_pc~0)) .cse10 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse20 .cse22 .cse23)))) [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L306(lines 306 318) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L273(lines 265 282) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L207-1(lines 207 215) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L670(lines 670 682) no Hoare annotation was computed. [2021-12-07 00:02:24,945 INFO L858 garLoopResultBuilder]: For program point L505(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L439-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L340(lines 340 347) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L274(lines 274 278) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L506(lines 506 510) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L854 garLoopResultBuilder]: At program point L242-1(lines 230 257) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 2))) (let ((.cse34 (= ~c2_st~0 0)) (.cse33 (= 0 ~wl_pc~0)) (.cse39 (+ ~t_b~0 1)) (.cse38 (= .cse37 ~c_t~0)) (.cse21 (= ~c1_st~0 0))) (let ((.cse35 (= ~c2_pc~0 0)) (.cse23 (not .cse21)) (.cse3 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_c~0 0))) (.cse14 (= ~c1_pc~0 1)) (.cse16 (not (= ~r_st~0 0))) (.cse18 (or (= ~c_t~0 .cse39) .cse38)) (.cse20 (= ~data~0 .cse39)) (.cse0 (not (= 0 ~wl_st~0))) (.cse27 (not (= 2 ~wl_pc~0))) (.cse28 (not .cse33)) (.cse1 (not (= ~e_g~0 0))) (.cse24 (= ~d~0 0)) (.cse2 (not .cse34)) (.cse36 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse25 (= ~t_b~0 0)) (.cse5 (not (= ~e_e~0 0))) (.cse26 (= ~data~0 0)) (.cse7 (not (= ~r_i~0 1))) (.cse8 (not (= ~e_e~0 1))) (.cse29 (= ~wb_pc~0 0)) (.cse9 (not (= ~e_wl~0 1))) (.cse10 (= ~c1_i~0 1)) (.cse11 (= ~e_c~0 2)) (.cse12 (= ~c2_i~0 1)) (.cse13 (= ~e_f~0 2)) (.cse15 (not (= ~wb_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse30 (= ~processed~0 0)) (.cse19 (not (= ~e_wl~0 0))) (.cse31 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1)) (.cse32 (= ~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) (and .cse0 .cse1 .cse23 .cse24 .cse2 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse30 .cse31 .cse22 .cse32) (and .cse1 .cse23 .cse24 .cse2 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse30 .cse19 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse19 .cse33 .cse22) (and .cse0 .cse1 .cse24 .cse34 .cse35 .cse36 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse21 .cse31 .cse22 .cse32) (and .cse1 .cse23 .cse24 .cse34 .cse35 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse19 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse24 .cse34 .cse35 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse2 .cse3 (= .cse37 ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse38 .cse19 .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse27 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse17 .cse19 .cse22) (and .cse1 .cse24 .cse34 .cse35 .cse36 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse30 .cse19 .cse21 .cse33 .cse31 .cse22 .cse32) (and .cse0 .cse1 .cse23 .cse3 .cse34 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and .cse0 .cse1 .cse24 .cse2 .cse36 .cse4 .cse25 .cse5 .cse26 .cse27 .cse28 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse30 .cse21 .cse31 .cse22 .cse32) (and .cse1 .cse24 .cse2 .cse36 .cse4 .cse25 .cse5 .cse26 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse17 .cse30 .cse19 .cse21 .cse33 .cse31 .cse22 .cse32))))) [2021-12-07 00:02:24,946 INFO L854 garLoopResultBuilder]: At program point L176(lines 137 181) the Hoare annotation is: (let ((.cse27 (= 0 ~wl_pc~0)) (.cse37 (+ ~t_b~0 1)) (.cse34 (= ~wb_st~0 0)) (.cse30 (= ~c2_st~0 0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse5 (= .cse38 ~data~0)) (.cse3 (not .cse30)) (.cse4 (= ~wb_pc~0 1)) (.cse8 (not (= ~e_c~0 0))) (.cse17 (not .cse34)) (.cse18 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse20 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse21 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse23 (= ~d~0 0)) (.cse31 (= ~c2_pc~0 0)) (.cse6 (not (= ~e_g~0 1))) (.cse24 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse25 (= ~data~0 0)) (.cse32 (not (= 2 ~wl_pc~0))) (.cse33 (not .cse27)) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse35 (= ~wb_pc~0 0)) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse16 (= ~c1_pc~0 1)) (.cse26 (= ~processed~0 0)) (.cse28 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~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 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse23 .cse3 .cse4 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse26 .cse21 .cse27 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse4 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse26 .cse21 .cse34 .cse22) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse21 .cse27 .cse22) (and .cse1 .cse2 .cse23 .cse4 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26 .cse21 .cse27 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse34 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse23 .cse3 .cse4 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse26 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse4 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse26 .cse21 .cse36 .cse34 .cse22) (and .cse1 .cse2 .cse23 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse21 .cse27 .cse34 .cse28 .cse22 .cse29) (and .cse1 .cse2 .cse23 .cse3 .cse6 .cse24 .cse7 .cse25 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse26 .cse21 .cse27 .cse34 .cse28 .cse22 .cse29) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse32 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse28 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse36 .cse22) (and .cse0 .cse1 .cse2 .cse23 .cse30 .cse31 .cse6 .cse24 .cse7 .cse25 .cse32 .cse33 .cse9 .cse10 .cse35 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse26 .cse34 .cse28 .cse22 .cse29)))) [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L639-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L408(lines 408 418) no Hoare annotation was computed. [2021-12-07 00:02:24,946 INFO L858 garLoopResultBuilder]: For program point L408-2(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 317) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L607(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L574-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L409(lines 409 414) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L409-2(lines 409 414) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L854 garLoopResultBuilder]: At program point L145(lines 140 180) the Hoare annotation is: (let ((.cse25 (+ ~t_b~0 1)) (.cse21 (= ~wb_st~0 0)) (.cse23 (= ~c2_st~0 0))) (let ((.cse18 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse3 (not .cse23)) (.cse4 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (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)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse24 (not .cse21)) (.cse16 (not (= ~r_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~data~0 .cse25)) (.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) (and .cse0 .cse1 .cse2 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse24 .cse16 .cse17 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse22) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16 .cse17 (or (= ~c_t~0 .cse25) (= (+ ~t_b~0 2) ~c_t~0)) .cse19 .cse20 .cse22)))) [2021-12-07 00:02:24,947 INFO L854 garLoopResultBuilder]: At program point L79(lines 65 135) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse20 (= ~c1_st~0 0))) (let ((.cse27 (not .cse20)) (.cse3 (not .cse25)) (.cse12 (= ~wb_pc~0 0)) (.cse29 (= ~c1_pc~0 1)) (.cse18 (= ~c2_pc~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse28 (= ~wb_pc~0 1)) (.cse26 (= ~c2_pc~0 0)) (.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)) (.cse9 (not (= 2 ~wl_pc~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)) (.cse19 (= ~processed~0 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 .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 .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 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (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 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24)))) [2021-12-07 00:02:24,947 INFO L858 garLoopResultBuilder]: For program point L608(lines 608 612) no Hoare annotation was computed. [2021-12-07 00:02:24,947 INFO L854 garLoopResultBuilder]: At program point L476(lines 469 486) 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-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L477(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L444-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L312(lines 312 316) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L312-1(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L676(lines 676 680) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L676-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L478(lines 478 482) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L644-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L579-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,948 INFO L854 garLoopResultBuilder]: At program point L381(lines 298 396) the Hoare annotation is: (let ((.cse33 (= 0 ~wl_pc~0)) (.cse43 (= 2 ~wl_pc~0)) (.cse21 (= ~c1_st~0 0)) (.cse22 (= ~wb_st~0 0)) (.cse31 (= ~c2_st~0 0)) (.cse41 (+ ~t_b~0 1)) (.cse42 (+ ~t_b~0 2))) (let ((.cse34 (= .cse42 ~data~0)) (.cse39 (or (= .cse42 ~c~0) (= .cse41 ~c~0))) (.cse35 (not (= ~e_c~0 0))) (.cse37 (or (= ~c_t~0 .cse41) (= .cse42 ~c_t~0))) (.cse38 (= ~data~0 .cse41)) (.cse36 (not (= ~r_st~0 0))) (.cse3 (not .cse31)) (.cse27 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse29 (not .cse22)) (.cse19 (= ~c2_pc~0 1)) (.cse30 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse26 (not .cse21)) (.cse2 (= ~d~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse9 (not .cse43)) (.cse10 (not .cse33)) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (= ~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)) (.cse28 (= ~c1_pc~0 1)) (.cse20 (= ~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 .cse1 .cse26 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse30 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse27 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21 .cse33 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse37 .cse30 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse36 .cse19 .cse20 .cse30 .cse38 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse39 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse37 .cse30 .cse24) (and .cse0 .cse1 .cse26 .cse2 .cse27 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse36 .cse19 .cse20 .cse30 .cse22 .cse24) (and (let ((.cse40 (or (= .cse41 ~d~0) (= .cse42 ~d~0)))) (or (and .cse1 .cse26 .cse40 .cse3 .cse27 .cse34 .cse5 .cse7 .cse35 .cse11 .cse39 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse37 .cse30 .cse24) (and .cse1 .cse26 .cse40 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse39 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse37 .cse30 .cse38 .cse24))) .cse43) (and .cse0 .cse1 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse30 .cse33 .cse24) (and .cse1 .cse26 .cse2 .cse27 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse20 .cse30 .cse33 .cse23 .cse24 .cse25) (and .cse1 .cse2 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse3 .cse27 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse27 .cse31 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse36 .cse19 .cse20 .cse30 .cse38 .cse22 .cse24) (and .cse1 .cse26 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse30 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20 .cse30 .cse33 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse37 .cse30 .cse38 .cse24) (and .cse0 .cse1 .cse27 .cse5 .cse7 .cse35 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse28 .cse19 .cse30 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse5 .cse7 .cse35 .cse11 .cse39 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse19 .cse37 .cse30 .cse38 .cse24) (and .cse0 .cse1 .cse2 .cse27 .cse31 .cse32 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse27 .cse31 .cse5 .cse7 .cse35 .cse11 .cse12 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse14 .cse15 .cse16 .cse17 (= ~data~0 ~t_b~0) .cse18 .cse28 .cse29 .cse36 .cse19 .cse20 .cse30 .cse21 .cse24) (and .cse0 .cse1 .cse26 .cse27 .cse5 .cse7 .cse35 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse37 .cse30 .cse38 .cse24) (and .cse0 .cse1 .cse26 .cse3 .cse27 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse29 .cse36 .cse19 .cse30 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20 .cse30 .cse21 .cse33 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse2 .cse31 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse20 .cse22 .cse23 .cse24 .cse25)))) [2021-12-07 00:02:24,948 INFO L858 garLoopResultBuilder]: For program point L514-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 129) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L351(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L186(lines 186 194) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L153(line 153) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L616(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L649-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2021-12-07 00:02:24,949 INFO L854 garLoopResultBuilder]: At program point L286(lines 259 288) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse25 (+ ~t_b~0 2))) (let ((.cse5 (= .cse25 ~data~0)) (.cse1 (not (= ~c1_st~0 0))) (.cse3 (not (= ~c2_st~0 0))) (.cse14 (= ~e_c~0 2)) (.cse18 (not (= ~wb_st~0 0))) (.cse20 (or (= ~c_t~0 .cse26) (= .cse25 ~c_t~0))) (.cse24 (= ~data~0 .cse26)) (.cse28 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (not (= ~e_c~0 0))) (.cse27 (= 2 ~wl_pc~0)) (.cse9 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse19 (= ~c2_pc~0 1)) (.cse21 (not (= ~e_wl~0 0))) (.cse22 (= ~wb_i~0 1)) (.cse23 (= ~r_st~0 ~e_f~0))) (or (and (let ((.cse2 (or (= .cse26 ~d~0) (= .cse25 ~d~0))) (.cse10 (or (= .cse25 ~c~0) (= .cse26 ~c~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22 .cse23))) .cse27) (and .cse28 .cse0 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse21 (= 0 ~wl_pc~0) .cse22) (and .cse28 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse28 .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse24 .cse22 .cse23) (and .cse28 .cse0 .cse4 .cse6 .cse7 .cse8 (not .cse27) .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse23)))) [2021-12-07 00:02:24,949 INFO L854 garLoopResultBuilder]: At program point L253(lines 227 258) the Hoare annotation is: (let ((.cse36 (+ ~t_b~0 2))) (let ((.cse38 (+ ~t_b~0 1)) (.cse37 (= .cse36 ~c_t~0)) (.cse20 (= ~c1_st~0 0)) (.cse3 (= ~c2_st~0 0)) (.cse21 (= 0 ~wl_pc~0))) (let ((.cse4 (= ~c2_pc~0 0)) (.cse27 (not (= 2 ~wl_pc~0))) (.cse28 (not .cse21)) (.cse1 (= ~d~0 0)) (.cse26 (not .cse3)) (.cse5 (= ~c1_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse18 (= ~processed~0 0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse25 (not (= 0 ~wl_st~0))) (.cse0 (not (= ~e_g~0 0))) (.cse30 (not .cse20)) (.cse2 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse32 (not (= ~e_c~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)) (.cse31 (= ~c1_pc~0 1)) (.cse17 (not (= ~wb_st~0 0))) (.cse33 (not (= ~r_st~0 0))) (.cse29 (= ~c2_pc~0 1)) (.cse34 (or (= ~c_t~0 .cse38) .cse37)) (.cse19 (not (= ~e_wl~0 0))) (.cse35 (= ~data~0 .cse38)) (.cse23 (= ~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 .cse24) (and .cse25 .cse0 .cse1 .cse26 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse30 .cse1 .cse26 .cse2 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse26 .cse2 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse34 .cse19 .cse35 .cse20 .cse23) (and .cse25 .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse19 .cse21 .cse23) (and .cse0 .cse30 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse1 .cse26 .cse2 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse29 .cse18 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse26 .cse2 (= .cse36 ~data~0) .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse37 .cse19 .cse23) (and .cse25 .cse0 .cse2 .cse6 .cse8 .cse32 .cse27 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse31 .cse29 .cse19 .cse23) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse27 .cse28 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse26 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse25 .cse0 .cse30 .cse2 .cse3 .cse6 .cse8 .cse32 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31 .cse17 .cse33 .cse29 .cse34 .cse19 .cse35 .cse23))))) [2021-12-07 00:02:24,949 INFO L858 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L617(lines 617 621) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L584-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L854 garLoopResultBuilder]: At program point L221(lines 182 226) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse22 (= ~wb_st~0 0)) (.cse21 (= ~c1_st~0 0)) (.cse27 (= 0 ~wl_pc~0)) (.cse38 (+ ~t_b~0 2))) (let ((.cse30 (= .cse38 ~data~0)) (.cse10 (not .cse27)) (.cse13 (= ~wb_pc~0 0)) (.cse9 (not (= 2 ~wl_pc~0))) (.cse2 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse20 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse25 (= ~r_st~0 ~e_f~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse28 (not .cse21)) (.cse3 (not (= ~c2_st~0 0))) (.cse29 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse31 (not (= ~e_c~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.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)) (.cse32 (= ~c1_pc~0 1)) (.cse33 (not .cse22)) (.cse34 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse35 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse26 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse24 (= ~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 .cse24 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse30 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse35 .cse26 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse1 .cse28 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse19 .cse20 .cse26 .cse27 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse29 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse34 .cse19 .cse20 .cse26 .cse36 .cse21 .cse22 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse30 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse34 .cse19 .cse20 .cse26 .cse22 .cse24) (and .cse0 .cse1 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse26 .cse27 .cse24) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse29 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse19 .cse20 .cse26 .cse27 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse29 .cse5 .cse7 .cse31 .cse9 .cse11 .cse12 .cse14 .cse15 .cse17 .cse18 .cse32 .cse19 .cse26 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse26 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse33 .cse19 .cse20 .cse26 .cse21 .cse27 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse3 .cse29 .cse5 .cse7 .cse31 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse32 .cse33 .cse34 .cse19 .cse35 .cse26 .cse36 .cse24)))) [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 128) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L854 garLoopResultBuilder]: At program point L122-2(lines 65 135) 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) (not (= 0 ~wl_pc~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-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L854 garLoopResultBuilder]: At program point L717(lines 692 719) the Hoare annotation is: (= ~c2_i~0 1) [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L552(lines 552 562) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L519-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L552-2(lines 552 562) no Hoare annotation was computed. [2021-12-07 00:02:24,950 INFO L858 garLoopResultBuilder]: For program point L321(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L189(lines 189 193) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L854 garLoopResultBuilder]: At program point L24(lines 19 26) the Hoare annotation is: false [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L553(lines 553 558) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L487(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L553-2(lines 553 558) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L454-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 362) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L854 garLoopResultBuilder]: At program point L190(lines 185 225) the Hoare annotation is: (let ((.cse25 (+ ~t_b~0 1)) (.cse21 (= ~wb_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse18 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not .cse24)) (.cse3 (not (= ~c2_st~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (not (= ~e_e~0 0))) (.cse7 (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)) (.cse12 (= ~e_c~0 2)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse23 (not .cse21)) (.cse16 (not (= ~r_st~0 0))) (.cse17 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~data~0 .cse25)) (.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) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse22) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse23 .cse16 .cse17 .cse18 .cse19 .cse24 .cse22) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse17 .cse19 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 (or (= ~c_t~0 .cse25) (= (+ ~t_b~0 2) ~c_t~0)) .cse19 .cse20 .cse22)))) [2021-12-07 00:02:24,951 INFO L854 garLoopResultBuilder]: At program point L686(lines 403 691) the Hoare annotation is: (= ~c2_i~0 1) [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L488(lines 488 492) no Hoare annotation was computed. [2021-12-07 00:02:24,951 INFO L858 garLoopResultBuilder]: For program point L654-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L854 garLoopResultBuilder]: At program point L159-1(lines 140 180) the Hoare annotation is: (let ((.cse37 (+ ~t_b~0 1)) (.cse30 (= ~wb_st~0 0)) (.cse5 (= ~c2_st~0 0)) (.cse38 (+ ~t_b~0 2)) (.cse28 (= 0 ~wl_pc~0))) (let ((.cse12 (not .cse28)) (.cse31 (= .cse38 ~data~0)) (.cse11 (not (= 2 ~wl_pc~0))) (.cse3 (= ~d~0 0)) (.cse6 (= ~c2_pc~0 0)) (.cse8 (= ~t_b~0 0)) (.cse10 (= ~data~0 0)) (.cse29 (= ~wb_pc~0 0)) (.cse21 (= ~processed~0 0)) (.cse24 (= ~r_st~0 ~e_f~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse25 (not .cse5)) (.cse4 (= ~wb_pc~0 1)) (.cse7 (not (= ~e_g~0 1))) (.cse9 (not (= ~e_e~0 0))) (.cse32 (not (= ~e_c~0 0))) (.cse13 (not (= ~r_i~0 1))) (.cse14 (not (= ~e_e~0 1))) (.cse15 (not (= ~e_wl~0 1))) (.cse16 (= ~c1_i~0 1)) (.cse17 (= ~e_c~0 2)) (.cse18 (= ~c2_i~0 1)) (.cse19 (= ~e_f~0 2)) (.cse33 (= ~c1_pc~0 1)) (.cse20 (not .cse30)) (.cse34 (not (= ~r_st~0 0))) (.cse26 (= ~c2_pc~0 1)) (.cse35 (or (= ~c_t~0 .cse37) (= .cse38 ~c_t~0))) (.cse27 (not (= ~e_wl~0 0))) (.cse36 (= ~data~0 .cse37)) (.cse23 (= ~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 .cse24) (and .cse1 .cse2 .cse3 .cse25 .cse4 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse27 .cse28 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse21 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse31 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse35 .cse27 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse25 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse26 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse31 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse34 .cse26 .cse21 .cse27 .cse30 .cse23) (and .cse0 .cse1 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse27 .cse28 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27 .cse28 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse25 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse21 .cse27 .cse28 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse34 .cse26 .cse21 .cse27 .cse36 .cse30 .cse23) (and .cse0 .cse1 .cse4 .cse7 .cse9 .cse32 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse33 .cse26 .cse27 .cse23) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse13 .cse14 .cse29 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse27 .cse28 .cse30 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse27 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse25 .cse4 .cse7 .cse9 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse33 .cse20 .cse34 .cse26 .cse35 .cse27 .cse36 .cse23)))) [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 101) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L93-1(lines 87 130) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L424-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L325(lines 325 332) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 98) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L459-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 170) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L162-1(lines 162 170) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L625(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L626(lines 626 630) no Hoare annotation was computed. [2021-12-07 00:02:24,952 INFO L858 garLoopResultBuilder]: For program point L659-1(lines 545 685) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L854 garLoopResultBuilder]: At program point L131(lines 62 136) the Hoare annotation is: (let ((.cse34 (= 2 ~wl_pc~0)) (.cse21 (= ~c1_st~0 0)) (.cse22 (= ~wb_st~0 0)) (.cse29 (= ~c2_st~0 0))) (let ((.cse4 (= ~c1_pc~0 0)) (.cse3 (not .cse29)) (.cse26 (= ~wb_pc~0 1)) (.cse27 (not .cse22)) (.cse32 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse33 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse28 (not .cse21)) (.cse2 (= ~d~0 0)) (.cse30 (= ~c2_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse9 (not .cse34)) (.cse10 (not (= 0 ~wl_pc~0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (= ~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)) (.cse31 (= ~c1_pc~0 1)) (.cse20 (= ~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 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse19 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse26 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse28 .cse2 .cse3 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse19 .cse20 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse29 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse26 .cse29 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse27 .cse20 .cse21 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse26 .cse29 .cse5 .cse7 .cse11 .cse12 (= ~data~0 |ULTIMATE.start_write_loop_~t~0#1|) .cse14 .cse15 .cse16 .cse17 (= ~data~0 ~t_b~0) .cse18 .cse31 .cse27 .cse32 .cse19 .cse20 .cse33 .cse21 .cse34 .cse24) (and .cse0 .cse1 .cse28 .cse3 .cse26 .cse5 .cse7 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse27 .cse32 .cse19 .cse33 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse2 .cse29 .cse30 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse31 .cse20 .cse22 .cse23 .cse24 .cse25)))) [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L429-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L231(lines 231 239) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L198(line 198) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 78) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L496(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L529-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L854 garLoopResultBuilder]: At program point L397(lines 289 402) the Hoare annotation is: (let ((.cse26 (+ ~t_b~0 1)) (.cse5 (+ ~t_b~0 2))) (let ((.cse23 (not (= 2 ~wl_pc~0))) (.cse24 (= 0 ~wl_pc~0)) (.cse25 (= ~c_req_up~0 ~r_i~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse3 (not (= ~c2_st~0 0))) (.cse4 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse8 (not (= ~e_c~0 0))) (.cse9 (not (= ~r_i~0 1))) (.cse10 (not (= ~e_e~0 1))) (.cse11 (not (= ~e_wl~0 1))) (.cse12 (= ~c1_i~0 1)) (.cse13 (= ~e_c~0 2)) (.cse14 (= ~c2_i~0 1)) (.cse15 (= ~e_f~0 2)) (.cse16 (= ~c1_pc~0 1)) (.cse17 (not (= ~wb_st~0 0))) (.cse18 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse20 (or (= ~c_t~0 .cse26) (= .cse5 ~c_t~0))) (.cse21 (not (= ~e_wl~0 0))) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= .cse5 ~data~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse23 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse21 .cse24 .cse22) (and .cse0 .cse1 .cse2 (= ~d~0 0) .cse3 .cse4 .cse6 (= ~t_b~0 0) .cse7 (= ~data~0 0) .cse23 (not .cse24) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (= ~processed~0 0) .cse25 .cse22 (= ~r_st~0 ~e_f~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse25 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~data~0 .cse26) .cse22)))) [2021-12-07 00:02:24,953 INFO L858 garLoopResultBuilder]: For program point L265(lines 265 282) no Hoare annotation was computed. [2021-12-07 00:02:24,953 INFO L854 garLoopResultBuilder]: At program point L596(lines 589 606) the Hoare annotation is: (let ((.cse18 (+ ~t_b~0 2)) (.cse23 (+ ~t_b~0 1))) (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse16 (not (= ~c1_st~0 0))) (.cse17 (not (= ~c2_st~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~e_c~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse19 (or (= .cse18 ~c~0) (= .cse23 ~c~0))) (.cse7 (not (= ~e_e~0 1))) (.cse20 (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)) (.cse21 (not (= ~wb_st~0 0))) (.cse12 (not (= ~r_st~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse22 (or (= ~c_t~0 .cse23) (= .cse18 ~c_t~0))) (.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 .cse16 .cse17 .cse2 (= .cse18 ~data~0) .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse14 (= 0 ~wl_pc~0) .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 (= ~e_c~0 2) .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 .cse13 .cse22 .cse14 (= ~data~0 .cse23) .cse15)))) [2021-12-07 00:02:24,954 INFO L858 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2021-12-07 00:02:24,954 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 406 690) no Hoare annotation was computed. [2021-12-07 00:02:24,954 INFO L858 garLoopResultBuilder]: For program point L299(lines 298 396) no Hoare annotation was computed. [2021-12-07 00:02:24,954 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-12-07 00:02:24,956 INFO L732 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] [2021-12-07 00:02:24,957 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:02:25,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:02:25 BoogieIcfgContainer [2021-12-07 00:02:25,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:02:25,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:02:25,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:02:25,049 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:02:25,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:01:09" (3/4) ... [2021-12-07 00:02:25,051 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-07 00:02:25,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-12-07 00:02:25,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-07 00:02:25,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-07 00:02:25,064 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-07 00:02:25,139 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:02:25,139 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:02:25,140 INFO L158 Benchmark]: Toolchain (without parser) took 75902.61ms. Allocated memory was 109.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 69.1MB in the beginning and 847.0MB in the end (delta: -777.9MB). Peak memory consumption was 281.5MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,140 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:02:25,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.19ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 81.9MB in the end (delta: -13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.23ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 79.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,140 INFO L158 Benchmark]: Boogie Preprocessor took 24.44ms. Allocated memory is still 109.1MB. Free memory was 79.4MB in the beginning and 77.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,141 INFO L158 Benchmark]: RCFGBuilder took 409.58ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 58.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,141 INFO L158 Benchmark]: TraceAbstraction took 75080.24ms. Allocated memory was 109.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 58.1MB in the beginning and 865.9MB in the end (delta: -807.8MB). Peak memory consumption was 736.7MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,141 INFO L158 Benchmark]: Witness Printer took 90.98ms. Allocated memory is still 1.2GB. Free memory was 865.9MB in the beginning and 847.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-07 00:02:25,142 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.19ms. Allocated memory is still 109.1MB. Free memory was 68.8MB in the beginning and 81.9MB in the end (delta: -13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.23ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 79.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.44ms. Allocated memory is still 109.1MB. Free memory was 79.4MB in the beginning and 77.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.58ms. Allocated memory is still 109.1MB. Free memory was 77.4MB in the beginning and 58.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 75080.24ms. Allocated memory was 109.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 58.1MB in the beginning and 865.9MB in the end (delta: -807.8MB). Peak memory consumption was 736.7MB. Max. memory is 16.1GB. * Witness Printer took 90.98ms. Allocated memory is still 1.2GB. Free memory was 865.9MB in the beginning and 847.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: 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, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.9s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 62.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11719 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11719 mSDsluCounter, 22319 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14501 mSDsCounter, 323 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 2017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 323 mSolverCounterUnsat, 7818 mSDtfsCounter, 1694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 649 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5718occurred in iteration=21, InterpolantAutomatonStates: 193, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 9012 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 599 NumberOfFragments, 14762 HoareAnnotationTreeSize, 22 FomulaSimplifications, 332 FormulaSimplificationTreeSizeReduction, 48.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 7092628 FormulaSimplificationTreeSizeReductionInter, 14.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3833 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3989 ConstructedInterpolants, 0 QuantifiedInterpolants, 8540 SizeOfPredicates, 6 NumberOfNonLiveVariables, 531 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 2142/2272 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: 182]: 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)) && !(0 == 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) || ((((((((((((((((((((((((!(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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && 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)) && !(0 == 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)) || ((((((((((((((((((((((((!(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)) && 0 == wl_pc) && 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)) && !(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) && !(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)) && !(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) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 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)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(0 == 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) && !(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)) && !(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)) || ((((((((((((((((((((((((!(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)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(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)) && 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)) && !(0 == 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)) || ((((((((((((((((((((((((!(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)) && 0 == wl_pc) && 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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1)) || (((((((((((((((((((((((((!(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)) && !(0 == 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)) && !(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) && !(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)) || (((((((((((((((((((((((((!(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)) && !(0 == 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)) && !(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) && t_b + 2 == c_t) && !(e_wl == 0)) && 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)) && 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)) && !(0 == 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)) || ((((((((((((((((((((((!(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)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 692]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: 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)) || ((((((((((((((((((((((((!(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)) || ((((((((((((((((((((((((!(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)) && !(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)) || ((((((((((((((((((((((((!(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)) && 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) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(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)) && !(0 == 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) || (((((((((((((((((((((((!(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)) && !(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)) && !(0 == 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)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) || ((((((((((((((((((((((!(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 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)) && !(0 == 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)) || ((((((((((((((((((((((!(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) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 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)) || (((((((((((((((((((((((!(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)) || (((((((((((((((((((((((!(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)) && 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) && !(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)) && 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)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 65]: 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) && !(0 == 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)) && 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: 289]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && 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) && !(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)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((!(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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(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)) && !(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) && !(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)) && !(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) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 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)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) || (((((((((((((((((((((((!(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)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && 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)) && 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)) && !(0 == 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)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 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) && !(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)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(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)) || (((((((((((((!(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)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 469]: 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: 62]: 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)) && !(0 == 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)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(0 == 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)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(0 == 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)) && 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)) && !(0 == 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)) && 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)) && !(0 == 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)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(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) && 2 == wl_pc) && 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)) && !(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)) && !(0 == 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) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || ((((((((((((!(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)) && 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) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((((((!(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)) && 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)) && !(0 == 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)) && !(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) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 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)) || ((((((((((((((((((((((((!(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)) || (((((((((((((((((((((((((!(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)) && !(0 == 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)) && !(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)) && !(0 == 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)) && 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) && !(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) && 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)) && !(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)) && !(c1_st == 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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(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)) && !(0 == 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) - InvariantResult [Line: 230]: 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)) && !(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: 185]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 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) && !(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)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(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)) || ((((((((((((((((!(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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 589]: 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)) && !(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)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 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)) && !(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) && !(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)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && c1_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)) && !(0 == 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)) || ((((((((((((((((((((((((!(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)) && 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)) && !(0 == 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) && 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)) && !(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)) && !(0 == 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)) && !(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) && t_b + 2 == c_t) && !(e_wl == 0)) && 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)) || ((((((((((((((((((((((((!(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)) && !(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)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 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)) && !(0 == 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: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && (t_b + 1 == d || t_b + 2 == d)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && (t_b + 1 == d || t_b + 2 == d)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && e_f == 2) && 2 == wl_pc - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1) && r_st == e_f)) && 2 == wl_pc) || (((((((((((((!(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)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && 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)) && !(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)) && c2_pc == 1) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && 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) && r_st == e_f) - InvariantResult [Line: 298]: 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)) && !(0 == 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) || ((((((((((((((((((((((((!(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)) || ((((((((((((((((((((((((!(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)) || ((((((((((((((((((((((((!(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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && 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)) && !(0 == 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)) && !(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) && !(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)) && !(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)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((((!(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)) && !(0 == 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)) && !(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) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && (t_b + 1 == d || t_b + 2 == d)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc)) || (((((((((((((!(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) && !(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)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(0 == 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)) && !(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)) && !(0 == 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)) && 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) && !(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) && 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)) || (((((((((((((((((((((((((!(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)) && !(0 == 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)) && !(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)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(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)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && (t_b + 2 == c || t_b + 1 == c)) && !(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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(e_wl == 0)) && data == t_b + 1) && 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)) && !(0 == 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)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && data == t) && !(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)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_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) && (c_t == t_b + 1 || t_b + 2 == c_t)) && !(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)) || ((((((((((((((((((((((((!(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)) || (((((((((((((((((((((((((!(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)) && !(0 == 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) RESULT: Ultimate proved your program to be correct! [2021-12-07 00:02:25,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_89f17acc-db7c-4581-81d6-fe7dfff789d1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE