java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label17_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 11:55:43,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 11:55:43,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 11:55:43,974 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 11:55:43,975 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 11:55:43,976 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 11:55:43,977 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 11:55:43,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 11:55:43,980 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 11:55:43,981 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 11:55:43,982 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 11:55:43,982 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 11:55:43,983 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 11:55:43,984 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 11:55:43,985 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 11:55:43,987 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 11:55:43,988 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 11:55:43,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 11:55:43,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 11:55:43,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 11:55:44,003 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 11:55:44,004 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 11:55:44,012 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 11:55:44,012 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 11:55:44,012 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 11:55:44,013 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 11:55:44,014 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 11:55:44,017 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 11:55:44,018 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 11:55:44,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 11:55:44,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 11:55:44,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 11:55:44,024 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 11:55:44,025 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 11:55:44,026 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 11:55:44,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 11:55:44,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-15 11:55:44,053 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 11:55:44,053 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 11:55:44,057 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 11:55:44,058 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 11:55:44,058 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 11:55:44,058 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 11:55:44,058 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 11:55:44,059 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-15 11:55:44,059 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 11:55:44,059 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 11:55:44,059 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 11:55:44,060 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 11:55:44,061 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 11:55:44,061 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 11:55:44,062 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 11:55:44,062 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 11:55:44,062 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 11:55:44,062 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 11:55:44,062 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 11:55:44,063 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 11:55:44,063 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 11:55:44,063 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 11:55:44,063 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 11:55:44,065 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:55:44,065 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 11:55:44,065 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 11:55:44,066 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 11:55:44,066 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 11:55:44,066 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 11:55:44,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 11:55:44,066 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 11:55:44,067 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 11:55:44,067 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 11:55:44,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 11:55:44,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 11:55:44,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 11:55:44,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 11:55:44,137 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 11:55:44,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label17_true-unreach-call.c [2018-09-15 11:55:44,507 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f03a5d1d/4b89740feda5420382bcdd1ea807772f/FLAG592c11a01 [2018-09-15 11:55:44,990 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 11:55:44,990 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label17_true-unreach-call.c [2018-09-15 11:55:45,025 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f03a5d1d/4b89740feda5420382bcdd1ea807772f/FLAG592c11a01 [2018-09-15 11:55:45,043 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f03a5d1d/4b89740feda5420382bcdd1ea807772f [2018-09-15 11:55:45,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 11:55:45,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 11:55:45,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 11:55:45,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 11:55:45,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 11:55:45,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:55:45" (1/1) ... [2018-09-15 11:55:45,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ecc5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:45, skipping insertion in model container [2018-09-15 11:55:45,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 11:55:45" (1/1) ... [2018-09-15 11:55:45,086 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 11:55:46,757 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:55:46,777 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 11:55:47,465 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 11:55:47,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47 WrapperNode [2018-09-15 11:55:47,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 11:55:47,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 11:55:47,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 11:55:47,882 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 11:55:47,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:48,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:48,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 11:55:48,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 11:55:48,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 11:55:48,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 11:55:49,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... [2018-09-15 11:55:49,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 11:55:49,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 11:55:49,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 11:55:49,538 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 11:55:49,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 11:55:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 11:55:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 11:55:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2018-09-15 11:55:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2018-09-15 11:55:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-09-15 11:55:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-09-15 11:55:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-15 11:55:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-15 11:55:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 11:55:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 11:55:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 11:55:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 11:55:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 11:55:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 11:56:01,491 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 11:56:01,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:56:01 BoogieIcfgContainer [2018-09-15 11:56:01,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 11:56:01,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 11:56:01,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 11:56:01,497 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 11:56:01,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 11:55:45" (1/3) ... [2018-09-15 11:56:01,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389fff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:56:01, skipping insertion in model container [2018-09-15 11:56:01,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 11:55:47" (2/3) ... [2018-09-15 11:56:01,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389fff52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 11:56:01, skipping insertion in model container [2018-09-15 11:56:01,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 11:56:01" (3/3) ... [2018-09-15 11:56:01,500 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label17_true-unreach-call.c [2018-09-15 11:56:01,511 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 11:56:01,521 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 11:56:01,587 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 11:56:01,587 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 11:56:01,588 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 11:56:01,588 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 11:56:01,588 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 11:56:01,588 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 11:56:01,588 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 11:56:01,588 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 11:56:01,588 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 11:56:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states. [2018-09-15 11:56:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-15 11:56:01,652 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:56:01,653 INFO L376 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] [2018-09-15 11:56:01,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:56:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1075822924, now seen corresponding path program 1 times [2018-09-15 11:56:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:56:01,662 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-09-15 11:56:01,665 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2847], [2849], [4242], [4246], [4252], [4256], [4269], [4270], [4271], [4273] [2018-09-15 11:56:01,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:56:01,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:56:03,587 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:56:03,589 INFO L272 AbstractInterpreter]: Visited 39 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 25 variables. [2018-09-15 11:56:03,624 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:56:04,387 INFO L232 lantSequenceWeakener]: Weakened 38 states. On average, predicates are now at 72.85% of their original sizes. [2018-09-15 11:56:04,387 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:56:04,700 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:56:04,702 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:56:04,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 11:56:04,703 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:56:04,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 11:56:04,717 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 11:56:04,718 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:56:04,721 INFO L87 Difference]: Start difference. First operand 1120 states. Second operand 6 states. [2018-09-15 11:56:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:56:25,655 INFO L93 Difference]: Finished difference Result 3044 states and 5648 transitions. [2018-09-15 11:56:25,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 11:56:25,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-09-15 11:56:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:56:25,695 INFO L225 Difference]: With dead ends: 3044 [2018-09-15 11:56:25,695 INFO L226 Difference]: Without dead ends: 1922 [2018-09-15 11:56:25,706 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 11:56:25,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-09-15 11:56:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1920. [2018-09-15 11:56:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-09-15 11:56:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 2831 transitions. [2018-09-15 11:56:25,881 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 2831 transitions. Word has length 40 [2018-09-15 11:56:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:56:25,882 INFO L480 AbstractCegarLoop]: Abstraction has 1920 states and 2831 transitions. [2018-09-15 11:56:25,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 11:56:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 2831 transitions. [2018-09-15 11:56:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-15 11:56:25,890 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:56:25,891 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:56:25,891 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:56:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1387773856, now seen corresponding path program 1 times [2018-09-15 11:56:25,892 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:56:25,892 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-09-15 11:56:25,893 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2847], [2849], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3265], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-15 11:56:25,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:56:25,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:56:46,361 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:56:46,362 INFO L272 AbstractInterpreter]: Visited 108 different actions 210 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 11:56:46,399 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:56:51,597 INFO L232 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 71.48% of their original sizes. [2018-09-15 11:56:51,597 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:56:53,459 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:56:53,460 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:56:53,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 11:56:53,460 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:56:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 11:56:53,463 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 11:56:53,463 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 11:56:53,463 INFO L87 Difference]: Start difference. First operand 1920 states and 2831 transitions. Second operand 10 states. [2018-09-15 11:57:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:57:43,699 INFO L93 Difference]: Finished difference Result 3839 states and 6442 transitions. [2018-09-15 11:57:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 11:57:43,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2018-09-15 11:57:43,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:57:43,720 INFO L225 Difference]: With dead ends: 3839 [2018-09-15 11:57:43,720 INFO L226 Difference]: Without dead ends: 2729 [2018-09-15 11:57:43,725 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-15 11:57:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2018-09-15 11:57:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2726. [2018-09-15 11:57:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-09-15 11:57:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3652 transitions. [2018-09-15 11:57:43,812 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3652 transitions. Word has length 141 [2018-09-15 11:57:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:57:43,813 INFO L480 AbstractCegarLoop]: Abstraction has 2726 states and 3652 transitions. [2018-09-15 11:57:43,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 11:57:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3652 transitions. [2018-09-15 11:57:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-15 11:57:43,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:57:43,818 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:57:43,818 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:57:43,819 INFO L82 PathProgramCache]: Analyzing trace with hash -856737047, now seen corresponding path program 1 times [2018-09-15 11:57:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:57:43,819 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2018-09-15 11:57:43,820 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2847], [2849], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3409], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-15 11:57:43,828 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:57:43,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:58:03,222 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 11:58:03,223 INFO L272 AbstractInterpreter]: Visited 137 different actions 267 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-09-15 11:58:03,232 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 11:58:07,972 INFO L232 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 71.36% of their original sizes. [2018-09-15 11:58:07,972 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 11:58:09,945 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 11:58:09,946 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 11:58:09,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 11:58:09,946 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 11:58:09,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 11:58:09,947 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 11:58:09,947 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-09-15 11:58:09,948 INFO L87 Difference]: Start difference. First operand 2726 states and 3652 transitions. Second operand 12 states. [2018-09-15 11:59:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 11:59:25,221 INFO L93 Difference]: Finished difference Result 5450 states and 8859 transitions. [2018-09-15 11:59:25,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 11:59:25,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2018-09-15 11:59:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 11:59:25,245 INFO L225 Difference]: With dead ends: 5450 [2018-09-15 11:59:25,246 INFO L226 Difference]: Without dead ends: 4340 [2018-09-15 11:59:25,251 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 177 GetRequests, 131 SyntacticMatches, 28 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-09-15 11:59:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2018-09-15 11:59:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 4337. [2018-09-15 11:59:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4337 states. [2018-09-15 11:59:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5285 transitions. [2018-09-15 11:59:25,388 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5285 transitions. Word has length 170 [2018-09-15 11:59:25,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 11:59:25,388 INFO L480 AbstractCegarLoop]: Abstraction has 4337 states and 5285 transitions. [2018-09-15 11:59:25,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 11:59:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5285 transitions. [2018-09-15 11:59:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-15 11:59:25,394 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 11:59:25,395 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 11:59:25,395 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 11:59:25,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1893050636, now seen corresponding path program 1 times [2018-09-15 11:59:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 11:59:25,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-09-15 11:59:25,397 INFO L202 CegarAbsIntRunner]: [0], [1], [2628], [2635], [2643], [2651], [2659], [2667], [2675], [2683], [2691], [2699], [2707], [2715], [2723], [2731], [2739], [2747], [2755], [2763], [2771], [2779], [2787], [2795], [2803], [2811], [2819], [2827], [2835], [2843], [2847], [2849], [2852], [2860], [2868], [2876], [2884], [2892], [2900], [2908], [2916], [2924], [2932], [2940], [2948], [2956], [2964], [2972], [2980], [2988], [2996], [3004], [3012], [3020], [3028], [3036], [3044], [3052], [3060], [3068], [3076], [3084], [3092], [3100], [3108], [3116], [3121], [3125], [3129], [3133], [3137], [3148], [3152], [3156], [3160], [3164], [3168], [3179], [3183], [3187], [3191], [3195], [3199], [3203], [3207], [3218], [3222], [3226], [3230], [3234], [3238], [3242], [3246], [3250], [3254], [3258], [3262], [3266], [3270], [3274], [3278], [3282], [3286], [3290], [3294], [3305], [3309], [3313], [3317], [3321], [3325], [3329], [3333], [3344], [3355], [3366], [3370], [3374], [3378], [3382], [3386], [3390], [3394], [3398], [3402], [3406], [3410], [3414], [3425], [3429], [3440], [3451], [3455], [3459], [3463], [3467], [3471], [3475], [3479], [3483], [3487], [3498], [3502], [3506], [3517], [3521], [3525], [3529], [3533], [3537], [3541], [3545], [3556], [3560], [3564], [3568], [3572], [3576], [3580], [3591], [3595], [3599], [3603], [3614], [3618], [3622], [3626], [3630], [3634], [3638], [3642], [3646], [3650], [3654], [3658], [3662], [3666], [3670], [3674], [3678], [3682], [3686], [3690], [3694], [3698], [3709], [3713], [3717], [3721], [3725], [3729], [3733], [3737], [3741], [3745], [3749], [3753], [3757], [3768], [3772], [3776], [3780], [3784], [3788], [3792], [3796], [3800], [3804], [3815], [3819], [3823], [3827], [3831], [3835], [3839], [3843], [3847], [3851], [3862], [3865], [4238], [4242], [4246], [4252], [4256], [4258], [4269], [4270], [4271], [4273], [4274] [2018-09-15 11:59:25,408 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-15 11:59:25,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 11:59:35,642 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-15 11:59:52,220 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 11:59:52,221 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 11:59:52,221 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 11:59:52,266 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 11:59:52,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 11:59:52 BoogieIcfgContainer [2018-09-15 11:59:52,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 11:59:52,267 INFO L168 Benchmark]: Toolchain (without parser) took 247211.76 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -517.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,271 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 11:59:52,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2821.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.9 MB). Peak memory consumption was 341.9 MB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,273 INFO L168 Benchmark]: Boogie Procedure Inliner took 334.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,275 INFO L168 Benchmark]: Boogie Preprocessor took 1321.73 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 987.2 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.2 MB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,278 INFO L168 Benchmark]: RCFGBuilder took 11954.33 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 176.7 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -33.2 MB). Peak memory consumption was 753.4 MB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,279 INFO L168 Benchmark]: TraceAbstraction took 230773.36 ms. Allocated memory was 2.7 GB in the beginning and 4.3 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 1.9 GB in the end (delta: 431.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-15 11:59:52,288 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2821.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.9 MB). Peak memory consumption was 341.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 334.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1321.73 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 987.2 MB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 174.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11954.33 ms. Allocated memory was 2.5 GB in the beginning and 2.7 GB in the end (delta: 176.7 MB). Free memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: -33.2 MB). Peak memory consumption was 753.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230773.36 ms. Allocated memory was 2.7 GB in the beginning and 4.3 GB in the end (delta: 1.6 GB). Free memory was 2.4 GB in the beginning and 1.9 GB in the end (delta: 431.4 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 111]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L10] int inputB = 2; [L11] int inputE = 5; [L12] int inputC = 3; [L13] int inputD = 4; [L14] int inputF = 6; [L17] int a26 = 1; [L18] int a13 = 0; [L19] int a19 = 9; [L20] int a23 = 158; [L21] int a12 = 286; [L22] int a1 = 2; [L5803] int output = -1; [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL, EXPR calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L113] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L116] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L119] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L122] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L125] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L128] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L131] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L134] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L137] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L140] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L143] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L146] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L149] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L152] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L155] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L158] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L161] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L164] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L167] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L170] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L173] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L176] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L179] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L182] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L185] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L188] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L191] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L194] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L197] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L200] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L203] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L206] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L209] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L213] COND FALSE !(((a26==1) && (((((input == 5) && ((( ((264 < a23) && (476 >= a23)) && (a19==10)) || ( 476 < a23 && (a19==10))) || ( a23 <= 95 && (a19==11)))) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a13==1)))) [L221] COND FALSE !(((a19==13) && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && ((a26==1) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a13==1))))))) [L229] COND FALSE !(((((a1==2) && (((input == 2) && (((a19==12) && a23 <= 95 ) || (((a19==11) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==11))))) && !(a13==1))) && 441 < a12 ) && (a26==1))) [L236] COND FALSE !((((a26==1) && (((a13==1) && ((input == 2) && (( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 ))))) && a12 <= 178 )) && (a1==3))) [L243] COND FALSE !(((((a26==1) && (((a19==11) && ((a1==2) && (input == 6))) && 441 < a12 )) && (a13==1)) && ((95 < a23) && (264 >= a23)) )) [L251] COND FALSE !(( a12 <= 178 && (!(a13==1) && ((a26==1) && (((input == 2) && (((a19==13) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==12)) || ((a19==12) && 476 < a23 )))) && (a1==3)))))) [L262] COND FALSE !((((((a1==2) && (((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 3))) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && !(a13==1))) [L269] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a26==1) && (((a19==9) && (((input == 6) && (a13==1)) && (a1==3))) && 476 < a23 )))) [L275] COND FALSE !((( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && ((a19==11) && ((a26==1) && (input == 4)))) && ((178 < a12) && (395 >= a12)) )) && (a1==2))) [L279] COND FALSE !(((a26==1) && (((((a19==13) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6))) && a12 <= 178 ) && !(a13==1)) && (a1==3)))) [L285] COND FALSE !(((((a26==1) && (( 441 < a12 && (!(a13==1) && (input == 2))) && ((95 < a23) && (264 >= a23)) )) && (a1==3)) && (a19==13))) [L292] COND FALSE !(((a19==13) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3)) && 441 < a12 )) && (a26==1)) && !(a13==1)))) [L308] COND FALSE !(((a19==11) && ((a26==1) && (( 476 < a23 && ( ((395 < a12) && (441 >= a12)) && ((a1==3) && (input == 2)))) && !(a13==1))))) [L315] COND FALSE !(((a1==3) && ((a26==1) && ((((a19==13) && ((input == 3) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))) && ((178 < a12) && (395 >= a12)) ) && !(a13==1))))) [L321] COND FALSE !(((a26==1) && (((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 ))) && (input == 6)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==3)))) [L327] COND FALSE !((((a19==10) && (((((input == 2) && ((178 < a12) && (395 >= a12)) ) && a23 <= 95 ) && (a13==1)) && (a1==3))) && (a26==1))) [L330] COND FALSE !(((((a1==2) && (((a26==1) && ((input == 2) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && 441 < a12 )) && (a13==1)) && (a19==13))) [L337] COND FALSE !(((((((a1==2) && (!(a13==1) && (input == 6))) && (a19==12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L342] COND FALSE !(((a26==1) && (((( ((395 < a12) && (441 >= a12)) && ((input == 5) && (a19==11))) && (a13==1)) && (a1==3)) && ((264 < a23) && (476 >= a23)) ))) [L350] COND FALSE !(((a13==1) && ((( 441 < a12 && ((input == 6) && ((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10))))) && (a26==1)) && (a1==2)))) [L365] COND FALSE !(( ((264 < a23) && (476 >= a23)) && ((a26==1) && ((!(a13==1) && ((a1==3) && ((input == 3) && (a19==10)))) && a12 <= 178 )))) [L372] COND FALSE !(((((a1==3) && ((((( ((264 < a23) && (476 >= a23)) && (a19==13)) && (a13==1)) || ((a13==1) && ( 476 < a23 && (a19==13)))) || (((a19==9) && a23 <= 95 ) && !(a13==1))) && (input == 2))) && ((395 < a12) && (441 >= a12)) ) && (a26==1))) [L379] COND FALSE !(((a19==13) && (((a13==1) && ((a1==2) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 5))))) && ((395 < a12) && (441 >= a12)) ))) [L387] COND FALSE !(((a26==1) && (((((a19==13) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && (a13==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) ))) [L393] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((((a19==10) && ((95 < a23) && (264 >= a23)) ) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))) && (input == 3))) && (a1==2))))) [L398] COND FALSE !((( 441 < a12 && ((a1==3) && ((a19==12) && (((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a13==1))))) && (a26==1))) [L404] COND FALSE !(((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )) && (input == 5))) && (a26==1)) && (a1==2)))) [L411] COND FALSE !((((a1==3) && ((a19==9) && ( ((395 < a12) && (441 >= a12)) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 5)) && !(a13==1))))) && (a26==1))) [L417] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((a19==11) && ((a13==1) && (((input == 5) && (a1==3)) && 476 < a23 )))) && (a26==1))) [L423] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((!(a13==1) && (((((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12))) || ( a23 <= 95 && (a19==13))) && (input == 4))) && (a1==2)) && (a26==1)))) [L430] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && ((a1==2) && (!(a13==1) && ((a19==10) && ((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )))))))) [L436] COND FALSE !(((a26==1) && ((((((input == 6) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && !(a13==1)) && (a19==9)) && (a1==2)) && ((178 < a12) && (395 >= a12)) ))) [L441] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==2) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11)))))) && !(a13==1)))) [L448] COND FALSE !(((a26==1) && (((((a1==2) && ((input == 2) && ((395 < a12) && (441 >= a12)) )) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) ))) [L455] COND FALSE !(( 441 < a12 && ((a13==1) && ((a26==1) && (( ((95 < a23) && (264 >= a23)) && ((input == 2) && (a19==11))) && (a1==2)))))) [L462] COND FALSE !(((((((a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && (a1==2)) && (a19==9)) && 441 < a12 ) && (a26==1))) [L469] COND FALSE !(( ((178 < a12) && (395 >= a12)) && ((a19==10) && ( ((264 < a23) && (476 >= a23)) && (((!(a13==1) && (input == 3)) && (a26==1)) && (a1==2)))))) [L476] COND FALSE !((((a1==3) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a19==12) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))) && (a26==1))) [L480] COND FALSE !(((a19==11) && ((!(a13==1) && ((a26==1) && (((input == 2) && ((178 < a12) && (395 >= a12)) ) && (a1==2)))) && a23 <= 95 ))) [L487] COND FALSE !((((a13==1) && (((a26==1) && ((((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))) && (input == 3))) && a12 <= 178 )) && (a1==4))) [L499] COND FALSE !((((a1==3) && ((a13==1) && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) || ((264 < a23) && (476 >= a23)) ) && (input == 6)) && (a26==1)) && (a19==9)))) && ((178 < a12) && (395 >= a12)) )) [L505] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a19==11) && ((input == 6) && (a26==1))) && (a1==3)) && (a13==1)) && ((264 < a23) && (476 >= a23)) ))) [L511] COND FALSE !((( a12 <= 178 && (!(a13==1) && (((input == 6) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ((a19==9) && 476 < a23 )))) && (a26==1)))) && (a1==4))) [L517] COND FALSE !(((a1==3) && (!(a13==1) && ((((((a19==11) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==10)) || ( a23 <= 95 && (a19==11)))) && (input == 3)) && ((395 < a12) && (441 >= a12)) ) && (a26==1))))) [L524] COND FALSE !(((((a26==1) && ((a1==2) && ((input == 3) && ((((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))) || ( ((95 < a23) && (264 >= a23)) && (a19==10)))))) && (a13==1)) && 441 < a12 )) [L530] COND FALSE !(( 476 < a23 && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a13==1) && ((a1==3) && ((a19==9) && (input == 2)))))))) [L536] COND FALSE !(((( ((178 < a12) && (395 >= a12)) && ((a26==1) && ((input == 4) && ((( 476 < a23 && (a19==12)) || ((a19==13) && a23 <= 95 )) || ((a19==13) && ((95 < a23) && (264 >= a23)) ))))) && !(a13==1)) && (a1==2))) [L543] COND FALSE !(((((a26==1) && (!(a13==1) && ((( 476 < a23 && (a19==9)) || ((a19==10) && a23 <= 95 )) && (input == 2)))) && a12 <= 178 ) && (a1==3))) [L555] COND FALSE !(((a26==1) && (((((a19==12) && ((input == 4) && ((264 < a23) && (476 >= a23)) )) && 441 < a12 ) && !(a13==1)) && (a1==3)))) [L569] COND FALSE !((((input == 3) && ((!(a13==1) && ((a19==13) && ((a1==2) && ( 441 < a12 && 476 < a23 )))) || (((( a23 <= 95 && a12 <= 178 ) && (a1==3)) && (a19==9)) && (a13==1)))) && (a26==1))) [L585] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (((a1==3) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a19==13)))))) [L593] COND FALSE !((( a12 <= 178 && ((((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4)) && (a19==10)) && (a26==1)) && (a13==1))) && (a1==3))) [L596] COND FALSE !((((((a19==11) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 3)) && (a13==1))) && (a1==4)) && a12 <= 178 ) && (a26==1))) [L604] COND FALSE !((( a12 <= 178 && ((a1==3) && (((input == 5) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && (a26==1)))) && (a13==1))) [L610] COND FALSE !(((a19==11) && ( ((264 < a23) && (476 >= a23)) && ( ((395 < a12) && (441 >= a12)) && (((a26==1) && (!(a13==1) && (input == 3))) && (a1==3)))))) [L617] COND FALSE !(((((a19==13) && (( 476 < a23 && ((a13==1) && (input == 2))) && a12 <= 178 )) && (a1==3)) && (a26==1))) [L624] COND FALSE !(( 441 < a12 && (( a23 <= 95 && ((((a13==1) && (input == 4)) && (a26==1)) && (a19==11))) && (a1==3)))) [L630] COND FALSE !(((!(a13==1) && ((a26==1) && ((a1==3) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 5)) && ((178 < a12) && (395 >= a12)) )))) && (a19==13))) [L636] COND FALSE !((((a26==1) && ((input == 5) && (((( ((395 < a12) && (441 >= a12)) && 476 < a23 ) && (a19==13)) && !(a13==1)) || ((( a23 <= 95 && 441 < a12 ) && (a19==9)) && (a13==1))))) && (a1==2))) [L644] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((a1==3) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a26==1)) && !(a13==1))) && (a19==9)))) [L647] COND FALSE !(((((a1==2) && (!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && ((178 < a12) && (395 >= a12)) ))) && (a19==9)) && (a26==1))) [L653] COND FALSE !(((a19==11) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && 476 < a23 ) && (a26==1)) && !(a13==1)))))) [L659] COND FALSE !(((a26==1) && ( a12 <= 178 && (!(a13==1) && (((a19==13) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))))) [L670] COND FALSE !((((a13==1) && (( 441 < a12 && (((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1))) && (a19==9))) && (a1==2))) [L678] COND FALSE !((!(a13==1) && ((a26==1) && ( ((178 < a12) && (395 >= a12)) && ((a1==2) && ((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)) && (a19==11))))))) [L693] COND FALSE !(((a26==1) && (( ((95 < a23) && (264 >= a23)) && (( 441 < a12 && ((a1==3) && (input == 5))) && !(a13==1))) && (a19==13)))) [L708] COND FALSE !(((a1==3) && (((a26==1) && (((a19==10) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2))) && (a13==1))) && ((395 < a12) && (441 >= a12)) ))) [L715] COND FALSE !(( 441 < a12 && ((a26==1) && (( ((264 < a23) && (476 >= a23)) && (((input == 5) && (a1==3)) && (a19==12))) && !(a13==1))))) [L721] COND FALSE !((((a19==11) && ( ((178 < a12) && (395 >= a12)) && (((a26==1) && ((input == 2) && (a1==3))) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1))) [L727] COND FALSE !((((a26==1) && ((a1==3) && ( ((395 < a12) && (441 >= a12)) && (!(a13==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 4)))))) && (a19==13))) [L734] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && (((((((a19==13) && ((264 < a23) && (476 >= a23)) ) && (a13==1)) || (( 476 < a23 && (a19==13)) && (a13==1))) || (( a23 <= 95 && (a19==9)) && !(a13==1))) && (input == 4)) && (a1==3))))) [L741] COND FALSE !(((((a13==1) && ((( a12 <= 178 && (input == 4)) && a23 <= 95 ) && (a1==4))) && (a26==1)) && (a19==13))) [L747] COND FALSE !(((a1==3) && ((a26==1) && ( a12 <= 178 && (!(a13==1) && ((input == 5) && (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10))))))))) [L753] COND FALSE !(((a1==2) && (!(a13==1) && ( 441 < a12 && ((a19==13) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a26==1))))))) [L761] COND FALSE !(((a19==13) && (((a1==3) && (((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 4)) && (a26==1)) && a12 <= 178 )) && (a13==1)))) [L764] COND FALSE !((((!(a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (( 476 < a23 && (a19==11)) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 )) && (a1==4)) && (a26==1))) [L778] COND FALSE !(((( 441 < a12 && (!(a13==1) && ((a19==10) && ((a1==2) && (input == 4))))) && (a26==1)) && ((264 < a23) && (476 >= a23)) )) [L784] COND FALSE !((((((a19==11) && ((a26==1) && ((input == 6) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) [L791] COND FALSE !(((a19==13) && ((a26==1) && ((a1==3) && (( ((178 < a12) && (395 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 4))) && !(a13==1)))))) [L800] COND FALSE !(((((a1==3) && ((a19==11) && (((input == 6) && a23 <= 95 ) && (a26==1)))) && !(a13==1)) && 441 < a12 )) [L807] COND FALSE !((((((a19==12) && (((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==3))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a13==1))) [L812] COND FALSE !((((((a13==1) && ((( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6)) && (a19==13))) && ((178 < a12) && (395 >= a12)) ) && (a26==1)) && (a1==3))) [L818] COND FALSE !(((a13==1) && (((a1==4) && (( ((95 < a23) && (264 >= a23)) && ((a19==13) && (input == 5))) && a12 <= 178 )) && (a26==1)))) [L823] COND FALSE !(( 441 < a12 && ((a1==3) && ((a26==1) && ((a13==1) && ((a19==10) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )))))))) [L830] COND FALSE !(((a26==1) && ((a1==2) && ( ((395 < a12) && (441 >= a12)) && ( ((95 < a23) && (264 >= a23)) && ((!(a13==1) && (input == 6)) && (a19==13))))))) [L838] COND FALSE !(((a13==1) && (((a26==1) && (((((a19==11) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==10)) || ((a19==10) && 476 < a23 ))) && (input == 3)) && (a1==3))) && ((178 < a12) && (395 >= a12)) ))) [L845] COND FALSE !(((a19==12) && ( ((264 < a23) && (476 >= a23)) && ((a26==1) && (((!(a13==1) && (input == 3)) && (a1==3)) && 441 < a12 ))))) [L861] COND FALSE !(((a26==1) && (!(a13==1) && ((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && ((178 < a12) && (395 >= a12)) ) && (a1==3)) && (a19==11))))) [L867] COND FALSE !(( a12 <= 178 && ((a26==1) && ((a19==9) && ((((input == 6) && a23 <= 95 ) && (a13==1)) && (a1==4)))))) [L874] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((!(a13==1) && ( a23 <= 95 && (a19==9))) || (((a13==1) && ((a19==13) && ((264 < a23) && (476 >= a23)) )) || (((a19==13) && 476 < a23 ) && (a13==1)))) && (input == 6)) && (a1==3)) && (a26==1)))) [L881] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((a1==3) && ((input == 5) && ((95 < a23) && (264 >= a23)) )) && (a19==9)))))) [L887] COND FALSE !(((((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) && (a19==13)) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 5))) && (a1==2)) && (a26==1)) && ((178 < a12) && (395 >= a12)) )) [L894] COND FALSE !(((((((a1==3) && ( 441 < a12 && (input == 6))) && (a26==1)) && (a19==13)) && !(a13==1)) && ((95 < a23) && (264 >= a23)) )) [L901] COND FALSE !((((a26==1) && ( 441 < a12 && ((a19==11) && (((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1))))) && (a1==3))) [L916] COND FALSE !(((((a19==9) && ((a13==1) && ((a1==4) && ((input == 3) && (a26==1))))) && a23 <= 95 ) && a12 <= 178 )) [L921] COND FALSE !(((a26==1) && ( 476 < a23 && ((((a13==1) && ((input == 4) && a12 <= 178 )) && (a19==13)) && (a1==3))))) [L928] COND FALSE !(((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((( 476 < a23 && (a19==10)) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 2)) && (a1==2)))) && (a26==1))) [L936] COND FALSE !(((a26==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && (((input == 2) && ( 476 < a23 || ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ))) && !(a13==1))))))) [L949] COND FALSE !((( ((395 < a12) && (441 >= a12)) && ((!(a13==1) && ((((a19==13) && ((95 < a23) && (264 >= a23)) ) || (((a19==12) && 476 < a23 ) || ((a19==13) && a23 <= 95 ))) && (input == 4))) && (a1==3))) && (a26==1))) [L956] COND FALSE !(((a1==3) && (((a26==1) && ( 441 < a12 && (!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))))) && (a19==12)))) [L962] COND FALSE !((((a1==3) && ( a12 <= 178 && (((input == 2) && ((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ((a19==11) && ((95 < a23) && (264 >= a23)) ))) && !(a13==1)))) && (a26==1))) [L968] COND FALSE !(((a26==1) && ((input == 2) && ((!(a13==1) && ((( 476 < a23 && 441 < a12 ) && (a1==2)) && (a19==13))) || (((a19==9) && ((a1==3) && ( a23 <= 95 && a12 <= 178 ))) && (a13==1)))))) [L976] COND FALSE !((((((((input == 4) && ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (a1==2)) && ((395 < a12) && (441 >= a12)) ) && (a26==1)) && (a19==12)) && (a13==1))) [L983] COND FALSE !((((a19==13) && ((a13==1) && ((a1==3) && ((a26==1) && ( ((264 < a23) && (476 >= a23)) && (input == 5)))))) && ((178 < a12) && (395 >= a12)) )) [L990] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((((a1==3) && ((( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) )) && (input == 4)) && (a19==12))) && (a26==1)) && !(a13==1)))) [L998] COND FALSE !(((a26==1) && ( ((395 < a12) && (441 >= a12)) && ((((( a23 <= 95 && (a19==10)) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9)))) && (input == 3)) && (a13==1)) && (a1==2))))) [L1006] COND FALSE !((( a12 <= 178 && ((((input == 5) && (((a19==10) && a23 <= 95 ) || (( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))))) && (a13==1)) && (a26==1))) && (a1==4))) [L1013] COND FALSE !(((a26==1) && ((a19==13) && ((((a1==3) && ((input == 6) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ))) && (a13==1)) && 441 < a12 )))) [L1021] COND FALSE !(((((a26==1) && ((a13==1) && (((a19==13) && (input == 5)) && a23 <= 95 ))) && a12 <= 178 ) && (a1==4))) [L1027] COND FALSE !(((((a26==1) && (((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 2)) && (a19==13)) && !(a13==1))) && (a1==3)) && 441 < a12 )) [L1034] COND FALSE !(( 441 < a12 && (((a26==1) && ((((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ( a23 <= 95 && (a19==10))) && (input == 3)) && !(a13==1))) && (a1==3)))) [L1042] COND FALSE !(((((((( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 6)) && (a19==13)) && (a26==1)) && ((178 < a12) && (395 >= a12)) ) && (a1==2)) && !(a13==1))) [L1048] COND FALSE !(((a1==3) && ((a13==1) && (( ((395 < a12) && (441 >= a12)) && ((input == 2) && ((( ((264 < a23) && (476 >= a23)) && (a19==9)) || ( 476 < a23 && (a19==9))) || ((a19==10) && a23 <= 95 )))) && (a26==1))))) [L1055] COND FALSE !(((a1==3) && ((!(a13==1) && ( a12 <= 178 && (((((a19==10) && 476 < a23 ) || ( a23 <= 95 && (a19==11))) || ( ((95 < a23) && (264 >= a23)) && (a19==11))) && (input == 6)))) && (a26==1)))) [L1062] COND FALSE !(( ((395 < a12) && (441 >= a12)) && ((a26==1) && (((((((a19==13) && 476 < a23 ) && (a13==1)) || (!(a13==1) && ( a23 <= 95 && (a19==9)))) || (!(a13==1) && ((a19==9) && ((95 < a23) && (264 >= a23)) ))) && (input == 3)) && (a1==2))))) [L1069] COND FALSE !((((((a1==4) && ((input == 6) && (((a19==11) && 476 < a23 ) || ( a23 <= 95 && (a19==12))))) && a12 <= 178 ) && (a13==1)) && (a26==1))) [L1075] COND FALSE !(((!(a13==1) && ((a19==11) && ( 441 < a12 && ((a1==3) && ((a26==1) && (input == 4)))))) && a23 <= 95 )) [L1082] COND FALSE !((((a26==1) && ((a19==10) && ((!(a13==1) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 6))) && a12 <= 178 ))) && (a1==4))) [L1087] COND FALSE !((((a1==3) && ((a26==1) && ( 441 < a12 && ((input == 3) && (( ((95 < a23) && (264 >= a23)) && (a19==10)) || (((a19==9) && 476 < a23 ) || ( a23 <= 95 && (a19==10)))))))) && (a13==1))) [L1094] COND FALSE !(( 441 < a12 && (((a26==1) && ((a19==12) && (((input == 3) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && !(a13==1)))) && (a1==2)))) [L1108] COND FALSE !((( 441 < a12 && ((a26==1) && ((((input == 5) && (a13==1)) && a23 <= 95 ) && (a19==13)))) && (a1==2))) [L1116] COND FALSE !(((a26==1) && ( ((95 < a23) && (264 >= a23)) && ((a19==13) && (((a1==2) && (!(a13==1) && (input == 3))) && ((395 < a12) && (441 >= a12)) ))))) [L1121] COND FALSE !((((((!(a13==1) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 6))) && (a1==2)) && 441 < a12 ) && (a19==9)) && (a26==1))) [L1129] COND FALSE !((((((((input == 4) && (( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 )) && (a13==1)) && (a19==10)) && (a26==1)) && ((395 < a12) && (441 >= a12)) ) && (a1==2))) [L1137] COND FALSE !((((!(a13==1) && (((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 3)) && a12 <= 178 )) && (a26==1)) && (a1==4))) [L1145] COND FALSE !((((input == 5) && ((((a19==13) && (( 476 < a23 && 441 < a12 ) && (a1==2))) && !(a13==1)) || (((a19==9) && ((a1==3) && ( a12 <= 178 && a23 <= 95 ))) && (a13==1)))) && (a26==1))) [L1153] COND FALSE !((((a19==9) && (!(a13==1) && (((a26==1) && ((input == 5) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)))) && ((178 < a12) && (395 >= a12)) )) [L1160] COND FALSE !(((( a12 <= 178 && ((((input == 2) && ( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) )) && (a26==1)) && (a19==11))) && (a13==1)) && (a1==4))) [L1166] COND FALSE !(( 441 < a12 && (((!(a13==1) && ((a1==3) && ((input == 3) && (a19==11)))) && a23 <= 95 ) && (a26==1)))) [L1171] COND FALSE !((((a1==3) && ( ((395 < a12) && (441 >= a12)) && ((a19==11) && ( ((264 < a23) && (476 >= a23)) && ((input == 4) && (a13==1)))))) && (a26==1))) [L1178] COND FALSE !(((a26==1) && ((a1==2) && (!(a13==1) && (((a19==11) && ( ((178 < a12) && (395 >= a12)) && (input == 3))) && a23 <= 95 ))))) [L1186] COND FALSE !(((a26==1) && (( ((395 < a12) && (441 >= a12)) && (((a1==3) && ( ((264 < a23) && (476 >= a23)) && (input == 6))) && (a19==11))) && !(a13==1)))) [L1194] COND FALSE !(((a13==1) && ((((a1==4) && ((((a19==10) && a23 <= 95 ) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 6))) && a12 <= 178 ) && (a26==1)))) [L1208] COND FALSE !((((a1==3) && (((a19==12) && ((a26==1) && ((input == 2) && ( ((264 < a23) && (476 >= a23)) || ( a23 <= 95 || ((95 < a23) && (264 >= a23)) ))))) && !(a13==1))) && ((395 < a12) && (441 >= a12)) )) [L1214] COND FALSE !(((!(a13==1) && ((((( a23 <= 95 && (a19==10)) || (((a19==9) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==9)))) && (input == 2)) && (a26==1)) && a12 <= 178 )) && (a1==4))) [L1221] COND FALSE !((!(a13==1) && ( ((264 < a23) && (476 >= a23)) && (((a26==1) && (((a19==10) && (input == 5)) && (a1==2))) && 441 < a12 )))) [L1228] COND FALSE !(((a1==3) && ((a13==1) && ((( ((395 < a12) && (441 >= a12)) && (( a23 <= 95 || ((95 < a23) && (264 >= a23)) ) && (input == 2))) && (a19==13)) && (a26==1))))) [L1235] COND FALSE !((((a1==2) && (((a26==1) && (((( 476 < a23 && (a19==9)) || ( a23 <= 95 && (a19==10))) || ((a19==10) && ((95 < a23) && (264 >= a23)) )) && (input == 6))) && !(a13==1))) && 441 < a12 )) [L1241] COND FALSE !(((a1==3) && ((((((((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )) || ((a19==11) && ((95 < a23) && (264 >= a23)) )) && (input == 5)) && (a26==1)) && !(a13==1)) && ((395 < a12) && (441 >= a12)) ))) [L1249] COND FALSE !((((a1==3) && ((((a19==10) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) || 476 < a23 ) && (input == 3))) && (a26==1)) && 441 < a12 )) && !(a13==1))) [L1255] COND FALSE !((!(a13==1) && ((a26==1) && (( ((178 < a12) && (395 >= a12)) && ((input == 2) && (((a19==10) && 476 < a23 ) || ((a19==11) && a23 <= 95 )))) && (a1==3))))) [L1263] COND FALSE !(( a12 <= 178 && ((a1==3) && ((a13==1) && (((( a23 <= 95 && (a19==13)) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ( 476 < a23 && (a19==12)))) && (input == 6)) && (a26==1)))))) [L1271] COND FALSE !(((a19==9) && ((a26==1) && (((((a1==4) && (input == 4)) && a23 <= 95 ) && a12 <= 178 ) && (a13==1))))) [L1283] COND FALSE !(((!(a13==1) && (((a19==11) && (( a23 <= 95 && (input == 6)) && ((178 < a12) && (395 >= a12)) )) && (a26==1))) && (a1==2))) [L1290] COND FALSE !(((a1==2) && ((!(a13==1) && ((a19==13) && ((a26==1) && (( ((264 < a23) && (476 >= a23)) || 476 < a23 ) && (input == 3))))) && ((178 < a12) && (395 >= a12)) ))) [L1298] COND FALSE !(( 476 < a23 && ((a1==3) && (((((input == 2) && ((395 < a12) && (441 >= a12)) ) && (a13==1)) && (a19==12)) && (a26==1))))) [L1305] COND FALSE !((((a19==9) && (((((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && (a26==1)) && (a1==3)) && ((178 < a12) && (395 >= a12)) )) && !(a13==1))) [L1312] COND FALSE !((!(a13==1) && ( ((395 < a12) && (441 >= a12)) && ((((input == 6) && (((a19==13) && a23 <= 95 ) || (((a19==12) && ((264 < a23) && (476 >= a23)) ) || ((a19==12) && 476 < a23 )))) && (a1==2)) && (a26==1))))) [L1319] COND FALSE !(( ((395 < a12) && (441 >= a12)) && (((((a26==1) && ((input == 4) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 ))) && (a1==3)) && (a13==1)) && (a19==10)))) [L1325] COND FALSE !(((((a13==1) && (((input == 4) && (((a19==12) && ((95 < a23) && (264 >= a23)) ) || (((a19==11) && 476 < a23 ) || ((a19==12) && a23 <= 95 )))) && (a1==3))) && (a26==1)) && a12 <= 178 )) [L1330] COND FALSE !(((a19==11) && ((a26==1) && ((!(a13==1) && (((input == 3) && ( ((264 < a23) && (476 >= a23)) || 476 < a23 )) && ((395 < a12) && (441 >= a12)) )) && (a1==2))))) [L1337] COND FALSE !(((a1==4) && (((a26==1) && ( a12 <= 178 && ((( 476 < a23 && (a19==11)) || ((a19==12) && a23 <= 95 )) && (input == 5)))) && (a13==1)))) [L1343] COND FALSE !(( 441 < a12 && ((a19==13) && (!(a13==1) && ((((input == 4) && (a1==3)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)))))) [L1354] COND TRUE ((a1==2) && ((a26==1) && ((!(a13==1) && ((( ((95 < a23) && (264 >= a23)) || ((264 < a23) && (476 >= a23)) ) && (input == 5)) && (a19==9))) && ((178 < a12) && (395 >= a12)) ))) [L1355] a12 = (((a12 / -5) - 156259) / 5) [L1356] a23 = ((((a23 - 539579) * 1) * 10)/ 9) [L1357] a13 = 1 [L1359] RET return -1; [L5814] EXPR calculate_output(input) [L5814] output = calculate_output(input) [L5806] COND TRUE 1 [L5809] int input; [L5810] input = __VERIFIER_nondet_int() [L5811] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L5814] CALL calculate_output(input) [L29] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L32] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L35] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && !(a13==1))) [L38] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L41] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L44] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && !(a13==1))) [L47] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L50] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L53] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L56] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L59] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L62] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L65] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L68] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==11)) && !(a13==1))) [L71] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L74] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==11)) && (a13==1))) [L77] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1))) [L80] COND FALSE !(((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L83] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L86] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L89] COND FALSE !(((((( a12 <= 178 && a23 <= 95 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L92] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L95] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==9)) && (a13==1))) [L98] COND FALSE !(((((( a12 <= 178 && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && !(a13==1))) [L101] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((95 < a23) && (264 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==10)) && (a13==1))) [L104] COND FALSE !(((((( ((178 < a12) && (395 >= a12)) && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==12)) && (a13==1))) [L107] COND FALSE !(((((( a12 <= 178 && 476 < a23 ) && (a26==1)) && (a1==2)) && (a19==9)) && !(a13==1))) [L110] COND TRUE ((((( a12 <= 178 && ((264 < a23) && (476 >= a23)) ) && (a26==1)) && (a1==2)) && (a19==13)) && (a13==1)) [L111] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 1120 locations, 1 error locations. UNKNOWN Result, 230.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 146.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3739 SDtfs, 5619 SDslu, 2447 SDs, 0 SdLazy, 28720 SolverSat, 3114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 136.9s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 363 GetRequests, 270 SyntacticMatches, 56 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4337occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 68.7s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9929792956086058 AbsIntWeakeningRatio, 0.16379310344827586 AbsIntAvgWeakeningVarsNumRemoved, 132.1494252873563 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_11-59-52-311.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem13_label17_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_11-59-52-311.csv Completed graceful shutdown