/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c


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


This is Ultimate 0.1.25-d623d84
[2020-07-21 01:25:41,214 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-21 01:25:41,216 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-21 01:25:41,234 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-21 01:25:41,234 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-21 01:25:41,236 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-21 01:25:41,239 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-21 01:25:41,250 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-21 01:25:41,253 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-21 01:25:41,256 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-21 01:25:41,258 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-21 01:25:41,259 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-21 01:25:41,259 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-21 01:25:41,261 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-21 01:25:41,263 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-21 01:25:41,264 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-21 01:25:41,266 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-21 01:25:41,267 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-21 01:25:41,268 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-21 01:25:41,273 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-21 01:25:41,278 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-21 01:25:41,281 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-21 01:25:41,282 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-21 01:25:41,283 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-21 01:25:41,285 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-21 01:25:41,286 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-21 01:25:41,286 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-21 01:25:41,288 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-21 01:25:41,289 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-21 01:25:41,289 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-21 01:25:41,290 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-21 01:25:41,291 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-21 01:25:41,291 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-21 01:25:41,292 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-21 01:25:41,293 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-21 01:25:41,293 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-21 01:25:41,295 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-21 01:25:41,295 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-21 01:25:41,295 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-21 01:25:41,296 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-21 01:25:41,297 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-21 01:25:41,298 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-21 01:25:41,320 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-21 01:25:41,320 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-21 01:25:41,325 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-21 01:25:41,326 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-07-21 01:25:41,326 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-07-21 01:25:41,326 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-21 01:25:41,326 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-21 01:25:41,326 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-21 01:25:41,327 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-21 01:25:41,328 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-21 01:25:41,328 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-21 01:25:41,328 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-21 01:25:41,328 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-21 01:25:41,328 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-07-21 01:25:41,329 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-21 01:25:41,329 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-21 01:25:41,329 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-21 01:25:41,329 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-21 01:25:41,329 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-07-21 01:25:41,330 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4
[2020-07-21 01:25:41,611 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-21 01:25:41,627 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-21 01:25:41,632 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-21 01:25:41,634 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-21 01:25:41,634 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-21 01:25:41,635 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label43.c
[2020-07-21 01:25:41,706 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148f9105f/775dc9af360b49d5b82c5a576f0d11f4/FLAGe900c5372
[2020-07-21 01:25:42,292 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-21 01:25:42,293 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label43.c
[2020-07-21 01:25:42,306 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148f9105f/775dc9af360b49d5b82c5a576f0d11f4/FLAGe900c5372
[2020-07-21 01:25:42,531 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148f9105f/775dc9af360b49d5b82c5a576f0d11f4
[2020-07-21 01:25:42,538 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-21 01:25:42,541 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-21 01:25:42,542 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-21 01:25:42,542 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-21 01:25:42,545 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-21 01:25:42,546 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:25:42" (1/1) ...
[2020-07-21 01:25:42,549 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550c1f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:42, skipping insertion in model container
[2020-07-21 01:25:42,549 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:25:42" (1/1) ...
[2020-07-21 01:25:42,557 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-21 01:25:42,604 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-21 01:25:43,115 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-21 01:25:43,122 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-21 01:25:43,266 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-21 01:25:43,283 INFO  L208         MainTranslator]: Completed translation
[2020-07-21 01:25:43,284 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43 WrapperNode
[2020-07-21 01:25:43,284 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-21 01:25:43,285 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-21 01:25:43,285 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-21 01:25:43,285 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-21 01:25:43,296 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,296 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,313 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,314 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,352 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,382 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,389 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (1/1) ...
[2020-07-21 01:25:43,398 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-21 01:25:43,398 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-21 01:25:43,398 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-21 01:25:43,399 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-21 01:25:43,400 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (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
[2020-07-21 01:25:43,470 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-21 01:25:43,470 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-21 01:25:43,470 INFO  L138     BoogieDeclarations]: Found implementation of procedure calculate_output
[2020-07-21 01:25:43,470 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-21 01:25:43,471 INFO  L130     BoogieDeclarations]: Found specification of procedure calculate_output
[2020-07-21 01:25:43,471 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-21 01:25:43,471 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-21 01:25:43,471 INFO  L130     BoogieDeclarations]: Found specification of procedure exit
[2020-07-21 01:25:43,471 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-21 01:25:43,472 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-21 01:25:43,472 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-21 01:25:44,554 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-21 01:25:44,554 INFO  L295             CfgBuilder]: Removed 1 assume(true) statements.
[2020-07-21 01:25:44,560 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:25:44 BoogieIcfgContainer
[2020-07-21 01:25:44,560 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-21 01:25:44,561 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-21 01:25:44,561 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-21 01:25:44,565 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-21 01:25:44,565 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:25:42" (1/3) ...
[2020-07-21 01:25:44,566 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cf5d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:25:44, skipping insertion in model container
[2020-07-21 01:25:44,566 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:25:43" (2/3) ...
[2020-07-21 01:25:44,566 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47cf5d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:25:44, skipping insertion in model container
[2020-07-21 01:25:44,567 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:25:44" (3/3) ...
[2020-07-21 01:25:44,568 INFO  L109   eAbstractionObserver]: Analyzing ICFG Problem02_label43.c
[2020-07-21 01:25:44,579 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION
[2020-07-21 01:25:44,587 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-21 01:25:44,601 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-21 01:25:44,627 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-21 01:25:44,628 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-21 01:25:44,628 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect
[2020-07-21 01:25:44,628 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-21 01:25:44,629 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-21 01:25:44,629 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-21 01:25:44,629 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-21 01:25:44,629 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-21 01:25:44,655 INFO  L276                IsEmpty]: Start isEmpty. Operand 236 states.
[2020-07-21 01:25:44,666 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-07-21 01:25:44,666 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:44,667 INFO  L422         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, 1, 1]
[2020-07-21 01:25:44,668 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:44,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:44,675 INFO  L82        PathProgramCache]: Analyzing trace with hash 389606425, now seen corresponding path program 1 times
[2020-07-21 01:25:44,684 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:44,685 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840777155]
[2020-07-21 01:25:44,685 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:44,849 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s)
[2020-07-21 01:25:44,849 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:44,853 INFO  L263         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 52 conjunts are in the unsatisfiable core
[2020-07-21 01:25:44,864 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:45,151 WARN  L193               SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26
[2020-07-21 01:25:45,418 INFO  L501       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-21 01:25:45,423 INFO  L320       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term
[2020-07-21 01:25:45,424 INFO  L501       QuantifierPusher]: Distributing 1 conjuncts over 2 disjuncts
[2020-07-21 01:25:45,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-21 01:25:45,526 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2020-07-21 01:25:45,527 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840777155]
[2020-07-21 01:25:45,528 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-21 01:25:45,528 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2020-07-21 01:25:45,529 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015126837]
[2020-07-21 01:25:45,535 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-07-21 01:25:45,535 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:45,549 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-07-21 01:25:45,550 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2020-07-21 01:25:45,552 INFO  L87              Difference]: Start difference. First operand 236 states. Second operand 10 states.
[2020-07-21 01:25:46,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:46,780 INFO  L93              Difference]: Finished difference Result 527 states and 878 transitions.
[2020-07-21 01:25:46,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2020-07-21 01:25:46,783 INFO  L78                 Accepts]: Start accepts. Automaton has 10 states. Word has length 91
[2020-07-21 01:25:46,784 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:46,797 INFO  L225             Difference]: With dead ends: 527
[2020-07-21 01:25:46,797 INFO  L226             Difference]: Without dead ends: 229
[2020-07-21 01:25:46,805 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210
[2020-07-21 01:25:46,823 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 229 states.
[2020-07-21 01:25:46,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229.
[2020-07-21 01:25:46,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 229 states.
[2020-07-21 01:25:46,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions.
[2020-07-21 01:25:46,871 INFO  L78                 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 91
[2020-07-21 01:25:46,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:46,872 INFO  L479      AbstractCegarLoop]: Abstraction has 229 states and 319 transitions.
[2020-07-21 01:25:46,872 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-07-21 01:25:46,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions.
[2020-07-21 01:25:46,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2020-07-21 01:25:46,877 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:46,877 INFO  L422         BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-21 01:25:47,091 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:47,091 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:47,092 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:47,092 INFO  L82        PathProgramCache]: Analyzing trace with hash -301885304, now seen corresponding path program 1 times
[2020-07-21 01:25:47,092 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:47,093 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1742788799]
[2020-07-21 01:25:47,094 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:47,182 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s)
[2020-07-21 01:25:47,182 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:47,184 INFO  L263         TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjunts are in the unsatisfiable core
[2020-07-21 01:25:47,189 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:47,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-21 01:25:47,237 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2020-07-21 01:25:47,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-21 01:25:47,328 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1742788799]
[2020-07-21 01:25:47,328 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2020-07-21 01:25:47,328 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2020-07-21 01:25:47,328 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267361449]
[2020-07-21 01:25:47,330 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-21 01:25:47,330 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:47,331 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-21 01:25:47,331 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-07-21 01:25:47,331 INFO  L87              Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states.
[2020-07-21 01:25:48,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:48,000 INFO  L93              Difference]: Finished difference Result 614 states and 880 transitions.
[2020-07-21 01:25:48,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2020-07-21 01:25:48,001 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 100
[2020-07-21 01:25:48,002 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:48,006 INFO  L225             Difference]: With dead ends: 614
[2020-07-21 01:25:48,007 INFO  L226             Difference]: Without dead ends: 391
[2020-07-21 01:25:48,008 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-07-21 01:25:48,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 391 states.
[2020-07-21 01:25:48,036 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391.
[2020-07-21 01:25:48,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 391 states.
[2020-07-21 01:25:48,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 547 transitions.
[2020-07-21 01:25:48,038 INFO  L78                 Accepts]: Start accepts. Automaton has 391 states and 547 transitions. Word has length 100
[2020-07-21 01:25:48,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:48,039 INFO  L479      AbstractCegarLoop]: Abstraction has 391 states and 547 transitions.
[2020-07-21 01:25:48,039 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-21 01:25:48,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 391 states and 547 transitions.
[2020-07-21 01:25:48,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2020-07-21 01:25:48,043 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:48,043 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-21 01:25:48,258 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:48,259 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:48,260 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:48,260 INFO  L82        PathProgramCache]: Analyzing trace with hash 1835187085, now seen corresponding path program 1 times
[2020-07-21 01:25:48,260 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:48,261 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1385885601]
[2020-07-21 01:25:48,262 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:48,361 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s)
[2020-07-21 01:25:48,361 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:48,363 INFO  L263         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core
[2020-07-21 01:25:48,383 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:48,406 INFO  L320       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2020-07-21 01:25:48,406 INFO  L501       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-21 01:25:48,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-21 01:25:48,444 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2020-07-21 01:25:48,529 INFO  L501       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-07-21 01:25:48,530 INFO  L320       QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 1] term
[2020-07-21 01:25:48,531 INFO  L501       QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts
[2020-07-21 01:25:48,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-21 01:25:48,591 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1385885601]
[2020-07-21 01:25:48,591 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-21 01:25:48,591 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6
[2020-07-21 01:25:48,594 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759144283]
[2020-07-21 01:25:48,612 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-21 01:25:48,612 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:48,613 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-21 01:25:48,613 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-07-21 01:25:48,613 INFO  L87              Difference]: Start difference. First operand 391 states and 547 transitions. Second operand 6 states.
[2020-07-21 01:25:49,604 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:49,604 INFO  L93              Difference]: Finished difference Result 1114 states and 1624 transitions.
[2020-07-21 01:25:49,605 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2020-07-21 01:25:49,605 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 108
[2020-07-21 01:25:49,605 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:49,613 INFO  L225             Difference]: With dead ends: 1114
[2020-07-21 01:25:49,613 INFO  L226             Difference]: Without dead ends: 729
[2020-07-21 01:25:49,617 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 212 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2020-07-21 01:25:49,619 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 729 states.
[2020-07-21 01:25:49,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 702.
[2020-07-21 01:25:49,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 702 states.
[2020-07-21 01:25:49,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 922 transitions.
[2020-07-21 01:25:49,674 INFO  L78                 Accepts]: Start accepts. Automaton has 702 states and 922 transitions. Word has length 108
[2020-07-21 01:25:49,674 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:49,674 INFO  L479      AbstractCegarLoop]: Abstraction has 702 states and 922 transitions.
[2020-07-21 01:25:49,675 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-21 01:25:49,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 702 states and 922 transitions.
[2020-07-21 01:25:49,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2020-07-21 01:25:49,678 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:49,678 INFO  L422         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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]
[2020-07-21 01:25:49,891 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:49,892 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:49,893 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:49,893 INFO  L82        PathProgramCache]: Analyzing trace with hash 905961192, now seen corresponding path program 1 times
[2020-07-21 01:25:49,893 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:49,894 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419929410]
[2020-07-21 01:25:49,894 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:49,969 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s)
[2020-07-21 01:25:49,970 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:49,971 INFO  L263         TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core
[2020-07-21 01:25:49,974 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:50,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2020-07-21 01:25:50,057 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2020-07-21 01:25:50,057 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419929410]
[2020-07-21 01:25:50,057 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-21 01:25:50,057 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2020-07-21 01:25:50,058 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470193465]
[2020-07-21 01:25:50,058 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-21 01:25:50,059 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:50,059 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-21 01:25:50,059 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2020-07-21 01:25:50,059 INFO  L87              Difference]: Start difference. First operand 702 states and 922 transitions. Second operand 5 states.
[2020-07-21 01:25:50,905 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:50,905 INFO  L93              Difference]: Finished difference Result 2086 states and 2935 transitions.
[2020-07-21 01:25:50,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2020-07-21 01:25:50,906 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 128
[2020-07-21 01:25:50,906 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:50,916 INFO  L225             Difference]: With dead ends: 2086
[2020-07-21 01:25:50,916 INFO  L226             Difference]: Without dead ends: 1390
[2020-07-21 01:25:50,919 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-07-21 01:25:50,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1390 states.
[2020-07-21 01:25:51,004 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1341.
[2020-07-21 01:25:51,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1341 states.
[2020-07-21 01:25:51,016 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1780 transitions.
[2020-07-21 01:25:51,016 INFO  L78                 Accepts]: Start accepts. Automaton has 1341 states and 1780 transitions. Word has length 128
[2020-07-21 01:25:51,019 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:51,019 INFO  L479      AbstractCegarLoop]: Abstraction has 1341 states and 1780 transitions.
[2020-07-21 01:25:51,019 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-21 01:25:51,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 1341 states and 1780 transitions.
[2020-07-21 01:25:51,029 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2020-07-21 01:25:51,030 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:51,030 INFO  L422         BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-21 01:25:51,244 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:51,245 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:51,245 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:51,246 INFO  L82        PathProgramCache]: Analyzing trace with hash -609590928, now seen corresponding path program 1 times
[2020-07-21 01:25:51,246 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:51,247 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520573392]
[2020-07-21 01:25:51,247 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:51,351 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s)
[2020-07-21 01:25:51,351 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:51,352 INFO  L263         TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 4 conjunts are in the unsatisfiable core
[2020-07-21 01:25:51,356 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:51,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-07-21 01:25:51,420 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2020-07-21 01:25:51,479 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-07-21 01:25:51,480 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520573392]
[2020-07-21 01:25:51,480 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-21 01:25:51,480 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6
[2020-07-21 01:25:51,480 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278923150]
[2020-07-21 01:25:51,481 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-21 01:25:51,481 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:51,482 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-21 01:25:51,482 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-07-21 01:25:51,482 INFO  L87              Difference]: Start difference. First operand 1341 states and 1780 transitions. Second operand 6 states.
[2020-07-21 01:25:52,515 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:52,515 INFO  L93              Difference]: Finished difference Result 3349 states and 4587 transitions.
[2020-07-21 01:25:52,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2020-07-21 01:25:52,516 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 132
[2020-07-21 01:25:52,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:52,531 INFO  L225             Difference]: With dead ends: 3349
[2020-07-21 01:25:52,532 INFO  L226             Difference]: Without dead ends: 2014
[2020-07-21 01:25:52,536 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2020-07-21 01:25:52,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2014 states.
[2020-07-21 01:25:52,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1955.
[2020-07-21 01:25:52,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1955 states.
[2020-07-21 01:25:52,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2504 transitions.
[2020-07-21 01:25:52,615 INFO  L78                 Accepts]: Start accepts. Automaton has 1955 states and 2504 transitions. Word has length 132
[2020-07-21 01:25:52,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:52,616 INFO  L479      AbstractCegarLoop]: Abstraction has 1955 states and 2504 transitions.
[2020-07-21 01:25:52,616 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-21 01:25:52,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 1955 states and 2504 transitions.
[2020-07-21 01:25:52,623 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2020-07-21 01:25:52,623 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:52,623 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-21 01:25:52,836 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:52,837 INFO  L427      AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:52,837 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:52,837 INFO  L82        PathProgramCache]: Analyzing trace with hash 2072947780, now seen corresponding path program 1 times
[2020-07-21 01:25:52,837 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:52,838 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1136397420]
[2020-07-21 01:25:52,838 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:52,947 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s)
[2020-07-21 01:25:52,947 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-21 01:25:52,949 INFO  L263         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjunts are in the unsatisfiable core
[2020-07-21 01:25:52,952 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-07-21 01:25:52,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-21 01:25:52,995 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2020-07-21 01:25:53,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 48 backedges. 46 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-21 01:25:53,060 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1136397420]
[2020-07-21 01:25:53,060 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-21 01:25:53,060 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2020-07-21 01:25:53,060 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410067063]
[2020-07-21 01:25:53,061 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-21 01:25:53,062 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-21 01:25:53,062 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-21 01:25:53,063 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2020-07-21 01:25:53,063 INFO  L87              Difference]: Start difference. First operand 1955 states and 2504 transitions. Second operand 7 states.
[2020-07-21 01:25:54,248 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-21 01:25:54,248 INFO  L93              Difference]: Finished difference Result 4877 states and 6233 transitions.
[2020-07-21 01:25:54,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2020-07-21 01:25:54,249 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 132
[2020-07-21 01:25:54,249 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-21 01:25:54,262 INFO  L225             Difference]: With dead ends: 4877
[2020-07-21 01:25:54,262 INFO  L226             Difference]: Without dead ends: 2928
[2020-07-21 01:25:54,267 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2020-07-21 01:25:54,270 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2928 states.
[2020-07-21 01:25:54,336 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2901.
[2020-07-21 01:25:54,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2901 states.
[2020-07-21 01:25:54,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3579 transitions.
[2020-07-21 01:25:54,345 INFO  L78                 Accepts]: Start accepts. Automaton has 2901 states and 3579 transitions. Word has length 132
[2020-07-21 01:25:54,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-21 01:25:54,346 INFO  L479      AbstractCegarLoop]: Abstraction has 2901 states and 3579 transitions.
[2020-07-21 01:25:54,346 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-21 01:25:54,346 INFO  L276                IsEmpty]: Start isEmpty. Operand 2901 states and 3579 transitions.
[2020-07-21 01:25:54,352 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2020-07-21 01:25:54,352 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-21 01:25:54,353 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-21 01:25:54,567 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:54,568 INFO  L427      AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-21 01:25:54,568 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-21 01:25:54,569 INFO  L82        PathProgramCache]: Analyzing trace with hash 1079124894, now seen corresponding path program 1 times
[2020-07-21 01:25:54,569 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-21 01:25:54,570 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672027317]
[2020-07-21 01:25:54,570 INFO  L95    rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions)
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:54,667 INFO  L228   tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s)
[2020-07-21 01:25:54,667 INFO  L229   tOrderPrioritization]: Conjunction of SSA is sat
[2020-07-21 01:25:54,667 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-21 01:25:54,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-21 01:25:54,705 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-07-21 01:25:54,865 INFO  L174   FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace
[2020-07-21 01:25:54,865 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-07-21 01:25:55,078 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-21 01:25:55,236 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:25:55 BoogieIcfgContainer
[2020-07-21 01:25:55,237 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-21 01:25:55,239 INFO  L168              Benchmark]: Toolchain (without parser) took 12698.51 ms. Allocated memory was 144.2 MB in the beginning and 366.5 MB in the end (delta: 222.3 MB). Free memory was 100.5 MB in the beginning and 235.2 MB in the end (delta: -134.7 MB). Peak memory consumption was 87.6 MB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,240 INFO  L168              Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 144.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,241 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 742.77 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 100.0 MB in the beginning and 170.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,246 INFO  L168              Benchmark]: Boogie Preprocessor took 113.36 ms. Allocated memory is still 203.4 MB. Free memory was 170.2 MB in the beginning and 165.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,247 INFO  L168              Benchmark]: RCFGBuilder took 1161.84 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 165.2 MB in the beginning and 180.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,248 INFO  L168              Benchmark]: TraceAbstraction took 10675.46 ms. Allocated memory was 234.9 MB in the beginning and 366.5 MB in the end (delta: 131.6 MB). Free memory was 179.2 MB in the beginning and 235.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB.
[2020-07-21 01:25:55,261 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.56 ms. Allocated memory is still 144.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 742.77 ms. Allocated memory was 144.2 MB in the beginning and 203.4 MB in the end (delta: 59.2 MB). Free memory was 100.0 MB in the beginning and 170.2 MB in the end (delta: -70.1 MB). Peak memory consumption was 29.7 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 113.36 ms. Allocated memory is still 203.4 MB. Free memory was 170.2 MB in the beginning and 165.2 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1161.84 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 165.2 MB in the beginning and 180.6 MB in the end (delta: -15.4 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 10675.46 ms. Allocated memory was 234.9 MB in the beginning and 366.5 MB in the end (delta: 131.6 MB). Free memory was 179.2 MB in the beginning and 235.2 MB in the end (delta: -56.0 MB). Peak memory consumption was 75.6 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 427]: 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         [\old(a)=20, \old(a11)=11, \old(a17)=16, \old(a19)=29, \old(a21)=14, \old(a25)=30, \old(a28)=28, \old(c)=19, \old(d)=18, \old(e)=12, \old(f)=15, \old(u)=27, \old(v)=31, \old(w)=32, \old(x)=17, \old(y)=13, \old(z)=2, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, output=-1, 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))
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  CALL, EXPR  calculate_output(input)
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, 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]
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, a=1, a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L165]  COND TRUE   (((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))
[L166]              a25 = 1
[L167]              a28 = 9
[L168]              return 26;
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, \old(input)=3, \result=26, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  RET, EXPR   calculate_output(input)
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=26, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[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))
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  CALL, EXPR  calculate_output(input)
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, a=1, a11=0, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L30]   COND TRUE   (((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))
[L31]               a28 = 9
[L32]               a11 = 1
[L33]               a25 = 1
[L34]               return -1;
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=4, \result=-1, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  RET, EXPR   calculate_output(input)
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, calculate_output(input)=-1, d=4, e=5, f=6, input=4, output=26, u=21, v=22, w=23, x=24, y=25, z=26]
[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))
        VAL         [\old(a11)=0, \old(a17)=8, \old(a19)=1, \old(a25)=0, \old(a28)=7, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, output=-1, u=21, v=22, w=23, x=24, y=25, z=26]
[L614]  CALL        calculate_output(input)
        VAL         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26]
[L30]   COND FALSE  !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8)))
        VAL         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, 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         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L426]  COND TRUE   ((((((a25==1)&&(a11==1))&&(a28==9))&&(a19==1))&&(a21==1))&&(a17==8))
        VAL         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]
[L427]              __VERIFIER_error()
        VAL         [\old(a11)=1, \old(a17)=8, \old(a19)=1, \old(a25)=1, \old(a28)=9, \old(input)=3, a=1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=9, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 236 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 7, TraceHistogramMax: 4, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 612 SDtfs, 3199 SDslu, 441 SDs, 0 SdLazy, 4523 SolverSat, 737 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1179 GetRequests, 1130 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2901occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 162 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 824 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1153 ConstructedInterpolants, 0 QuantifiedInterpolants, 377493 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1690 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 294/315 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...