/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-6598664
[2019-11-23 20:52:52,186 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-11-23 20:52:52,189 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-11-23 20:52:52,208 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-11-23 20:52:52,209 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-11-23 20:52:52,211 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-11-23 20:52:52,213 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-11-23 20:52:52,222 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-11-23 20:52:52,223 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-11-23 20:52:52,224 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-11-23 20:52:52,227 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-11-23 20:52:52,229 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-11-23 20:52:52,229 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-11-23 20:52:52,230 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-11-23 20:52:52,231 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-11-23 20:52:52,232 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-11-23 20:52:52,233 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-11-23 20:52:52,234 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-11-23 20:52:52,235 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-11-23 20:52:52,237 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-11-23 20:52:52,238 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-11-23 20:52:52,239 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-11-23 20:52:52,240 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-11-23 20:52:52,241 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-11-23 20:52:52,243 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-11-23 20:52:52,243 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-11-23 20:52:52,243 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-11-23 20:52:52,244 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-11-23 20:52:52,245 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-11-23 20:52:52,245 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-11-23 20:52:52,246 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-11-23 20:52:52,246 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-11-23 20:52:52,247 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-11-23 20:52:52,248 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-11-23 20:52:52,249 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-11-23 20:52:52,249 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-11-23 20:52:52,250 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-11-23 20:52:52,250 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-11-23 20:52:52,250 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-11-23 20:52:52,251 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-11-23 20:52:52,251 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-11-23 20:52:52,252 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-11-23 20:52:52,268 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-11-23 20:52:52,268 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-11-23 20:52:52,270 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-11-23 20:52:52,270 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-11-23 20:52:52,270 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-11-23 20:52:52,270 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-11-23 20:52:52,271 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-11-23 20:52:52,271 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-11-23 20:52:52,271 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-11-23 20:52:52,271 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-11-23 20:52:52,271 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-11-23 20:52:52,272 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-11-23 20:52:52,272 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-11-23 20:52:52,272 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2019-11-23 20:52:52,272 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-11-23 20:52:52,272 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-11-23 20:52:52,273 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-11-23 20:52:52,275 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-11-23 20:52:52,275 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-11-23 20:52:52,275 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-11-23 20:52:52,276 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-11-23 20:52:52,276 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-11-23 20:52:52,276 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-23 20:52:52,276 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-11-23 20:52:52,276 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-11-23 20:52:52,277 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-11-23 20:52:52,277 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-11-23 20:52:52,277 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-11-23 20:52:52,277 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-11-23 20:52:52,277 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2019-11-23 20:52:52,550 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-11-23 20:52:52,563 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-11-23 20:52:52,567 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-11-23 20:52:52,568 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-11-23 20:52:52,568 INFO  L275        PluginConnector]: CDTParser initialized
[2019-11-23 20:52:52,569 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label44.c
[2019-11-23 20:52:52,643 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd0200f2/13fefdde69d643eaa07ce2a6b9fcd626/FLAGca7c992fc
[2019-11-23 20:52:53,276 INFO  L306              CDTParser]: Found 1 translation units.
[2019-11-23 20:52:53,277 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label44.c
[2019-11-23 20:52:53,298 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd0200f2/13fefdde69d643eaa07ce2a6b9fcd626/FLAGca7c992fc
[2019-11-23 20:52:53,505 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd0200f2/13fefdde69d643eaa07ce2a6b9fcd626
[2019-11-23 20:52:53,514 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-11-23 20:52:53,516 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2019-11-23 20:52:53,517 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-11-23 20:52:53,517 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-11-23 20:52:53,521 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-11-23 20:52:53,522 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:53" (1/1) ...
[2019-11-23 20:52:53,524 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ece1d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:53, skipping insertion in model container
[2019-11-23 20:52:53,525 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:53" (1/1) ...
[2019-11-23 20:52:53,532 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2019-11-23 20:52:53,584 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2019-11-23 20:52:54,087 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-23 20:52:54,098 INFO  L203         MainTranslator]: Completed pre-run
[2019-11-23 20:52:54,251 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-11-23 20:52:54,269 INFO  L208         MainTranslator]: Completed translation
[2019-11-23 20:52:54,270 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54 WrapperNode
[2019-11-23 20:52:54,270 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-11-23 20:52:54,271 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-11-23 20:52:54,271 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-11-23 20:52:54,271 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2019-11-23 20:52:54,280 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,313 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,380 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-11-23 20:52:54,382 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-11-23 20:52:54,382 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-11-23 20:52:54,382 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-11-23 20:52:54,390 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,390 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,394 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,395 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,417 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,429 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,436 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
[2019-11-23 20:52:54,444 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-11-23 20:52:54,444 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-11-23 20:52:54,445 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-11-23 20:52:54,445 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-11-23 20:52:54,449 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-11-23 20:52:54,536 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-11-23 20:52:54,536 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-11-23 20:52:55,742 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-11-23 20:52:55,742 INFO  L284             CfgBuilder]: Removed 7 assume(true) statements.
[2019-11-23 20:52:55,744 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:55 BoogieIcfgContainer
[2019-11-23 20:52:55,745 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-11-23 20:52:55,748 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-11-23 20:52:55,749 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-11-23 20:52:55,753 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-11-23 20:52:55,755 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:53" (1/3) ...
[2019-11-23 20:52:55,757 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611da158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:55, skipping insertion in model container
[2019-11-23 20:52:55,757 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:54" (2/3) ...
[2019-11-23 20:52:55,758 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@611da158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:55, skipping insertion in model container
[2019-11-23 20:52:55,758 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:55" (3/3) ...
[2019-11-23 20:52:55,760 INFO  L109   eAbstractionObserver]: Analyzing ICFG Problem01_label44.c
[2019-11-23 20:52:55,770 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-11-23 20:52:55,780 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-11-23 20:52:55,792 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-11-23 20:52:55,834 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-11-23 20:52:55,835 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-11-23 20:52:55,835 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-11-23 20:52:55,835 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-11-23 20:52:55,835 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-11-23 20:52:55,836 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-11-23 20:52:55,836 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-11-23 20:52:55,836 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-11-23 20:52:55,864 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states.
[2019-11-23 20:52:55,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2019-11-23 20:52:55,878 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:52:55,879 INFO  L410         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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 20:52:55,880 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:52:55,886 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:52:55,887 INFO  L82        PathProgramCache]: Analyzing trace with hash -1496041601, now seen corresponding path program 1 times
[2019-11-23 20:52:55,897 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:52:55,897 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094327000]
[2019-11-23 20:52:55,898 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:52:56,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:52:56,290 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 20:52:56,291 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094327000]
[2019-11-23 20:52:56,292 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:52:56,292 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-23 20:52:56,294 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749470548]
[2019-11-23 20:52:56,299 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 20:52:56,299 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:52:56,313 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 20:52:56,314 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 20:52:56,316 INFO  L87              Difference]: Start difference. First operand 198 states. Second operand 3 states.
[2019-11-23 20:52:57,205 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:52:57,205 INFO  L93              Difference]: Finished difference Result 528 states and 915 transitions.
[2019-11-23 20:52:57,206 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 20:52:57,207 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 84
[2019-11-23 20:52:57,208 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:52:57,223 INFO  L225             Difference]: With dead ends: 528
[2019-11-23 20:52:57,223 INFO  L226             Difference]: Without dead ends: 266
[2019-11-23 20:52:57,228 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 20:52:57,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2019-11-23 20:52:57,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2019-11-23 20:52:57,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 266 states.
[2019-11-23 20:52:57,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions.
[2019-11-23 20:52:57,321 INFO  L78                 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 84
[2019-11-23 20:52:57,321 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:52:57,321 INFO  L462      AbstractCegarLoop]: Abstraction has 266 states and 380 transitions.
[2019-11-23 20:52:57,322 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 20:52:57,322 INFO  L276                IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions.
[2019-11-23 20:52:57,325 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2019-11-23 20:52:57,325 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:52:57,326 INFO  L410         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 20:52:57,326 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:52:57,326 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:52:57,326 INFO  L82        PathProgramCache]: Analyzing trace with hash -868636329, now seen corresponding path program 1 times
[2019-11-23 20:52:57,327 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:52:57,327 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237665536]
[2019-11-23 20:52:57,327 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:52:57,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:52:57,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 20:52:57,390 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237665536]
[2019-11-23 20:52:57,390 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:52:57,391 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 20:52:57,391 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767346432]
[2019-11-23 20:52:57,396 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 20:52:57,397 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:52:57,397 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 20:52:57,397 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-11-23 20:52:57,397 INFO  L87              Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states.
[2019-11-23 20:52:58,018 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:52:58,018 INFO  L93              Difference]: Finished difference Result 792 states and 1135 transitions.
[2019-11-23 20:52:58,020 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 20:52:58,020 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 89
[2019-11-23 20:52:58,020 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:52:58,023 INFO  L225             Difference]: With dead ends: 792
[2019-11-23 20:52:58,024 INFO  L226             Difference]: Without dead ends: 528
[2019-11-23 20:52:58,025 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-11-23 20:52:58,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2019-11-23 20:52:58,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2019-11-23 20:52:58,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 528 states.
[2019-11-23 20:52:58,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions.
[2019-11-23 20:52:58,064 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 89
[2019-11-23 20:52:58,064 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:52:58,064 INFO  L462      AbstractCegarLoop]: Abstraction has 528 states and 720 transitions.
[2019-11-23 20:52:58,067 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 20:52:58,067 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions.
[2019-11-23 20:52:58,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2019-11-23 20:52:58,074 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:52:58,075 INFO  L410         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 20:52:58,075 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:52:58,075 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:52:58,077 INFO  L82        PathProgramCache]: Analyzing trace with hash -829579709, now seen corresponding path program 1 times
[2019-11-23 20:52:58,077 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:52:58,077 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245672271]
[2019-11-23 20:52:58,078 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:52:58,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:52:58,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 20:52:58,152 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245672271]
[2019-11-23 20:52:58,153 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:52:58,153 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-11-23 20:52:58,153 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114298803]
[2019-11-23 20:52:58,155 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 20:52:58,156 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:52:58,156 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 20:52:58,157 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 20:52:58,158 INFO  L87              Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states.
[2019-11-23 20:52:58,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:52:58,723 INFO  L93              Difference]: Finished difference Result 1185 states and 1617 transitions.
[2019-11-23 20:52:58,724 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 20:52:58,724 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 97
[2019-11-23 20:52:58,724 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:52:58,728 INFO  L225             Difference]: With dead ends: 1185
[2019-11-23 20:52:58,728 INFO  L226             Difference]: Without dead ends: 659
[2019-11-23 20:52:58,730 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 20:52:58,731 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 659 states.
[2019-11-23 20:52:58,743 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528.
[2019-11-23 20:52:58,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 528 states.
[2019-11-23 20:52:58,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions.
[2019-11-23 20:52:58,745 INFO  L78                 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 97
[2019-11-23 20:52:58,745 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:52:58,745 INFO  L462      AbstractCegarLoop]: Abstraction has 528 states and 714 transitions.
[2019-11-23 20:52:58,746 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 20:52:58,746 INFO  L276                IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions.
[2019-11-23 20:52:58,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2019-11-23 20:52:58,748 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:52:58,748 INFO  L410         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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]
[2019-11-23 20:52:58,749 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:52:58,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:52:58,749 INFO  L82        PathProgramCache]: Analyzing trace with hash -1267971915, now seen corresponding path program 1 times
[2019-11-23 20:52:58,749 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:52:58,750 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704723484]
[2019-11-23 20:52:58,750 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:52:58,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:52:58,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-11-23 20:52:58,816 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704723484]
[2019-11-23 20:52:58,816 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:52:58,817 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 20:52:58,817 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037773925]
[2019-11-23 20:52:58,817 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 20:52:58,818 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:52:58,818 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 20:52:58,818 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-11-23 20:52:58,818 INFO  L87              Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states.
[2019-11-23 20:52:59,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:52:59,634 INFO  L93              Difference]: Finished difference Result 1971 states and 2669 transitions.
[2019-11-23 20:52:59,635 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-11-23 20:52:59,635 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 106
[2019-11-23 20:52:59,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:52:59,644 INFO  L225             Difference]: With dead ends: 1971
[2019-11-23 20:52:59,644 INFO  L226             Difference]: Without dead ends: 1445
[2019-11-23 20:52:59,646 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2019-11-23 20:52:59,649 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1445 states.
[2019-11-23 20:52:59,698 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314.
[2019-11-23 20:52:59,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1314 states.
[2019-11-23 20:52:59,704 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1705 transitions.
[2019-11-23 20:52:59,704 INFO  L78                 Accepts]: Start accepts. Automaton has 1314 states and 1705 transitions. Word has length 106
[2019-11-23 20:52:59,705 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:52:59,705 INFO  L462      AbstractCegarLoop]: Abstraction has 1314 states and 1705 transitions.
[2019-11-23 20:52:59,705 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 20:52:59,705 INFO  L276                IsEmpty]: Start isEmpty. Operand 1314 states and 1705 transitions.
[2019-11-23 20:52:59,708 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2019-11-23 20:52:59,708 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:52:59,709 INFO  L410         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 20:52:59,709 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:52:59,709 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:52:59,709 INFO  L82        PathProgramCache]: Analyzing trace with hash -653623644, now seen corresponding path program 1 times
[2019-11-23 20:52:59,710 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:52:59,710 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204290253]
[2019-11-23 20:52:59,710 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:52:59,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:52:59,839 INFO  L134       CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-11-23 20:52:59,840 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204290253]
[2019-11-23 20:52:59,840 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:52:59,840 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 20:52:59,841 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984931489]
[2019-11-23 20:52:59,842 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-11-23 20:52:59,842 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:52:59,842 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-11-23 20:52:59,843 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-11-23 20:52:59,843 INFO  L87              Difference]: Start difference. First operand 1314 states and 1705 transitions. Second operand 4 states.
[2019-11-23 20:53:00,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:53:00,485 INFO  L93              Difference]: Finished difference Result 2762 states and 3562 transitions.
[2019-11-23 20:53:00,485 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 20:53:00,486 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 112
[2019-11-23 20:53:00,486 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:53:00,493 INFO  L225             Difference]: With dead ends: 2762
[2019-11-23 20:53:00,493 INFO  L226             Difference]: Without dead ends: 1450
[2019-11-23 20:53:00,495 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-11-23 20:53:00,497 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1450 states.
[2019-11-23 20:53:00,523 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445.
[2019-11-23 20:53:00,523 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1445 states.
[2019-11-23 20:53:00,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1842 transitions.
[2019-11-23 20:53:00,528 INFO  L78                 Accepts]: Start accepts. Automaton has 1445 states and 1842 transitions. Word has length 112
[2019-11-23 20:53:00,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:53:00,528 INFO  L462      AbstractCegarLoop]: Abstraction has 1445 states and 1842 transitions.
[2019-11-23 20:53:00,529 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-11-23 20:53:00,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 1445 states and 1842 transitions.
[2019-11-23 20:53:00,531 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2019-11-23 20:53:00,532 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:53:00,532 INFO  L410         BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2019-11-23 20:53:00,532 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:53:00,532 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:53:00,532 INFO  L82        PathProgramCache]: Analyzing trace with hash -464075556, now seen corresponding path program 1 times
[2019-11-23 20:53:00,533 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:53:00,533 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542033200]
[2019-11-23 20:53:00,533 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:53:00,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:53:00,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-11-23 20:53:00,633 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542033200]
[2019-11-23 20:53:00,634 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:53:00,634 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 20:53:00,634 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80832817]
[2019-11-23 20:53:00,634 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-23 20:53:00,635 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:53:00,635 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-23 20:53:00,635 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-11-23 20:53:00,635 INFO  L87              Difference]: Start difference. First operand 1445 states and 1842 transitions. Second operand 5 states.
[2019-11-23 20:53:01,645 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:53:01,645 INFO  L93              Difference]: Finished difference Result 2888 states and 3694 transitions.
[2019-11-23 20:53:01,645 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 20:53:01,646 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 116
[2019-11-23 20:53:01,646 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:53:01,657 INFO  L225             Difference]: With dead ends: 2888
[2019-11-23 20:53:01,658 INFO  L226             Difference]: Without dead ends: 1576
[2019-11-23 20:53:01,660 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-11-23 20:53:01,662 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2019-11-23 20:53:01,686 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576.
[2019-11-23 20:53:01,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1576 states.
[2019-11-23 20:53:01,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1967 transitions.
[2019-11-23 20:53:01,692 INFO  L78                 Accepts]: Start accepts. Automaton has 1576 states and 1967 transitions. Word has length 116
[2019-11-23 20:53:01,692 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:53:01,692 INFO  L462      AbstractCegarLoop]: Abstraction has 1576 states and 1967 transitions.
[2019-11-23 20:53:01,693 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-23 20:53:01,693 INFO  L276                IsEmpty]: Start isEmpty. Operand 1576 states and 1967 transitions.
[2019-11-23 20:53:01,695 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2019-11-23 20:53:01,696 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:53:01,696 INFO  L410         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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]
[2019-11-23 20:53:01,696 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:53:01,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:53:01,697 INFO  L82        PathProgramCache]: Analyzing trace with hash 1343997239, now seen corresponding path program 1 times
[2019-11-23 20:53:01,697 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:53:01,697 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344714137]
[2019-11-23 20:53:01,697 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:53:01,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:53:01,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2019-11-23 20:53:01,785 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344714137]
[2019-11-23 20:53:01,789 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:53:01,790 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-11-23 20:53:01,790 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291836670]
[2019-11-23 20:53:01,791 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-11-23 20:53:01,798 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:53:01,801 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-11-23 20:53:01,801 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-11-23 20:53:01,802 INFO  L87              Difference]: Start difference. First operand 1576 states and 1967 transitions. Second operand 3 states.
[2019-11-23 20:53:02,350 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:53:02,351 INFO  L93              Difference]: Finished difference Result 3674 states and 4631 transitions.
[2019-11-23 20:53:02,352 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-11-23 20:53:02,352 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 119
[2019-11-23 20:53:02,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:53:02,360 INFO  L225             Difference]: With dead ends: 3674
[2019-11-23 20:53:02,360 INFO  L226             Difference]: Without dead ends: 1969
[2019-11-23 20:53:02,363 INFO  L630         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
[2019-11-23 20:53:02,365 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1969 states.
[2019-11-23 20:53:02,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707.
[2019-11-23 20:53:02,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1707 states.
[2019-11-23 20:53:02,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1923 transitions.
[2019-11-23 20:53:02,395 INFO  L78                 Accepts]: Start accepts. Automaton has 1707 states and 1923 transitions. Word has length 119
[2019-11-23 20:53:02,395 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:53:02,395 INFO  L462      AbstractCegarLoop]: Abstraction has 1707 states and 1923 transitions.
[2019-11-23 20:53:02,395 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-11-23 20:53:02,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 1707 states and 1923 transitions.
[2019-11-23 20:53:02,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2019-11-23 20:53:02,398 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:53:02,399 INFO  L410         BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-11-23 20:53:02,399 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:53:02,399 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:53:02,399 INFO  L82        PathProgramCache]: Analyzing trace with hash -1010035269, now seen corresponding path program 1 times
[2019-11-23 20:53:02,400 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:53:02,400 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705732574]
[2019-11-23 20:53:02,400 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:53:02,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-11-23 20:53:02,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-11-23 20:53:02,491 INFO  L348   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705732574]
[2019-11-23 20:53:02,491 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-11-23 20:53:02,491 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-11-23 20:53:02,491 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011572858]
[2019-11-23 20:53:02,492 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-11-23 20:53:02,492 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2019-11-23 20:53:02,492 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-11-23 20:53:02,492 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-11-23 20:53:02,493 INFO  L87              Difference]: Start difference. First operand 1707 states and 1923 transitions. Second operand 5 states.
[2019-11-23 20:53:03,580 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-11-23 20:53:03,580 INFO  L93              Difference]: Finished difference Result 4591 states and 5240 transitions.
[2019-11-23 20:53:03,581 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-11-23 20:53:03,581 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 134
[2019-11-23 20:53:03,581 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-11-23 20:53:03,593 INFO  L225             Difference]: With dead ends: 4591
[2019-11-23 20:53:03,593 INFO  L226             Difference]: Without dead ends: 3017
[2019-11-23 20:53:03,596 INFO  L630         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-11-23 20:53:03,599 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3017 states.
[2019-11-23 20:53:03,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2493.
[2019-11-23 20:53:03,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2493 states.
[2019-11-23 20:53:03,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2760 transitions.
[2019-11-23 20:53:03,643 INFO  L78                 Accepts]: Start accepts. Automaton has 2493 states and 2760 transitions. Word has length 134
[2019-11-23 20:53:03,644 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-11-23 20:53:03,644 INFO  L462      AbstractCegarLoop]: Abstraction has 2493 states and 2760 transitions.
[2019-11-23 20:53:03,644 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-11-23 20:53:03,644 INFO  L276                IsEmpty]: Start isEmpty. Operand 2493 states and 2760 transitions.
[2019-11-23 20:53:03,649 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2019-11-23 20:53:03,649 INFO  L402         BasicCegarLoop]: Found error trace
[2019-11-23 20:53:03,649 INFO  L410         BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2019-11-23 20:53:03,650 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-11-23 20:53:03,650 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-11-23 20:53:03,650 INFO  L82        PathProgramCache]: Analyzing trace with hash 2132068929, now seen corresponding path program 1 times
[2019-11-23 20:53:03,650 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2019-11-23 20:53:03,651 INFO  L348   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742731331]
[2019-11-23 20:53:03,651 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-11-23 20:53:03,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-23 20:53:03,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-11-23 20:53:03,838 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2019-11-23 20:53:03,838 INFO  L475         BasicCegarLoop]: Counterexample might be feasible
[2019-11-23 20:53:03,999 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:53:03 BoogieIcfgContainer
[2019-11-23 20:53:03,999 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-11-23 20:53:04,006 INFO  L168              Benchmark]: Toolchain (without parser) took 10484.76 ms. Allocated memory was 138.9 MB in the beginning and 371.2 MB in the end (delta: 232.3 MB). Free memory was 101.9 MB in the beginning and 184.6 MB in the end (delta: -82.7 MB). Peak memory consumption was 149.5 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,007 INFO  L168              Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,008 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 753.39 ms. Allocated memory was 138.9 MB in the beginning and 205.5 MB in the end (delta: 66.6 MB). Free memory was 101.7 MB in the beginning and 171.3 MB in the end (delta: -69.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,009 INFO  L168              Benchmark]: Boogie Procedure Inliner took 109.54 ms. Allocated memory is still 205.5 MB. Free memory was 171.3 MB in the beginning and 165.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,010 INFO  L168              Benchmark]: Boogie Preprocessor took 62.47 ms. Allocated memory is still 205.5 MB. Free memory was 165.8 MB in the beginning and 161.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,013 INFO  L168              Benchmark]: RCFGBuilder took 1301.03 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 161.0 MB in the beginning and 172.5 MB in the end (delta: -11.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,016 INFO  L168              Benchmark]: TraceAbstraction took 8250.94 ms. Allocated memory was 239.1 MB in the beginning and 371.2 MB in the end (delta: 132.1 MB). Free memory was 172.5 MB in the beginning and 184.6 MB in the end (delta: -12.1 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB.
[2019-11-23 20:53:04,024 INFO  L335   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 753.39 ms. Allocated memory was 138.9 MB in the beginning and 205.5 MB in the end (delta: 66.6 MB). Free memory was 101.7 MB in the beginning and 171.3 MB in the end (delta: -69.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 109.54 ms. Allocated memory is still 205.5 MB. Free memory was 171.3 MB in the beginning and 165.8 MB in the end (delta: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 62.47 ms. Allocated memory is still 205.5 MB. Free memory was 165.8 MB in the beginning and 161.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1301.03 ms. Allocated memory was 205.5 MB in the beginning and 239.1 MB in the end (delta: 33.6 MB). Free memory was 161.0 MB in the beginning and 172.5 MB in the end (delta: -11.5 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 8250.94 ms. Allocated memory was 239.1 MB in the beginning and 371.2 MB in the end (delta: 132.1 MB). Free memory was 172.5 MB in the beginning and 184.6 MB in the end (delta: -12.1 MB). Peak memory consumption was 120.0 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 428]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L7]                int a= 1;
[L8]                int d= 4;
[L9]                int e= 5;
[L10]               int f= 6;
[L11]               int c= 3;
[L12]               int b= 2;
[L15]               int u = 21;
[L16]               int v = 22;
[L17]               int w = 23;
[L18]               int x = 24;
[L19]               int y = 25;
[L20]               int z = 26;
[L22]               int a17 = 1;
[L23]               int a7 = 0;
[L24]               int a20 = 1;
[L25]               int a8 = 15;
[L26]               int a12 = 8;
[L27]               int a16 = 5;
[L28]               int a21 = 1;
        VAL         [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L580]              int output = -1;
        VAL         [a=1, a12=8, a16=5, a17=1, a20=1, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L583]  COND TRUE   1
[L586]              int input;
[L587]              input = __VERIFIER_nondet_int()
[L588]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L31]   COND TRUE   (((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8))
[L32]               a16 = 5
[L33]               a20 = 0
[L34]               return 24;
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L591]              output = calculate_output(input)
[L583]  COND TRUE   1
[L586]              int input;
[L587]              input = __VERIFIER_nondet_int()
[L588]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L31]   COND FALSE  !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L43]   COND FALSE  !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L49]   COND FALSE  !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L62]   COND FALSE  !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L72]   COND FALSE  !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L80]   COND FALSE  !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L97]   COND FALSE  !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L102]  COND FALSE  !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L108]  COND FALSE  !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L114]  COND FALSE  !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L119]  COND FALSE  !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L124]  COND FALSE  !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L129]  COND FALSE  !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L136]  COND FALSE  !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L152]  COND FALSE  !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L160]  COND FALSE  !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L165]  COND FALSE  !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L173]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L178]  COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L186]  COND FALSE  !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L197]  COND FALSE  !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L203]  COND FALSE  !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L208]  COND FALSE  !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L214]  COND FALSE  !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L231]  COND FALSE  !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L238]  COND FALSE  !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L245]  COND FALSE  !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L250]  COND FALSE  !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L256]  COND FALSE  !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L261]  COND FALSE  !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
        VAL         [a=1, a12=8, a16=5, a17=1, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L265]  COND TRUE   ((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15)))
[L266]              a17 = 0
[L267]              return 24;
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L591]              output = calculate_output(input)
[L583]  COND TRUE   1
[L586]              int input;
[L587]              input = __VERIFIER_nondet_int()
[L588]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L31]   COND FALSE  !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L43]   COND FALSE  !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L49]   COND FALSE  !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L62]   COND FALSE  !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L72]   COND FALSE  !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L80]   COND FALSE  !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L97]   COND FALSE  !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L102]  COND FALSE  !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L108]  COND FALSE  !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L114]  COND FALSE  !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L119]  COND FALSE  !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L124]  COND FALSE  !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L129]  COND FALSE  !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L136]  COND FALSE  !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L152]  COND FALSE  !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L160]  COND FALSE  !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L165]  COND FALSE  !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L173]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L178]  COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L186]  COND FALSE  !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L197]  COND FALSE  !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L203]  COND FALSE  !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L208]  COND FALSE  !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L214]  COND FALSE  !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L231]  COND FALSE  !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L238]  COND FALSE  !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L245]  COND FALSE  !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L250]  COND FALSE  !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L256]  COND FALSE  !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L261]  COND FALSE  !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L265]  COND FALSE  !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L268]  COND FALSE  !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L273]  COND FALSE  !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4)))))))))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L278]  COND FALSE  !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L292]  COND FALSE  !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L299]  COND FALSE  !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L306]  COND FALSE  !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15)))
        VAL         [a=1, a12=8, a16=5, a17=0, a20=0, a21=1, a7=0, a8=15, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L312]  COND TRUE   ((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5))
