java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c


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


This is Ultimate 0.1.23-1dbac8b
[2018-10-26 18:21:36,723 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-10-26 18:21:36,726 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-10-26 18:21:36,743 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-10-26 18:21:36,743 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-10-26 18:21:36,745 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-10-26 18:21:36,748 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-10-26 18:21:36,751 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-10-26 18:21:36,752 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-10-26 18:21:36,755 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-10-26 18:21:36,755 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-10-26 18:21:36,757 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-10-26 18:21:36,758 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-10-26 18:21:36,760 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-10-26 18:21:36,766 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-10-26 18:21:36,767 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-10-26 18:21:36,771 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-10-26 18:21:36,773 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-10-26 18:21:36,776 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-10-26 18:21:36,779 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-10-26 18:21:36,782 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-10-26 18:21:36,784 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-10-26 18:21:36,786 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-10-26 18:21:36,786 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-10-26 18:21:36,786 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-10-26 18:21:36,787 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-10-26 18:21:36,789 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-10-26 18:21:36,789 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-10-26 18:21:36,790 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-10-26 18:21:36,791 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-10-26 18:21:36,792 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-10-26 18:21:36,792 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-10-26 18:21:36,792 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-10-26 18:21:36,793 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-10-26 18:21:36,794 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-10-26 18:21:36,794 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-10-26 18:21:36,795 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf
[2018-10-26 18:21:36,809 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-10-26 18:21:36,809 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-10-26 18:21:36,810 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-10-26 18:21:36,810 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-10-26 18:21:36,811 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-10-26 18:21:36,811 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-10-26 18:21:36,812 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-10-26 18:21:36,812 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-10-26 18:21:36,812 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-10-26 18:21:36,812 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-10-26 18:21:36,812 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-10-26 18:21:36,812 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-10-26 18:21:36,813 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-10-26 18:21:36,813 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-10-26 18:21:36,813 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-10-26 18:21:36,813 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-10-26 18:21:36,813 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-10-26 18:21:36,814 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-10-26 18:21:36,814 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-10-26 18:21:36,814 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-10-26 18:21:36,814 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-10-26 18:21:36,814 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-10-26 18:21:36,815 INFO  L133        SettingsManager]:  * To the following directory=dump/
[2018-10-26 18:21:36,877 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-10-26 18:21:36,894 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-10-26 18:21:36,898 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-10-26 18:21:36,899 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-10-26 18:21:36,900 INFO  L276        PluginConnector]: CDTParser initialized
[2018-10-26 18:21:36,901 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c
[2018-10-26 18:21:36,965 INFO  L218              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eaeabbbde/9c9c8a4a620d4e8392199a9260eb9961/FLAG7f01e9886
[2018-10-26 18:21:37,506 INFO  L298              CDTParser]: Found 1 translation units.
[2018-10-26 18:21:37,507 INFO  L158              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label45_false-unreach-call_false-termination.c
[2018-10-26 18:21:37,531 INFO  L346              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eaeabbbde/9c9c8a4a620d4e8392199a9260eb9961/FLAG7f01e9886
[2018-10-26 18:21:37,556 INFO  L354              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/eaeabbbde/9c9c8a4a620d4e8392199a9260eb9961
[2018-10-26 18:21:37,568 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-10-26 18:21:37,570 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-10-26 18:21:37,571 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-10-26 18:21:37,572 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-10-26 18:21:37,577 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-10-26 18:21:37,578 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:37" (1/1) ...
[2018-10-26 18:21:37,582 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ed188a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:37, skipping insertion in model container
[2018-10-26 18:21:37,582 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 06:21:37" (1/1) ...
[2018-10-26 18:21:37,592 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2018-10-26 18:21:37,653 INFO  L174         MainTranslator]: Built tables and reachable declarations
[2018-10-26 18:21:38,150 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 18:21:38,155 INFO  L189         MainTranslator]: Completed pre-run
[2018-10-26 18:21:38,275 INFO  L202          PostProcessor]: Analyzing one entry point: main
[2018-10-26 18:21:38,292 INFO  L193         MainTranslator]: Completed translation
[2018-10-26 18:21:38,293 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38 WrapperNode
[2018-10-26 18:21:38,293 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-10-26 18:21:38,294 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-10-26 18:21:38,294 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-10-26 18:21:38,294 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-10-26 18:21:38,304 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,323 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,468 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-10-26 18:21:38,468 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-10-26 18:21:38,468 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-10-26 18:21:38,468 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-10-26 18:21:38,479 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,480 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,484 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,484 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,519 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,548 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,558 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
[2018-10-26 18:21:38,576 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-10-26 18:21:38,576 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-10-26 18:21:38,576 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-10-26 18:21:38,577 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-10-26 18:21:38,577 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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
[2018-10-26 18:21:38,650 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2018-10-26 18:21:38,650 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-10-26 18:21:38,650 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-10-26 18:21:42,070 INFO  L341             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-10-26 18:21:42,070 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:42 BoogieIcfgContainer
[2018-10-26 18:21:42,071 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-10-26 18:21:42,072 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-10-26 18:21:42,072 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-10-26 18:21:42,075 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-10-26 18:21:42,075 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 06:21:37" (1/3) ...
[2018-10-26 18:21:42,076 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b18f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:42, skipping insertion in model container
[2018-10-26 18:21:42,076 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 06:21:38" (2/3) ...
[2018-10-26 18:21:42,076 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b18f67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 06:21:42, skipping insertion in model container
[2018-10-26 18:21:42,077 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 06:21:42" (3/3) ...
[2018-10-26 18:21:42,079 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label45_false-unreach-call_false-termination.c
[2018-10-26 18:21:42,088 INFO  L136   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-10-26 18:21:42,098 INFO  L148   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-10-26 18:21:42,116 INFO  L257      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2018-10-26 18:21:42,153 INFO  L135   ementStrategyFactory]: Using default assertion order modulation
[2018-10-26 18:21:42,154 INFO  L382      AbstractCegarLoop]: Interprodecural is true
[2018-10-26 18:21:42,154 INFO  L383      AbstractCegarLoop]: Hoare is true
[2018-10-26 18:21:42,154 INFO  L384      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-10-26 18:21:42,155 INFO  L385      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-10-26 18:21:42,156 INFO  L386      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-10-26 18:21:42,156 INFO  L387      AbstractCegarLoop]: Difference is false
[2018-10-26 18:21:42,156 INFO  L388      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-10-26 18:21:42,157 INFO  L393      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-10-26 18:21:42,181 INFO  L276                IsEmpty]: Start isEmpty. Operand 228 states.
[2018-10-26 18:21:42,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2018-10-26 18:21:42,193 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:42,194 INFO  L375         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]
[2018-10-26 18:21:42,196 INFO  L424      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:42,203 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:42,203 INFO  L82        PathProgramCache]: Analyzing trace with hash -2030853203, now seen corresponding path program 1 times
[2018-10-26 18:21:42,205 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:42,206 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:42,259 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:42,259 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:42,260 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:42,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:42,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 18:21:42,807 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:42,807 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 18:21:42,813 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 18:21:42,829 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 18:21:42,830 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:42,833 INFO  L87              Difference]: Start difference. First operand 228 states. Second operand 4 states.
[2018-10-26 18:21:45,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:45,811 INFO  L93              Difference]: Finished difference Result 779 states and 1357 transitions.
[2018-10-26 18:21:45,812 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 18:21:45,814 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 83
[2018-10-26 18:21:45,815 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:45,838 INFO  L225             Difference]: With dead ends: 779
[2018-10-26 18:21:45,838 INFO  L226             Difference]: Without dead ends: 544
[2018-10-26 18:21:45,843 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:45,862 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 544 states.
[2018-10-26 18:21:45,909 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370.
[2018-10-26 18:21:45,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 370 states.
[2018-10-26 18:21:45,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 594 transitions.
[2018-10-26 18:21:45,915 INFO  L78                 Accepts]: Start accepts. Automaton has 370 states and 594 transitions. Word has length 83
[2018-10-26 18:21:45,915 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:45,916 INFO  L481      AbstractCegarLoop]: Abstraction has 370 states and 594 transitions.
[2018-10-26 18:21:45,916 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 18:21:45,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 370 states and 594 transitions.
[2018-10-26 18:21:45,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2018-10-26 18:21:45,921 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:45,922 INFO  L375         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]
[2018-10-26 18:21:45,922 INFO  L424      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:45,922 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:45,922 INFO  L82        PathProgramCache]: Analyzing trace with hash -951334590, now seen corresponding path program 1 times
[2018-10-26 18:21:45,923 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:45,923 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:45,924 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:45,924 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:45,925 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:45,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:46,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 18:21:46,154 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:46,155 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-10-26 18:21:46,156 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 18:21:46,157 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 18:21:46,157 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:46,157 INFO  L87              Difference]: Start difference. First operand 370 states and 594 transitions. Second operand 4 states.
[2018-10-26 18:21:48,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:48,180 INFO  L93              Difference]: Finished difference Result 1308 states and 2192 transitions.
[2018-10-26 18:21:48,181 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 18:21:48,181 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 88
[2018-10-26 18:21:48,182 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:48,188 INFO  L225             Difference]: With dead ends: 1308
[2018-10-26 18:21:48,189 INFO  L226             Difference]: Without dead ends: 940
[2018-10-26 18:21:48,192 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:48,193 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 940 states.
[2018-10-26 18:21:48,239 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 937.
[2018-10-26 18:21:48,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 937 states.
[2018-10-26 18:21:48,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1402 transitions.
[2018-10-26 18:21:48,244 INFO  L78                 Accepts]: Start accepts. Automaton has 937 states and 1402 transitions. Word has length 88
[2018-10-26 18:21:48,245 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:48,245 INFO  L481      AbstractCegarLoop]: Abstraction has 937 states and 1402 transitions.
[2018-10-26 18:21:48,245 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 18:21:48,245 INFO  L276                IsEmpty]: Start isEmpty. Operand 937 states and 1402 transitions.
[2018-10-26 18:21:48,253 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2018-10-26 18:21:48,253 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:48,253 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 18:21:48,254 INFO  L424      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:48,254 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:48,254 INFO  L82        PathProgramCache]: Analyzing trace with hash 1564913164, now seen corresponding path program 1 times
[2018-10-26 18:21:48,254 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:48,255 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:48,256 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:48,256 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:48,256 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:48,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:48,399 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 18:21:48,400 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:48,400 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 18:21:48,400 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 18:21:48,401 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 18:21:48,401 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:48,401 INFO  L87              Difference]: Start difference. First operand 937 states and 1402 transitions. Second operand 4 states.
[2018-10-26 18:21:51,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:51,677 INFO  L93              Difference]: Finished difference Result 3611 states and 5470 transitions.
[2018-10-26 18:21:51,678 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 18:21:51,678 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 102
[2018-10-26 18:21:51,678 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:51,691 INFO  L225             Difference]: With dead ends: 3611
[2018-10-26 18:21:51,692 INFO  L226             Difference]: Without dead ends: 2676
[2018-10-26 18:21:51,695 INFO  L605         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
[2018-10-26 18:21:51,697 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2676 states.
[2018-10-26 18:21:51,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 1784.
[2018-10-26 18:21:51,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1784 states.
[2018-10-26 18:21:51,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2573 transitions.
[2018-10-26 18:21:51,763 INFO  L78                 Accepts]: Start accepts. Automaton has 1784 states and 2573 transitions. Word has length 102
[2018-10-26 18:21:51,763 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:51,767 INFO  L481      AbstractCegarLoop]: Abstraction has 1784 states and 2573 transitions.
[2018-10-26 18:21:51,768 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 18:21:51,768 INFO  L276                IsEmpty]: Start isEmpty. Operand 1784 states and 2573 transitions.
[2018-10-26 18:21:51,786 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 105
[2018-10-26 18:21:51,787 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:51,787 INFO  L375         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 18:21:51,787 INFO  L424      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:51,788 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:51,788 INFO  L82        PathProgramCache]: Analyzing trace with hash 891610801, now seen corresponding path program 1 times
[2018-10-26 18:21:51,788 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:51,788 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:51,790 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:51,790 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:51,791 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:51,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:51,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 18:21:51,896 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:51,896 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-10-26 18:21:51,896 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 18:21:51,897 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 18:21:51,897 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 18:21:51,897 INFO  L87              Difference]: Start difference. First operand 1784 states and 2573 transitions. Second operand 3 states.
[2018-10-26 18:21:53,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:53,129 INFO  L93              Difference]: Finished difference Result 4967 states and 7079 transitions.
[2018-10-26 18:21:53,130 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 18:21:53,130 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 104
[2018-10-26 18:21:53,131 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:53,148 INFO  L225             Difference]: With dead ends: 4967
[2018-10-26 18:21:53,149 INFO  L226             Difference]: Without dead ends: 3185
[2018-10-26 18:21:53,152 INFO  L605         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
[2018-10-26 18:21:53,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3185 states.
[2018-10-26 18:21:53,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3185.
[2018-10-26 18:21:53,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3185 states.
[2018-10-26 18:21:53,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4177 transitions.
[2018-10-26 18:21:53,216 INFO  L78                 Accepts]: Start accepts. Automaton has 3185 states and 4177 transitions. Word has length 104
[2018-10-26 18:21:53,217 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:53,217 INFO  L481      AbstractCegarLoop]: Abstraction has 3185 states and 4177 transitions.
[2018-10-26 18:21:53,217 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 18:21:53,217 INFO  L276                IsEmpty]: Start isEmpty. Operand 3185 states and 4177 transitions.
[2018-10-26 18:21:53,223 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2018-10-26 18:21:53,223 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:53,224 INFO  L375         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2018-10-26 18:21:53,224 INFO  L424      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:53,224 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:53,224 INFO  L82        PathProgramCache]: Analyzing trace with hash 803486499, now seen corresponding path program 1 times
[2018-10-26 18:21:53,224 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:53,225 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:53,226 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:53,226 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:53,226 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:53,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:53,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-10-26 18:21:53,487 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:53,488 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 18:21:53,488 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-10-26 18:21:53,488 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-10-26 18:21:53,489 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:53,489 INFO  L87              Difference]: Start difference. First operand 3185 states and 4177 transitions. Second operand 4 states.
[2018-10-26 18:21:54,777 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:54,777 INFO  L93              Difference]: Finished difference Result 7920 states and 10438 transitions.
[2018-10-26 18:21:54,777 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-10-26 18:21:54,777 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 129
[2018-10-26 18:21:54,778 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:54,796 INFO  L225             Difference]: With dead ends: 7920
[2018-10-26 18:21:54,797 INFO  L226             Difference]: Without dead ends: 4737
[2018-10-26 18:21:54,802 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-10-26 18:21:54,805 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4737 states.
[2018-10-26 18:21:54,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4731.
[2018-10-26 18:21:54,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4731 states.
[2018-10-26 18:21:54,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4731 states to 4731 states and 5825 transitions.
[2018-10-26 18:21:54,884 INFO  L78                 Accepts]: Start accepts. Automaton has 4731 states and 5825 transitions. Word has length 129
[2018-10-26 18:21:54,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:54,884 INFO  L481      AbstractCegarLoop]: Abstraction has 4731 states and 5825 transitions.
[2018-10-26 18:21:54,884 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-10-26 18:21:54,885 INFO  L276                IsEmpty]: Start isEmpty. Operand 4731 states and 5825 transitions.
[2018-10-26 18:21:54,891 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2018-10-26 18:21:54,891 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:54,892 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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]
[2018-10-26 18:21:54,892 INFO  L424      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:54,892 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:54,892 INFO  L82        PathProgramCache]: Analyzing trace with hash 529465616, now seen corresponding path program 1 times
[2018-10-26 18:21:54,892 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:54,893 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:54,893 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:54,894 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:54,894 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:54,914 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:55,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-10-26 18:21:55,015 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:55,015 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 18:21:55,016 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 18:21:55,016 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 18:21:55,016 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 18:21:55,017 INFO  L87              Difference]: Start difference. First operand 4731 states and 5825 transitions. Second operand 3 states.
[2018-10-26 18:21:55,955 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:55,955 INFO  L93              Difference]: Finished difference Result 9459 states and 11647 transitions.
[2018-10-26 18:21:55,956 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 18:21:55,956 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 133
[2018-10-26 18:21:55,957 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:55,974 INFO  L225             Difference]: With dead ends: 9459
[2018-10-26 18:21:55,975 INFO  L226             Difference]: Without dead ends: 4730
[2018-10-26 18:21:55,982 INFO  L605         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
[2018-10-26 18:21:55,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4730 states.
[2018-10-26 18:21:56,072 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 4730.
[2018-10-26 18:21:56,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4730 states.
[2018-10-26 18:21:56,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4730 states to 4730 states and 5512 transitions.
[2018-10-26 18:21:56,083 INFO  L78                 Accepts]: Start accepts. Automaton has 4730 states and 5512 transitions. Word has length 133
[2018-10-26 18:21:56,083 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:56,084 INFO  L481      AbstractCegarLoop]: Abstraction has 4730 states and 5512 transitions.
[2018-10-26 18:21:56,084 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 18:21:56,084 INFO  L276                IsEmpty]: Start isEmpty. Operand 4730 states and 5512 transitions.
[2018-10-26 18:21:56,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2018-10-26 18:21:56,092 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:56,092 INFO  L375         BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2018-10-26 18:21:56,093 INFO  L424      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:56,093 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:56,093 INFO  L82        PathProgramCache]: Analyzing trace with hash -1327085542, now seen corresponding path program 1 times
[2018-10-26 18:21:56,093 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:56,094 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:56,095 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:56,095 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:56,095 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:56,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:56,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2018-10-26 18:21:56,258 INFO  L312   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-10-26 18:21:56,258 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-10-26 18:21:56,258 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-10-26 18:21:56,259 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-10-26 18:21:56,259 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 18:21:56,259 INFO  L87              Difference]: Start difference. First operand 4730 states and 5512 transitions. Second operand 3 states.
[2018-10-26 18:21:58,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:21:58,256 INFO  L93              Difference]: Finished difference Result 9317 states and 10855 transitions.
[2018-10-26 18:21:58,257 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-10-26 18:21:58,257 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 142
[2018-10-26 18:21:58,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:21:58,279 INFO  L225             Difference]: With dead ends: 9317
[2018-10-26 18:21:58,279 INFO  L226             Difference]: Without dead ends: 4157
[2018-10-26 18:21:58,285 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-10-26 18:21:58,289 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4157 states.
[2018-10-26 18:21:58,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 4155.
[2018-10-26 18:21:58,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4155 states.
[2018-10-26 18:21:58,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 4718 transitions.
[2018-10-26 18:21:58,350 INFO  L78                 Accepts]: Start accepts. Automaton has 4155 states and 4718 transitions. Word has length 142
[2018-10-26 18:21:58,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:21:58,350 INFO  L481      AbstractCegarLoop]: Abstraction has 4155 states and 4718 transitions.
[2018-10-26 18:21:58,350 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-10-26 18:21:58,350 INFO  L276                IsEmpty]: Start isEmpty. Operand 4155 states and 4718 transitions.
[2018-10-26 18:21:58,356 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2018-10-26 18:21:58,357 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:21:58,357 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 18:21:58,357 INFO  L424      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:21:58,357 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:21:58,358 INFO  L82        PathProgramCache]: Analyzing trace with hash -1326650387, now seen corresponding path program 1 times
[2018-10-26 18:21:58,358 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:21:58,358 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:21:58,359 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:58,359 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:58,359 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:21:58,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:58,702 INFO  L134       CoverageAnalysis]: Checked inductivity of 102 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2018-10-26 18:21:58,703 INFO  L300   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-10-26 18:21:58,703 INFO  L225   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-10-26 18:21:58,716 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:21:58,791 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-10-26 18:21:58,820 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-10-26 18:21:59,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 102 backedges. 96 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-10-26 18:21:59,470 INFO  L312   seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-10-26 18:21:59,471 INFO  L327   seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10
[2018-10-26 18:21:59,471 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-10-26 18:21:59,472 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-10-26 18:21:59,472 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110
[2018-10-26 18:21:59,473 INFO  L87              Difference]: Start difference. First operand 4155 states and 4718 transitions. Second operand 11 states.
[2018-10-26 18:21:59,798 WARN  L179               SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13
[2018-10-26 18:22:01,976 WARN  L179               SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 14
[2018-10-26 18:22:06,573 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-10-26 18:22:06,573 INFO  L93              Difference]: Finished difference Result 10677 states and 11947 transitions.
[2018-10-26 18:22:06,575 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2018-10-26 18:22:06,575 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 147
[2018-10-26 18:22:06,575 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-10-26 18:22:06,593 INFO  L225             Difference]: With dead ends: 10677
[2018-10-26 18:22:06,593 INFO  L226             Difference]: Without dead ends: 4504
[2018-10-26 18:22:06,600 INFO  L605         BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600
[2018-10-26 18:22:06,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4504 states.
[2018-10-26 18:22:06,672 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 3701.
[2018-10-26 18:22:06,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3701 states.
[2018-10-26 18:22:06,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3701 states to 3701 states and 3900 transitions.
[2018-10-26 18:22:06,678 INFO  L78                 Accepts]: Start accepts. Automaton has 3701 states and 3900 transitions. Word has length 147
[2018-10-26 18:22:06,678 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-10-26 18:22:06,678 INFO  L481      AbstractCegarLoop]: Abstraction has 3701 states and 3900 transitions.
[2018-10-26 18:22:06,678 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-10-26 18:22:06,678 INFO  L276                IsEmpty]: Start isEmpty. Operand 3701 states and 3900 transitions.
[2018-10-26 18:22:06,684 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2018-10-26 18:22:06,684 INFO  L367         BasicCegarLoop]: Found error trace
[2018-10-26 18:22:06,684 INFO  L375         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-10-26 18:22:06,685 INFO  L424      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2018-10-26 18:22:06,685 INFO  L141       PredicateUnifier]: Initialized classic predicate unifier
[2018-10-26 18:22:06,685 INFO  L82        PathProgramCache]: Analyzing trace with hash 1684837412, now seen corresponding path program 1 times
[2018-10-26 18:22:06,685 INFO  L225   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-10-26 18:22:06,685 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-10-26 18:22:06,686 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:22:06,687 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-10-26 18:22:06,687 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-10-26 18:22:06,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 18:22:06,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-10-26 18:22:06,880 INFO  L442         BasicCegarLoop]: Counterexample might be feasible
[2018-10-26 18:22:07,050 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 06:22:07 BoogieIcfgContainer
[2018-10-26 18:22:07,050 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-10-26 18:22:07,051 INFO  L168              Benchmark]: Toolchain (without parser) took 29482.46 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -285.3 MB). Peak memory consumption was 760.6 MB. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,053 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,054 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 721.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,054 INFO  L168              Benchmark]: Boogie Procedure Inliner took 174.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,056 INFO  L168              Benchmark]: Boogie Preprocessor took 107.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,057 INFO  L168              Benchmark]: RCFGBuilder took 3494.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,058 INFO  L168              Benchmark]: TraceAbstraction took 24978.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 291.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 398.3 MB). Peak memory consumption was 689.3 MB. Max. memory is 7.1 GB.
[2018-10-26 18:22:07,065 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 721.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB.
 * Boogie Procedure Inliner took 174.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -831.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 107.75 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * RCFGBuilder took 3494.55 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.2 MB). Peak memory consumption was 116.2 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 24978.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 291.0 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 398.3 MB). Peak memory consumption was 689.3 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 418]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L7]                int a= 1;
[L8]                int e= 5;
[L9]                int d= 4;
[L10]               int f= 6;
[L11]               int c= 3;
[L14]               int u = 21;
[L15]               int v = 22;
[L16]               int w = 23;
[L17]               int x = 24;
[L18]               int y = 25;
[L19]               int z = 26;
[L22]               int a25 = 0;
[L23]               int a11 = 0;
[L24]               int a28 = 7;
[L25]               int a19 = 1;
[L26]               int a21 = 1;
[L27]               int a17 = 8;
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L603]              int output = -1;
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L606]  COND TRUE   1
[L609]              int input;
[L610]              input = __VERIFIER_nondet_int()
[L611]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L614]  CALL, EXPR  calculate_output(input)
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L38]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L42]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L47]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L50]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L59]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L74]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L82]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L91]   COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L95]   COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L99]   COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L106]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L113]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L130]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L134]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L139]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L143]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L154]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L159]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L179]  COND FALSE  !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L185]  COND FALSE  !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L187]  COND FALSE  !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L191]  COND FALSE  !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L198]  COND FALSE  !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L202]  COND FALSE  !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L212]  COND FALSE  !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L215]  COND FALSE  !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L225]  COND FALSE  !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L232]  COND FALSE  !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L234]  COND TRUE   ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))
[L235]              a28 = 9
[L236]  RET         return 23;
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  EXPR        calculate_output(input)
[L614]              output = calculate_output(input)
[L606]  COND TRUE   1
[L609]              int input;
[L610]              input = __VERIFIER_nondet_int()
[L611]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L614]  CALL, EXPR  calculate_output(input)
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L38]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L42]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L47]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L50]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L59]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L74]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L82]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L91]   COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L95]   COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L99]   COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L106]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L113]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L130]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L134]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L139]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L143]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L154]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L159]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L179]  COND FALSE  !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L185]  COND FALSE  !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L187]  COND FALSE  !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L191]  COND FALSE  !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L198]  COND FALSE  !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L202]  COND FALSE  !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L212]  COND FALSE  !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L215]  COND FALSE  !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L225]  COND FALSE  !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L232]  COND FALSE  !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L234]  COND FALSE  !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L237]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L248]  COND FALSE  !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L253]  COND FALSE  !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L259]  COND FALSE  !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L261]  COND FALSE  !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L276]  COND FALSE  !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L280]  COND FALSE  !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L283]  COND FALSE  !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L291]  COND FALSE  !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L293]  COND FALSE  !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L297]  COND FALSE  !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L309]  COND FALSE  !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L314]  COND FALSE  !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L328]  COND FALSE  !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L331]  COND FALSE  !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L337]  COND FALSE  !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L349]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L354]  COND FALSE  !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L361]  COND FALSE  !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L368]  COND FALSE  !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L375]  COND FALSE  !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L378]  COND FALSE  !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L380]  COND FALSE  !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L389]  COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L394]  COND TRUE   (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))
[L395]              a19 = 0
[L396]              a28 = 7
[L397]  RET         return 25;
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  EXPR        calculate_output(input)
[L614]              output = calculate_output(input)
[L606]  COND TRUE   1
[L609]              int input;
[L610]              input = __VERIFIER_nondet_int()
[L611]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L614]  CALL, EXPR  calculate_output(input)
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L38]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L42]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L47]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L50]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L59]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L74]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L82]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L91]   COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L95]   COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L99]   COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L106]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L113]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L130]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L134]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L139]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L143]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a=1, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND TRUE   ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))
[L149]              a11 = 1
[L150]              a19 = 1
[L151]              a28 = 10
[L152]              a25 = 1
[L153]  RET         return -1;
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  EXPR        calculate_output(input)
[L614]              output = calculate_output(input)
[L606]  COND TRUE   1
[L609]              int input;
[L610]              input = __VERIFIER_nondet_int()
[L611]  COND FALSE  !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6))
[L614]  CALL        calculate_output(input)
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L35]   COND FALSE  !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L38]   COND FALSE  !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L42]   COND FALSE  !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L47]   COND FALSE  !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L50]   COND FALSE  !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L54]   COND FALSE  !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L59]   COND FALSE  !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L65]   COND FALSE  !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L69]   COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L74]   COND FALSE  !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L82]   COND FALSE  !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L91]   COND FALSE  !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3))))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L95]   COND FALSE  !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L99]   COND FALSE  !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L106]  COND FALSE  !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L113]  COND FALSE  !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3)))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L123]  COND FALSE  !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L130]  COND FALSE  !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L134]  COND FALSE  !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L139]  COND FALSE  !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L143]  COND FALSE  !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L148]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L154]  COND FALSE  !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L159]  COND FALSE  !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L169]  COND FALSE  !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L175]  COND FALSE  !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L179]  COND FALSE  !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L185]  COND FALSE  !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L187]  COND FALSE  !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L189]  COND FALSE  !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L191]  COND FALSE  !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L194]  COND FALSE  !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L198]  COND FALSE  !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L202]  COND FALSE  !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L212]  COND FALSE  !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L215]  COND FALSE  !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L218]  COND FALSE  !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L223]  COND FALSE  !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L225]  COND FALSE  !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L232]  COND FALSE  !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L234]  COND FALSE  !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L237]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L248]  COND FALSE  !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L253]  COND FALSE  !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L259]  COND FALSE  !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L261]  COND FALSE  !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L276]  COND FALSE  !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1))))))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L280]  COND FALSE  !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L283]  COND FALSE  !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L286]  COND FALSE  !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L291]  COND FALSE  !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L293]  COND FALSE  !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L297]  COND FALSE  !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L309]  COND FALSE  !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L314]  COND FALSE  !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L328]  COND FALSE  !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L331]  COND FALSE  !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L337]  COND FALSE  !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L349]  COND FALSE  !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L354]  COND FALSE  !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L361]  COND FALSE  !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L368]  COND FALSE  !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L375]  COND FALSE  !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L378]  COND FALSE  !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L380]  COND FALSE  !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L389]  COND FALSE  !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L394]  COND FALSE  !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L398]  COND FALSE  !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L402]  COND FALSE  !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L404]  COND FALSE  !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L407]  COND FALSE  !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L409]  COND FALSE  !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1)))))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L414]  COND FALSE  !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L417]  COND TRUE   ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8))
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L418]              __VERIFIER_error()
        VAL         [a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, 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, 228 locations, 1 error locations. UNSAFE Result, 24.9s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1396 SDtfs, 4772 SDslu, 722 SDs, 0 SdLazy, 6725 SolverSat, 1782 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4731occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 1880 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1066 ConstructedInterpolants, 0 QuantifiedInterpolants, 382743 SizeOfPredicates, 6 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 514/523 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...