java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c


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


This is Ultimate 0.1.23-dd2f093
[2018-07-23 23:44:57,908 INFO  L170        SettingsManager]: Resetting all preferences to default values...
[2018-07-23 23:44:57,910 INFO  L174        SettingsManager]: Resetting UltimateCore preferences to default values
[2018-07-23 23:44:57,925 INFO  L177        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-07-23 23:44:57,925 INFO  L174        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-07-23 23:44:57,926 INFO  L174        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-07-23 23:44:57,927 INFO  L174        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-07-23 23:44:57,929 INFO  L174        SettingsManager]: Resetting LassoRanker preferences to default values
[2018-07-23 23:44:57,930 INFO  L174        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-07-23 23:44:57,931 INFO  L174        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-07-23 23:44:57,932 INFO  L177        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-07-23 23:44:57,932 INFO  L174        SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-07-23 23:44:57,933 INFO  L174        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-07-23 23:44:57,934 INFO  L174        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-07-23 23:44:57,935 INFO  L174        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-07-23 23:44:57,936 INFO  L174        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-07-23 23:44:57,937 INFO  L174        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-07-23 23:44:57,938 INFO  L174        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-07-23 23:44:57,940 INFO  L174        SettingsManager]: Resetting CodeCheck preferences to default values
[2018-07-23 23:44:57,942 INFO  L174        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-07-23 23:44:57,943 INFO  L174        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-07-23 23:44:57,944 INFO  L174        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-07-23 23:44:57,946 INFO  L177        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-07-23 23:44:57,947 INFO  L177        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-07-23 23:44:57,947 INFO  L174        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-07-23 23:44:57,948 INFO  L174        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-07-23 23:44:57,949 INFO  L174        SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-07-23 23:44:57,950 INFO  L174        SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-07-23 23:44:57,950 INFO  L174        SettingsManager]: Resetting Witness Printer preferences to default values
[2018-07-23 23:44:57,951 INFO  L177        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-07-23 23:44:57,952 INFO  L174        SettingsManager]: Resetting CDTParser preferences to default values
[2018-07-23 23:44:57,952 INFO  L177        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-07-23 23:44:57,953 INFO  L177        SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-07-23 23:44:57,953 INFO  L174        SettingsManager]: Resetting SmtParser preferences to default values
[2018-07-23 23:44:57,954 INFO  L174        SettingsManager]: Resetting Witness Parser preferences to default values
[2018-07-23 23:44:57,955 INFO  L181        SettingsManager]: Finished resetting all preferences to default values...
[2018-07-23 23:44:57,955 INFO  L98         SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf
[2018-07-23 23:44:57,970 INFO  L110        SettingsManager]: Loading preferences was successful
[2018-07-23 23:44:57,970 INFO  L112        SettingsManager]: Preferences different from defaults after loading the file:
[2018-07-23 23:44:57,971 INFO  L131        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-07-23 23:44:57,971 INFO  L133        SettingsManager]:  * to procedures, called more than once=true
[2018-07-23 23:44:57,972 INFO  L131        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-07-23 23:44:57,972 INFO  L133        SettingsManager]:  * Create parallel compositions if possible=false
[2018-07-23 23:44:57,972 INFO  L133        SettingsManager]:  * Use SBE=true
[2018-07-23 23:44:57,972 INFO  L131        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-07-23 23:44:57,973 INFO  L133        SettingsManager]:  * Overapproximate operations on floating types=true
[2018-07-23 23:44:57,973 INFO  L133        SettingsManager]:  * Check division by zero=IGNORE
[2018-07-23 23:44:57,973 INFO  L133        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2018-07-23 23:44:57,973 INFO  L133        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-07-23 23:44:57,973 INFO  L133        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2018-07-23 23:44:57,974 INFO  L133        SettingsManager]:  * Check if freed pointer was valid=false
[2018-07-23 23:44:57,974 INFO  L133        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2018-07-23 23:44:57,974 INFO  L131        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-07-23 23:44:57,974 INFO  L133        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2018-07-23 23:44:57,974 INFO  L133        SettingsManager]:  * To the following directory=./dump/
[2018-07-23 23:44:57,975 INFO  L133        SettingsManager]:  * SMT solver=External_DefaultMode
[2018-07-23 23:44:57,975 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-07-23 23:44:57,975 INFO  L131        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-07-23 23:44:57,975 INFO  L133        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2018-07-23 23:44:57,975 INFO  L133        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-07-23 23:44:57,976 INFO  L133        SettingsManager]:  * Trace refinement strategy=CAMEL
[2018-07-23 23:44:57,976 INFO  L133        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2018-07-23 23:44:57,976 INFO  L133        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-07-23 23:44:57,976 INFO  L133        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-07-23 23:44:57,976 INFO  L133        SettingsManager]:  * To the following directory=dump/
[2018-07-23 23:44:58,039 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2018-07-23 23:44:58,056 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-07-23 23:44:58,060 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-07-23 23:44:58,061 INFO  L271        PluginConnector]: Initializing CDTParser...
[2018-07-23 23:44:58,061 INFO  L276        PluginConnector]: CDTParser initialized
[2018-07-23 23:44:58,062 INFO  L418   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c
[2018-07-23 23:44:58,397 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781ca7975/1d8de443ee244883b6f18fc67641b564/FLAGe2556db83
[2018-07-23 23:44:58,678 INFO  L276              CDTParser]: Found 1 translation units.
[2018-07-23 23:44:58,679 INFO  L158              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label44_false-unreach-call_false-termination.c
[2018-07-23 23:44:58,695 INFO  L324              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781ca7975/1d8de443ee244883b6f18fc67641b564/FLAGe2556db83
[2018-07-23 23:44:58,712 INFO  L332              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/781ca7975/1d8de443ee244883b6f18fc67641b564
[2018-07-23 23:44:58,724 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-07-23 23:44:58,727 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2018-07-23 23:44:58,731 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-07-23 23:44:58,731 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-07-23 23:44:58,738 INFO  L276        PluginConnector]: CACSL2BoogieTranslator initialized
[2018-07-23 23:44:58,739 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:44:58" (1/1) ...
[2018-07-23 23:44:58,743 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77928ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:58, skipping insertion in model container
[2018-07-23 23:44:58,743 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 11:44:58" (1/1) ...
[2018-07-23 23:44:58,973 INFO  L179           PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode 
[2018-07-23 23:44:59,295 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-07-23 23:44:59,313 INFO  L422         MainDispatcher]: Starting main dispatcher in SV-COMP mode 
[2018-07-23 23:44:59,431 INFO  L175          PostProcessor]: Settings: Checked method=main
[2018-07-23 23:44:59,489 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59 WrapperNode
[2018-07-23 23:44:59,489 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-07-23 23:44:59,492 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-07-23 23:44:59,492 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-07-23 23:44:59,493 INFO  L276        PluginConnector]: Boogie Procedure Inliner initialized
[2018-07-23 23:44:59,503 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,524 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,580 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-07-23 23:44:59,581 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-07-23 23:44:59,581 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2018-07-23 23:44:59,581 INFO  L276        PluginConnector]: Boogie Preprocessor initialized
[2018-07-23 23:44:59,595 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,595 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,608 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,609 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,651 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,671 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,679 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
[2018-07-23 23:44:59,685 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-07-23 23:44:59,686 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-07-23 23:44:59,686 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2018-07-23 23:44:59,686 INFO  L276        PluginConnector]: RCFGBuilder initialized
[2018-07-23 23:44:59,688 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-07-23 23:44:59,906 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2018-07-23 23:44:59,906 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-07-23 23:44:59,906 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-07-23 23:45:03,323 INFO  L261             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-07-23 23:45:03,324 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:45:03 BoogieIcfgContainer
[2018-07-23 23:45:03,325 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-07-23 23:45:03,326 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-07-23 23:45:03,326 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2018-07-23 23:45:03,329 INFO  L276        PluginConnector]: TraceAbstraction initialized
[2018-07-23 23:45:03,330 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 11:44:58" (1/3) ...
[2018-07-23 23:45:03,331 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b090223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:45:03, skipping insertion in model container
[2018-07-23 23:45:03,331 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 11:44:59" (2/3) ...
[2018-07-23 23:45:03,331 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b090223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 11:45:03, skipping insertion in model container
[2018-07-23 23:45:03,331 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 11:45:03" (3/3) ...
[2018-07-23 23:45:03,333 INFO  L112   eAbstractionObserver]: Analyzing ICFG Problem02_label44_false-unreach-call_false-termination.c
[2018-07-23 23:45:03,344 INFO  L132   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-07-23 23:45:03,354 INFO  L144   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2018-07-23 23:45:03,410 INFO  L128   ementStrategyFactory]: Using default assertion order modulation
[2018-07-23 23:45:03,411 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2018-07-23 23:45:03,411 INFO  L374      AbstractCegarLoop]: Hoare is true
[2018-07-23 23:45:03,413 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-07-23 23:45:03,414 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2018-07-23 23:45:03,414 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-07-23 23:45:03,414 INFO  L378      AbstractCegarLoop]: Difference is false
[2018-07-23 23:45:03,414 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-07-23 23:45:03,414 INFO  L384      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-07-23 23:45:03,445 INFO  L276                IsEmpty]: Start isEmpty. Operand 228 states.
[2018-07-23 23:45:03,457 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2018-07-23 23:45:03,457 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:03,458 INFO  L353         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:03,459 INFO  L414      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:03,463 INFO  L82        PathProgramCache]: Analyzing trace with hash -1303457179, now seen corresponding path program 1 times
[2018-07-23 23:45:03,465 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:03,465 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:03,512 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:03,513 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:03,513 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:03,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:04,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 23:45:04,051 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:04,052 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-07-23 23:45:04,057 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-07-23 23:45:04,073 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-07-23 23:45:04,074 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-07-23 23:45:04,077 INFO  L87              Difference]: Start difference. First operand 228 states. Second operand 4 states.
[2018-07-23 23:45:07,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:07,338 INFO  L93              Difference]: Finished difference Result 779 states and 1357 transitions.
[2018-07-23 23:45:07,339 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-07-23 23:45:07,341 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 89
[2018-07-23 23:45:07,342 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:07,362 INFO  L225             Difference]: With dead ends: 779
[2018-07-23 23:45:07,362 INFO  L226             Difference]: Without dead ends: 544
[2018-07-23 23:45:07,368 INFO  L573         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-07-23 23:45:07,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 544 states.
[2018-07-23 23:45:07,441 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 370.
[2018-07-23 23:45:07,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 370 states.
[2018-07-23 23:45:07,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 594 transitions.
[2018-07-23 23:45:07,447 INFO  L78                 Accepts]: Start accepts. Automaton has 370 states and 594 transitions. Word has length 89
[2018-07-23 23:45:07,447 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:07,448 INFO  L471      AbstractCegarLoop]: Abstraction has 370 states and 594 transitions.
[2018-07-23 23:45:07,448 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-07-23 23:45:07,448 INFO  L276                IsEmpty]: Start isEmpty. Operand 370 states and 594 transitions.
[2018-07-23 23:45:07,452 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2018-07-23 23:45:07,453 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:07,453 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:07,453 INFO  L414      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:07,454 INFO  L82        PathProgramCache]: Analyzing trace with hash 1631040570, now seen corresponding path program 1 times
[2018-07-23 23:45:07,454 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:07,454 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:07,455 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:07,455 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:07,455 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:07,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:07,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 23:45:07,671 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:07,672 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-07-23 23:45:07,673 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-07-23 23:45:07,674 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-07-23 23:45:07,674 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-07-23 23:45:07,674 INFO  L87              Difference]: Start difference. First operand 370 states and 594 transitions. Second operand 3 states.
[2018-07-23 23:45:08,790 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:08,790 INFO  L93              Difference]: Finished difference Result 1029 states and 1700 transitions.
[2018-07-23 23:45:08,791 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-23 23:45:08,792 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 94
[2018-07-23 23:45:08,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:08,801 INFO  L225             Difference]: With dead ends: 1029
[2018-07-23 23:45:08,801 INFO  L226             Difference]: Without dead ends: 661
[2018-07-23 23:45:08,807 INFO  L573         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-07-23 23:45:08,808 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 661 states.
[2018-07-23 23:45:08,853 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 656.
[2018-07-23 23:45:08,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 656 states.
[2018-07-23 23:45:08,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1012 transitions.
[2018-07-23 23:45:08,857 INFO  L78                 Accepts]: Start accepts. Automaton has 656 states and 1012 transitions. Word has length 94
[2018-07-23 23:45:08,858 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:08,858 INFO  L471      AbstractCegarLoop]: Abstraction has 656 states and 1012 transitions.
[2018-07-23 23:45:08,858 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-07-23 23:45:08,858 INFO  L276                IsEmpty]: Start isEmpty. Operand 656 states and 1012 transitions.
[2018-07-23 23:45:08,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2018-07-23 23:45:08,863 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:08,863 INFO  L353         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:08,864 INFO  L414      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:08,864 INFO  L82        PathProgramCache]: Analyzing trace with hash -454057239, now seen corresponding path program 1 times
[2018-07-23 23:45:08,864 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:08,864 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:08,865 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:08,865 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:08,866 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:08,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:08,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 23:45:08,953 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:08,953 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-07-23 23:45:08,954 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-07-23 23:45:08,954 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-07-23 23:45:08,954 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-07-23 23:45:08,955 INFO  L87              Difference]: Start difference. First operand 656 states and 1012 transitions. Second operand 3 states.
[2018-07-23 23:45:11,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:11,161 INFO  L93              Difference]: Finished difference Result 1874 states and 2935 transitions.
[2018-07-23 23:45:11,162 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-23 23:45:11,162 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 100
[2018-07-23 23:45:11,162 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:11,170 INFO  L225             Difference]: With dead ends: 1874
[2018-07-23 23:45:11,170 INFO  L226             Difference]: Without dead ends: 1220
[2018-07-23 23:45:11,172 INFO  L573         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-07-23 23:45:11,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1220 states.
[2018-07-23 23:45:11,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1220.
[2018-07-23 23:45:11,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1220 states.
[2018-07-23 23:45:11,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 1774 transitions.
[2018-07-23 23:45:11,238 INFO  L78                 Accepts]: Start accepts. Automaton has 1220 states and 1774 transitions. Word has length 100
[2018-07-23 23:45:11,239 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:11,239 INFO  L471      AbstractCegarLoop]: Abstraction has 1220 states and 1774 transitions.
[2018-07-23 23:45:11,239 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-07-23 23:45:11,239 INFO  L276                IsEmpty]: Start isEmpty. Operand 1220 states and 1774 transitions.
[2018-07-23 23:45:11,247 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2018-07-23 23:45:11,248 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:11,248 INFO  L353         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, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:11,253 INFO  L414      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:11,255 INFO  L82        PathProgramCache]: Analyzing trace with hash -568174204, now seen corresponding path program 1 times
[2018-07-23 23:45:11,255 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:11,255 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:11,256 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:11,257 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:11,257 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:11,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:11,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-07-23 23:45:11,439 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:11,439 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-07-23 23:45:11,439 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-07-23 23:45:11,440 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-07-23 23:45:11,440 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-07-23 23:45:11,440 INFO  L87              Difference]: Start difference. First operand 1220 states and 1774 transitions. Second operand 5 states.
[2018-07-23 23:45:13,346 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:13,347 INFO  L93              Difference]: Finished difference Result 4415 states and 6406 transitions.
[2018-07-23 23:45:13,347 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-07-23 23:45:13,348 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 108
[2018-07-23 23:45:13,348 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:13,365 INFO  L225             Difference]: With dead ends: 4415
[2018-07-23 23:45:13,365 INFO  L226             Difference]: Without dead ends: 3054
[2018-07-23 23:45:13,368 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-07-23 23:45:13,370 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3054 states.
[2018-07-23 23:45:13,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 3048.
[2018-07-23 23:45:13,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3048 states.
[2018-07-23 23:45:13,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3878 transitions.
[2018-07-23 23:45:13,436 INFO  L78                 Accepts]: Start accepts. Automaton has 3048 states and 3878 transitions. Word has length 108
[2018-07-23 23:45:13,436 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:13,436 INFO  L471      AbstractCegarLoop]: Abstraction has 3048 states and 3878 transitions.
[2018-07-23 23:45:13,436 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-07-23 23:45:13,437 INFO  L276                IsEmpty]: Start isEmpty. Operand 3048 states and 3878 transitions.
[2018-07-23 23:45:13,441 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2018-07-23 23:45:13,441 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:13,441 INFO  L353         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:13,441 INFO  L414      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:13,442 INFO  L82        PathProgramCache]: Analyzing trace with hash -1466620442, now seen corresponding path program 1 times
[2018-07-23 23:45:13,442 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:13,442 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:13,443 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:13,443 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:13,444 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:13,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:13,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2018-07-23 23:45:13,819 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:13,819 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-07-23 23:45:13,820 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-07-23 23:45:13,820 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-07-23 23:45:13,820 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-07-23 23:45:13,821 INFO  L87              Difference]: Start difference. First operand 3048 states and 3878 transitions. Second operand 4 states.
[2018-07-23 23:45:15,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:15,377 INFO  L93              Difference]: Finished difference Result 8627 states and 10839 transitions.
[2018-07-23 23:45:15,377 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2018-07-23 23:45:15,378 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 118
[2018-07-23 23:45:15,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:15,391 INFO  L225             Difference]: With dead ends: 8627
[2018-07-23 23:45:15,391 INFO  L226             Difference]: Without dead ends: 2577
[2018-07-23 23:45:15,398 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-07-23 23:45:15,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2577 states.
[2018-07-23 23:45:15,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2577.
[2018-07-23 23:45:15,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2577 states.
[2018-07-23 23:45:15,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2577 states to 2577 states and 2956 transitions.
[2018-07-23 23:45:15,443 INFO  L78                 Accepts]: Start accepts. Automaton has 2577 states and 2956 transitions. Word has length 118
[2018-07-23 23:45:15,443 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:15,444 INFO  L471      AbstractCegarLoop]: Abstraction has 2577 states and 2956 transitions.
[2018-07-23 23:45:15,444 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-07-23 23:45:15,444 INFO  L276                IsEmpty]: Start isEmpty. Operand 2577 states and 2956 transitions.
[2018-07-23 23:45:15,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2018-07-23 23:45:15,448 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:15,448 INFO  L353         BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-07-23 23:45:15,448 INFO  L414      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:15,449 INFO  L82        PathProgramCache]: Analyzing trace with hash 1583054611, now seen corresponding path program 1 times
[2018-07-23 23:45:15,449 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:15,449 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:15,450 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:15,450 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:15,450 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:15,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:15,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 50 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2018-07-23 23:45:15,542 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-07-23 23:45:15,542 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-07-23 23:45:15,542 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-07-23 23:45:15,543 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-07-23 23:45:15,543 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-07-23 23:45:15,543 INFO  L87              Difference]: Start difference. First operand 2577 states and 2956 transitions. Second operand 3 states.
[2018-07-23 23:45:16,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:16,524 INFO  L93              Difference]: Finished difference Result 5858 states and 6767 transitions.
[2018-07-23 23:45:16,527 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-23 23:45:16,528 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 126
[2018-07-23 23:45:16,528 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:16,538 INFO  L225             Difference]: With dead ends: 5858
[2018-07-23 23:45:16,539 INFO  L226             Difference]: Without dead ends: 2716
[2018-07-23 23:45:16,543 INFO  L573         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-07-23 23:45:16,545 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2716 states.
[2018-07-23 23:45:16,580 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716.
[2018-07-23 23:45:16,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2716 states.
[2018-07-23 23:45:16,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 2929 transitions.
[2018-07-23 23:45:16,586 INFO  L78                 Accepts]: Start accepts. Automaton has 2716 states and 2929 transitions. Word has length 126
[2018-07-23 23:45:16,586 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:16,586 INFO  L471      AbstractCegarLoop]: Abstraction has 2716 states and 2929 transitions.
[2018-07-23 23:45:16,586 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-07-23 23:45:16,587 INFO  L276                IsEmpty]: Start isEmpty. Operand 2716 states and 2929 transitions.
[2018-07-23 23:45:16,590 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2018-07-23 23:45:16,591 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:16,591 INFO  L353         BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2018-07-23 23:45:16,591 INFO  L414      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:16,592 INFO  L82        PathProgramCache]: Analyzing trace with hash -1307286326, now seen corresponding path program 1 times
[2018-07-23 23:45:16,592 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:16,592 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:16,593 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:16,593 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:16,593 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:16,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:16,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2018-07-23 23:45:16,780 INFO  L297   seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-07-23 23:45:16,781 INFO  L221   ckRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-07-23 23:45:16,790 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:16,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-07-23 23:45:16,907 INFO  L273         TraceCheckSpWp]: Computing forward predicates...
[2018-07-23 23:45:17,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 95 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2018-07-23 23:45:17,116 INFO  L309   seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-07-23 23:45:17,116 INFO  L324   seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2018-07-23 23:45:17,117 INFO  L450      AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-07-23 23:45:17,117 INFO  L132   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-07-23 23:45:17,117 INFO  L133   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-07-23 23:45:17,118 INFO  L87              Difference]: Start difference. First operand 2716 states and 2929 transitions. Second operand 5 states.
[2018-07-23 23:45:18,333 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-07-23 23:45:18,333 INFO  L93              Difference]: Finished difference Result 4711 states and 5077 transitions.
[2018-07-23 23:45:18,333 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2018-07-23 23:45:18,334 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 151
[2018-07-23 23:45:18,334 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2018-07-23 23:45:18,341 INFO  L225             Difference]: With dead ends: 4711
[2018-07-23 23:45:18,341 INFO  L226             Difference]: Without dead ends: 1853
[2018-07-23 23:45:18,345 INFO  L573         BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2018-07-23 23:45:18,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1853 states.
[2018-07-23 23:45:18,378 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853.
[2018-07-23 23:45:18,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1853 states.
[2018-07-23 23:45:18,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 1967 transitions.
[2018-07-23 23:45:18,383 INFO  L78                 Accepts]: Start accepts. Automaton has 1853 states and 1967 transitions. Word has length 151
[2018-07-23 23:45:18,384 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2018-07-23 23:45:18,384 INFO  L471      AbstractCegarLoop]: Abstraction has 1853 states and 1967 transitions.
[2018-07-23 23:45:18,384 INFO  L472      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-07-23 23:45:18,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 1853 states and 1967 transitions.
[2018-07-23 23:45:18,388 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2018-07-23 23:45:18,388 INFO  L345         BasicCegarLoop]: Found error trace
[2018-07-23 23:45:18,388 INFO  L353         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2018-07-23 23:45:18,388 INFO  L414      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationERROR_FUNCTION]===
[2018-07-23 23:45:18,389 INFO  L82        PathProgramCache]: Analyzing trace with hash 1195362345, now seen corresponding path program 1 times
[2018-07-23 23:45:18,389 INFO  L221   ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-07-23 23:45:18,389 INFO  L69    tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-07-23 23:45:18,390 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:18,390 INFO  L103   rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-07-23 23:45:18,390 INFO  L119   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2018-07-23 23:45:18,423 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-07-23 23:45:18,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2018-07-23 23:45:18,511 INFO  L419         BasicCegarLoop]: Counterexample might be feasible
[2018-07-23 23:45:18,687 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 11:45:18 BoogieIcfgContainer
[2018-07-23 23:45:18,688 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-07-23 23:45:18,689 INFO  L168              Benchmark]: Toolchain (without parser) took 19964.09 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 918.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -161.5 MB). Peak memory consumption was 757.0 MB. Max. memory is 7.1 GB.
[2018-07-23 23:45:18,691 INFO  L168              Benchmark]: CDTParser took 0.22 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-07-23 23:45:18,692 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 758.98 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-07-23 23:45:18,694 INFO  L168              Benchmark]: Boogie Procedure Inliner took 88.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-07-23 23:45:18,695 INFO  L168              Benchmark]: Boogie Preprocessor took 104.31 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
[2018-07-23 23:45:18,695 INFO  L168              Benchmark]: RCFGBuilder took 3639.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.0 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB.
[2018-07-23 23:45:18,697 INFO  L168              Benchmark]: TraceAbstraction took 15362.17 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 525.1 MB). Peak memory consumption was 687.1 MB. Max. memory is 7.1 GB.
[2018-07-23 23:45:18,705 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.22 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 758.98 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 88.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 104.31 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 3639.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 756.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -729.0 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 15362.17 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 162.0 MB). Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 525.1 MB). Peak memory consumption was 687.1 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 436]: 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 TRUE   ((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))
[L51]               a28 = 11
[L52]               a25 = 1
[L53]   RET         return 26;
        VAL         [a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, 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=1, a28=11, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L349]  COND TRUE   (!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))
[L350]              a28 = 9
[L351]              a11 = 1
[L352]              a25 = 0
[L353]  RET         return -1;
        VAL         [a=1, a11=1, 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        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=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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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 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=0, a28=9, 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=0, a28=9, 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=0, a28=9, 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=0, a28=9, 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=0, a28=9, 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=0, a28=9, 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=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L417]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=1, 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]
[L420]  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=0, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L423]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==7))&&(a19==1))&&(a21==1))&&(a17==7)))
        VAL         [a=1, a11=1, 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]
[L426]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8)))
        VAL         [a=1, a11=1, 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]
[L429]  COND FALSE  !(((((((a25==1)&&(a11==1))&&(a28==9))&&!(a19==1))&&(a21==1))&&(a17==7)))
        VAL         [a=1, a11=1, 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]
[L432]  COND FALSE  !((((((!(a25==1)&&(a11==1))&&(a28==10))&&!(a19==1))&&(a21==1))&&(a17==7)))
        VAL         [a=1, a11=1, 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]
[L435]  COND TRUE   (((((!(a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))
        VAL         [a=1, a11=1, 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]
[L436]              __VERIFIER_error()
        VAL         [a=1, a11=1, 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]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 228 locations, 1 error locations. UNSAFE Result, 15.2s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 12.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1389 SDtfs, 1731 SDslu, 486 SDs, 0 SdLazy, 4013 SolverSat, 986 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3048occurred in iteration=4, 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.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 185 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1102 NumberOfCodeBlocks, 1102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 929 ConstructedInterpolants, 0 QuantifiedInterpolants, 233777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 299/309 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label44_false-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-23_23-45-18-727.csv
Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem02_label44_false-unreach-call_false-termination.c_svcomp-Reach-64bit-Automizer_Default.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_23-45-18-727.csv
Received shutdown request...