[L313]              a8 = 13
[L314]              a16 = 4
[L315]              return -1;
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L591]              output = calculate_output(input)
[L583]  COND TRUE   1
[L586]              int input;
[L587]              input = __VERIFIER_nondet_int()
[L588]  COND FALSE  !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L31]   COND FALSE  !((((a8==15)&&(((((a21==1)&&(((a16==5)||(a16==6))&&(input==1)))&&(a20==1))&&(a17==1))&&!(a7==1)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !((((((((input==5)&&((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5))))&&(a20==1))&&(a12==8))&&(a7==1))&&!(a21==1))&&(a8==13)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L43]   COND FALSE  !(((!(a7==1)&&((((a16==6)&&((a21==1)&&((a17==1)&&(input==3))))&&!(a20==1))&&(a8==15)))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L49]   COND FALSE  !(((a17==1)&&((!(a7==1)&&(((a21==1)&&((((a16==5)||(a16==6))&&(input==6))&&(a20==1)))&&(a8==15)))&&(a12==8))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !((((input==3)&&((((a16==6)&&((!(a20==1)&&(!(a7==1)&&!(a17==1)))&&(a8==15)))&&(a21==1))||((((a8==13)&&((a20==1)&&((a17==1)&&(a7==1))))&&(a16==4))&&!(a21==1))))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L62]   COND FALSE  !((((a17==1)&&(((a21==1)&&((!(a7==1)&&((input==4)&&(a8==15)))&&!(a20==1)))&&(a12==8)))&&(a16==6)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !((((a12==8)&&(((a21==1)&&((((input==5)&&!(a7==1))&&(a8==15))&&(a16==5)))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L72]   COND FALSE  !(((a12==8)&&((input==1)&&(((a21==1)&&(((a8==15)&&((!(a17==1)&&!(a7==1))&&!(a20==1)))&&(a16==6)))||(!(a21==1)&&((a16==4)&&((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L80]   COND FALSE  !(((((!(a17==1)&&(!(a7==1)&&((a21==1)&&((a8==15)&&(input==4)))))&&!(a20==1))&&(a12==8))&&(a16==4)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L84]   COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&(((a20==1)&&((a17==1)&&(a7==1)))&&(a8==13)))&&!(a21==1)))&&(input==2))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L92]   COND FALSE  !(((a8==13)&&(!(a21==1)&&((((input==3)&&((((a20==1)&&!(a17==1))&&(a16==6))||((!(a20==1)&&(a17==1))&&(a16==4))))&&(a12==8))&&(a7==1)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L97]   COND FALSE  !(((((a21==1)&&((a12==8)&&((input==1)&&(((!(a20==1)&&(a17==1))&&(a16==4))||(((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&(!(a17==1)&&(a20==1))))))))&&!(a7==1))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L102]  COND FALSE  !((((a16==5)&&(((a7==1)&&((!(a21==1)&&((a12==8)&&(input==3)))&&(a8==13)))&&(a17==1)))&&(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L108]  COND FALSE  !(((a17==1)&&(((a8==15)&&(((a12==8)&&((!(a7==1)&&(input==5))&&(a21==1)))&&!(a20==1)))&&(a16==5))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L114]  COND FALSE  !((!(a7==1)&&(((((a21==1)&&(((a8==15)&&(input==5))&&!(a17==1)))&&(a12==8))&&(a20==1))&&(a16==4))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L119]  COND FALSE  !(((!(a21==1)&&(((a12==8)&&((((a16==6)&&((a20==1)&&!(a17==1)))||((!(a20==1)&&(a17==1))&&(a16==4)))&&(input==1)))&&(a8==13)))&&(a7==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L124]  COND FALSE  !(((a17==1)&&(!(a7==1)&&(((a21==1)&&(((a12==8)&&((input==5)&&((a16==5)||(a16==6))))&&(a20==1)))&&(a8==15)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L129]  COND FALSE  !((((a12==8)&&(!(a21==1)&&((a7==1)&&((a8==13)&&((input==6)&&((((a16==6)&&(a17==1))||((a16==4)&&!(a17==1)))||((a16==5)&&!(a17==1))))))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L136]  COND FALSE  !((((a16==5)&&((((a8==15)&&((!(a7==1)&&(input==2))&&(a21==1)))&&(a12==8))&&!(a20==1)))&&!(a17==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L140]  COND FALSE  !((!(a20==1)&&((a21==1)&&((a16==4)&&((a8==15)&&(((a12==8)&&((input==2)&&!(a7==1)))&&!(a17==1)))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L144]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((!(a20==1)&&(!(a17==1)&&((a12==8)&&(input==6))))&&(a16==4))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((a17==1)&&((((((a12==8)&&((input==4)&&(a8==13)))&&(a20==1))&&!(a21==1))&&(a16==5))&&(a7==1))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L152]  COND FALSE  !(((((a8==13)&&((a12==8)&&((((((a16==6)&&(a17==1))||(!(a17==1)&&(a16==4)))||(!(a17==1)&&(a16==5)))&&(input==1))&&!(a21==1))))&&(a20==1))&&(a7==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L160]  COND FALSE  !(((a8==13)&&(!(a21==1)&&((((((!(a17==1)&&(a20==1))&&(a16==6))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==5))&&(a7==1))&&(a12==8)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L165]  COND FALSE  !(((!(a21==1)&&((((((a16==6)&&((a20==1)&&!(a17==1)))||(((a17==1)&&!(a20==1))&&(a16==4)))&&(input==4))&&(a7==1))&&(a12==8)))&&(a8==13)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L173]  COND FALSE  !((((a21==1)&&(!(a7==1)&&((((((a16==5)&&((a20==1)&&!(a17==1)))||((!(a17==1)&&(a20==1))&&(a16==6)))||((a16==4)&&((a17==1)&&!(a20==1))))&&(input==4))&&(a12==8))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L178]  COND FALSE  !(((((((a16==6)&&((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15)))&&(a21==1))||(((a16==4)&&((((a7==1)&&(a17==1))&&(a20==1))&&(a8==13)))&&!(a21==1)))&&(input==4))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L186]  COND FALSE  !((!(a17==1)&&(((a12==8)&&(!(a20==1)&&(((a8==15)&&((a21==1)&&(input==4)))&&!(a7==1))))&&(a16==5))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !((((!(a7==1)&&(((input==2)&&((((a16==5)&&((a20==1)&&!(a17==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a8==15)))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !((!(a20==1)&&(((((((input==6)&&(a16==5))&&(a21==1))&&!(a17==1))&&(a12==8))&&!(a7==1))&&(a8==15))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L197]  COND FALSE  !(((a12==8)&&(((((((a21==1)&&(input==5))&&(a8==15))&&(a17==1))&&!(a7==1))&&!(a20==1))&&(a16==6))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L203]  COND FALSE  !(((((a8==15)&&(!(a7==1)&&((((!(a20==1)&&(a17==1))&&(a16==4))||(((!(a17==1)&&(a20==1))&&(a16==5))||((a16==6)&&((a20==1)&&!(a17==1)))))&&(input==6))))&&(a12==8))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L208]  COND FALSE  !(((a8==15)&&((a16==4)&&(!(a20==1)&&((((a21==1)&&(!(a17==1)&&(input==5)))&&!(a7==1))&&(a12==8))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L214]  COND FALSE  !(((a17==1)&&((a12==8)&&((a8==15)&&(((!(a7==1)&&(((a16==5)||(a16==6))&&(input==2)))&&(a21==1))&&(a20==1))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((!(a7==1)&&(((a8==15)&&((!(a17==1)&&((a12==8)&&((input==3)&&(a21==1))))&&(a16==4)))&&(a20==1))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !(((a16==5)&&((!(a21==1)&&(((a8==13)&&(((input==2)&&(a20==1))&&(a12==8)))&&(a7==1)))&&(a17==1))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L231]  COND FALSE  !(((a20==1)&&(((a12==8)&&((a7==1)&&((a8==13)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==3)))))&&!(a21==1))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L238]  COND FALSE  !(((a12==8)&&((a7==1)&&(!(a21==1)&&((a8==13)&&((input==6)&&(((a16==6)&&((a20==1)&&!(a17==1)))||((a16==4)&&((a17==1)&&!(a20==1))))))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L245]  COND FALSE  !(((!(a7==1)&&(!(a17==1)&&((((a16==4)&&((a8==15)&&(input==1)))&&(a12==8))&&(a21==1))))&&(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L250]  COND FALSE  !(((a17==1)&&(((a21==1)&&(!(a20==1)&&((a12==8)&&((a8==15)&&(!(a7==1)&&(input==1))))))&&(a16==6))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L256]  COND FALSE  !(((a20==1)&&((a12==8)&&((((a17==1)&&((((a16==5)||(a16==6))&&(input==4))&&(a8==15)))&&(a21==1))&&!(a7==1)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L261]  COND FALSE  !(((((a8==13)&&((((!(a21==1)&&(input==6))&&(a20==1))&&(a12==8))&&(a17==1)))&&(a7==1))&&(a16==5)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L265]  COND FALSE  !(((a16==5)&&(((((a12==8)&&(!(a7==1)&&((input==2)&&!(a20==1))))&&(a21==1))&&(a17==1))&&(a8==15))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L268]  COND FALSE  !((((a12==8)&&(((!(a17==1)&&((a21==1)&&((input==4)&&!(a7==1))))&&(a8==15))&&(a20==1)))&&(a16==4)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L273]  COND FALSE  !(((a7==1)&&((a8==13)&&((a12==8)&&(!(a21==1)&&((input==2)&&((((a20==1)&&!(a17==1))&&(a16==6))||(((a17==1)&&!(a20==1))&&(a16==4)))))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L278]  COND FALSE  !((((((((!(a20==1)&&(!(a17==1)&&!(a7==1)))&&(a8==15))&&(a16==6))&&(a21==1))||((((a8==13)&&(((a17==1)&&(a7==1))&&(a20==1)))&&(a16==4))&&!(a21==1)))&&(input==6))&&(a12==8)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((!(a7==1)&&(!(a17==1)&&(((((input==3)&&(a21==1))&&(a16==4))&&(a8==15))&&(a12==8))))&&!(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L292]  COND FALSE  !((((((a12==8)&&(((((a17==1)&&!(a20==1))&&(a16==4))||((((a20==1)&&!(a17==1))&&(a16==5))||((!(a17==1)&&(a20==1))&&(a16==6))))&&(input==3)))&&(a8==15))&&(a21==1))&&!(a7==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L299]  COND FALSE  !((((!(a7==1)&&(((input==5)&&((((a16==5)&&(!(a17==1)&&(a20==1)))||((a16==6)&&((a20==1)&&!(a17==1))))||((a16==4)&&(!(a20==1)&&(a17==1)))))&&(a12==8)))&&(a21==1))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L306]  COND FALSE  !(((!(a7==1)&&(((a21==1)&&(((a17==1)&&((a12==8)&&(input==2)))&&!(a20==1)))&&(a16==6)))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L312]  COND FALSE  !(((!(a17==1)&&((a21==1)&&((!(a20==1)&&((a12==8)&&((input==3)&&!(a7==1))))&&(a8==15))))&&(a16==5)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L316]  COND FALSE  !((((a16==5)&&(!(a20==1)&&(((((input==6)&&(a21==1))&&(a17==1))&&!(a7==1))&&(a12==8))))&&(a8==15)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L318]  COND FALSE  !((!(a7==1)&&((a17==1)&&(((a16==6)&&(!(a20==1)&&(((input==6)&&(a12==8))&&(a21==1))))&&(a8==15)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L324]  COND FALSE  !(((((a21==1)&&((a8==15)&&((a12==8)&&(!(a7==1)&&(!(a17==1)&&(input==2))))))&&(a16==4))&&(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L329]  COND FALSE  !(((a8==15)&&(((a16==4)&&((a12==8)&&((!(a20==1)&&(!(a7==1)&&(input==1)))&&!(a17==1))))&&(a21==1))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L333]  COND FALSE  !(((a21==1)&&(((a12==8)&&((((a17==1)&&((input==3)&&((a16==5)||(a16==6))))&&!(a7==1))&&(a20==1)))&&(a8==15))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L337]  COND FALSE  !((!(a21==1)&&((a20==1)&&(((a12==8)&&((a8==13)&&((((a16==5)&&!(a17==1))||(((a17==1)&&(a16==6))||(!(a17==1)&&(a16==4))))&&(input==2))))&&(a7==1)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L345]  COND FALSE  !(((a7==1)&&((a12==8)&&((((a20==1)&&(((!(a17==1)&&(a16==5))||(((a17==1)&&(a16==6))||((a16==4)&&!(a17==1))))&&(input==4)))&&(a8==13))&&!(a21==1)))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L353]  COND FALSE  !(((a21==1)&&((((!(a7==1)&&((a8==15)&&(!(a20==1)&&(input==4))))&&(a17==1))&&(a16==5))&&(a12==8))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L355]  COND FALSE  !((((!(a7==1)&&((!(a20==1)&&((a21==1)&&((input==3)&&(a17==1))))&&(a8==15)))&&(a12==8))&&(a16==5)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L361]  COND FALSE  !(((((!(a17==1)&&(!(a20==1)&&((a8==15)&&((input==1)&&(a16==5)))))&&(a12==8))&&(a21==1))&&!(a7==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L363]  COND FALSE  !(((((a21==1)&&((a8==15)&&(((a16==5)&&((a12==8)&&(input==1)))&&(a17==1))))&&!(a7==1))&&!(a20==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L365]  COND FALSE  !(((!(a21==1)&&((a20==1)&&((((a8==13)&&((a7==1)&&(input==5)))&&(a17==1))&&(a12==8))))&&(a16==5)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L372]  COND FALSE  !((((!(a7==1)&&((a21==1)&&((((input==6)&&(a20==1))&&(a8==15))&&!(a17==1))))&&(a12==8))&&(a16==4)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L377]  COND FALSE  !(((((a20==1)&&(((!(a21==1)&&((a7==1)&&(input==1)))&&(a8==13))&&(a17==1)))&&(a12==8))&&(a16==5)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L382]  COND FALSE  !(((a12==8)&&((input==5)&&((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==15))&&(a16==6))&&(a21==1))||(!(a21==1)&&((a16==4)&&(((a20==1)&&((a7==1)&&(a17==1)))&&(a8==13))))))))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L391]  COND FALSE  !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L394]  COND FALSE  !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L397]  COND FALSE  !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L400]  COND FALSE  !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==6))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L403]  COND FALSE  !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L406]  COND FALSE  !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==15))&&(a12==8))&&(a16==5))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L409]  COND FALSE  !(((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L412]  COND FALSE  !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L415]  COND FALSE  !((((((((a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L418]  COND FALSE  !(((((((!(a17==1)&&(a7==1))&&(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L421]  COND FALSE  !(((((((!(a17==1)&&!(a7==1))&&(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L424]  COND FALSE  !(((((((!(a17==1)&&(a7==1))&&!(a20==1))&&(a8==14))&&(a12==8))&&(a16==5))&&(a21==1)))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L427]  COND TRUE   ((((((!(a17==1)&&!(a7==1))&&!(a20==1))&&(a8==13))&&(a12==8))&&(a16==4))&&(a21==1))
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L428]              __VERIFIER_error()
        VAL         [a=1, a12=8, a16=4, a17=0, a20=0, a21=1, a7=0, a8=13, b=2, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 198 locations, 1 error locations. Result: UNSAFE, OverallTime: 8.1s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 526 SDtfs, 1909 SDslu, 87 SDs, 0 SdLazy, 4208 SolverSat, 662 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1053 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1045 NumberOfCodeBlocks, 1045 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 849 ConstructedInterpolants, 0 QuantifiedInterpolants, 185898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 254/254 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...