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_OCT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 20:10:20,521 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 20:10:20,524 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 20:10:20,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 20:10:20,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 20:10:20,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 20:10:20,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 20:10:20,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 20:10:20,545 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 20:10:20,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 20:10:20,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 20:10:20,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 20:10:20,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 20:10:20,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 20:10:20,552 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 20:10:20,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 20:10:20,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 20:10:20,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 20:10:20,558 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 20:10:20,560 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 20:10:20,561 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 20:10:20,562 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 20:10:20,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 20:10:20,569 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 20:10:20,569 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 20:10:20,570 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 20:10:20,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 20:10:20,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 20:10:20,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 20:10:20,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 20:10:20,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 20:10:20,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 20:10:20,583 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 20:10:20,583 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 20:10:20,584 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 20:10:20,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 20:10:20,589 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf [2018-09-15 20:10:20,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 20:10:20,613 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 20:10:20,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 20:10:20,615 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 20:10:20,615 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 20:10:20,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 20:10:20,616 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-15 20:10:20,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 20:10:20,616 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2018-09-15 20:10:20,617 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 20:10:20,617 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 20:10:20,618 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 20:10:20,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 20:10:20,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 20:10:20,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 20:10:20,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 20:10:20,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 20:10:20,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 20:10:20,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 20:10:20,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 20:10:20,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 20:10:20,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 20:10:20,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 20:10:20,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 20:10:20,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 20:10:20,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 20:10:20,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 20:10:20,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 20:10:20,624 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 20:10:20,624 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 20:10:20,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 20:10:20,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 20:10:20,625 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 20:10:20,625 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 20:10:20,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 20:10:20,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 20:10:20,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 20:10:20,698 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 20:10:20,698 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 20:10:20,699 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c [2018-09-15 20:10:21,102 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586e9f020/60e881f1636747e6bd482f09bcf14d65/FLAGf25e9cd1a [2018-09-15 20:10:21,411 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 20:10:21,412 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c [2018-09-15 20:10:21,431 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586e9f020/60e881f1636747e6bd482f09bcf14d65/FLAGf25e9cd1a [2018-09-15 20:10:21,456 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586e9f020/60e881f1636747e6bd482f09bcf14d65 [2018-09-15 20:10:21,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 20:10:21,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 20:10:21,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 20:10:21,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 20:10:21,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 20:10:21,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:21" (1/1) ... [2018-09-15 20:10:21,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@458d7866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:21, skipping insertion in model container [2018-09-15 20:10:21,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:10:21" (1/1) ... [2018-09-15 20:10:21,511 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 20:10:22,050 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 20:10:22,070 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 20:10:22,244 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 20:10:22,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22 WrapperNode [2018-09-15 20:10:22,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 20:10:22,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 20:10:22,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 20:10:22,315 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 20:10:22,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 20:10:22,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 20:10:22,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 20:10:22,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 20:10:22,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (1/1) ... [2018-09-15 20:10:22,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 20:10:22,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 20:10:22,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 20:10:22,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 20:10:22,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (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 20:10:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 20:10:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 20:10:22,835 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 20:10:22,835 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 20:10:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 20:10:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 20:10:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 20:10:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 20:10:26,631 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 20:10:26,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:26 BoogieIcfgContainer [2018-09-15 20:10:26,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 20:10:26,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 20:10:26,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 20:10:26,637 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 20:10:26,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:10:21" (1/3) ... [2018-09-15 20:10:26,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4729a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:26, skipping insertion in model container [2018-09-15 20:10:26,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:10:22" (2/3) ... [2018-09-15 20:10:26,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4729a0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:10:26, skipping insertion in model container [2018-09-15 20:10:26,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:10:26" (3/3) ... [2018-09-15 20:10:26,641 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label49_true-unreach-call_false-termination.c [2018-09-15 20:10:26,652 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 20:10:26,661 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 20:10:26,717 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 20:10:26,718 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 20:10:26,719 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 20:10:26,719 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 20:10:26,719 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 20:10:26,719 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 20:10:26,719 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 20:10:26,719 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 20:10:26,720 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 20:10:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-15 20:10:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-15 20:10:26,758 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:10:26,760 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, 1, 1, 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 20:10:26,761 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:10:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash -825405036, now seen corresponding path program 1 times [2018-09-15 20:10:26,769 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:10:26,771 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 67 with the following transitions: [2018-09-15 20:10:26,774 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-15 20:10:26,838 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:10:26,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:10:29,283 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:10:29,285 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 20:10:29,303 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:10:30,327 INFO L232 lantSequenceWeakener]: Weakened 64 states. On average, predicates are now at 80.79% of their original sizes. [2018-09-15 20:10:30,327 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:10:30,585 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:10:30,586 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:10:30,587 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-15 20:10:30,587 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:10:30,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-15 20:10:30,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-15 20:10:30,599 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-15 20:10:30,602 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-15 20:10:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:10:36,639 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-15 20:10:36,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-15 20:10:36,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-09-15 20:10:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:10:36,662 INFO L225 Difference]: With dead ends: 693 [2018-09-15 20:10:36,663 INFO L226 Difference]: Without dead ends: 436 [2018-09-15 20:10:36,670 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 65 GetRequests, 61 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 20:10:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-15 20:10:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-15 20:10:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-15 20:10:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-15 20:10:36,751 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 66 [2018-09-15 20:10:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:10:36,751 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-15 20:10:36,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-15 20:10:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-15 20:10:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-15 20:10:36,759 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:10:36,759 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, 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] [2018-09-15 20:10:36,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:10:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1841924003, now seen corresponding path program 1 times [2018-09-15 20:10:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:10:36,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-09-15 20:10:36,761 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:10:36,770 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:10:36,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:10:46,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:10:46,483 INFO L272 AbstractInterpreter]: Visited 92 different actions 177 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 20:10:46,492 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:10:48,720 INFO L232 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 78.85% of their original sizes. [2018-09-15 20:10:48,720 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:10:52,331 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:10:52,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:10:52,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-15 20:10:52,332 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:10:52,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-15 20:10:52,335 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-15 20:10:52,335 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-15 20:10:52,335 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 14 states. [2018-09-15 20:11:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:11:09,802 INFO L93 Difference]: Finished difference Result 1340 states and 2335 transitions. [2018-09-15 20:11:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-15 20:11:09,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 151 [2018-09-15 20:11:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:11:09,814 INFO L225 Difference]: With dead ends: 1340 [2018-09-15 20:11:09,815 INFO L226 Difference]: Without dead ends: 1095 [2018-09-15 20:11:09,821 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 39 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-09-15 20:11:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-15 20:11:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 850. [2018-09-15 20:11:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-09-15 20:11:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1058 transitions. [2018-09-15 20:11:09,895 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1058 transitions. Word has length 151 [2018-09-15 20:11:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:11:09,897 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1058 transitions. [2018-09-15 20:11:09,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-15 20:11:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1058 transitions. [2018-09-15 20:11:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-15 20:11:09,903 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:11:09,904 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, 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] [2018-09-15 20:11:09,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:11:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1896583951, now seen corresponding path program 1 times [2018-09-15 20:11:09,904 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:11:09,905 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 178 with the following transitions: [2018-09-15 20:11:09,905 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:11:09,911 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:11:09,911 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:11:21,819 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:11:21,820 INFO L272 AbstractInterpreter]: Visited 118 different actions 230 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 20:11:21,831 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:11:23,488 INFO L232 lantSequenceWeakener]: Weakened 175 states. On average, predicates are now at 78.61% of their original sizes. [2018-09-15 20:11:23,489 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:11:23,866 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:11:23,867 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:11:23,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-15 20:11:23,867 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:11:23,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-15 20:11:23,868 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-15 20:11:23,868 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-09-15 20:11:23,869 INFO L87 Difference]: Start difference. First operand 850 states and 1058 transitions. Second operand 12 states. [2018-09-15 20:11:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:11:34,171 INFO L93 Difference]: Finished difference Result 1283 states and 1842 transitions. [2018-09-15 20:11:34,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 20:11:34,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 177 [2018-09-15 20:11:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:11:34,191 INFO L225 Difference]: With dead ends: 1283 [2018-09-15 20:11:34,191 INFO L226 Difference]: Without dead ends: 1038 [2018-09-15 20:11:34,193 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 185 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-09-15 20:11:34,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-09-15 20:11:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2018-09-15 20:11:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-09-15 20:11:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1256 transitions. [2018-09-15 20:11:34,233 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1256 transitions. Word has length 177 [2018-09-15 20:11:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:11:34,234 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1256 transitions. [2018-09-15 20:11:34,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-15 20:11:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1256 transitions. [2018-09-15 20:11:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-15 20:11:34,241 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:11:34,241 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:11:34,241 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:11:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1373957856, now seen corresponding path program 1 times [2018-09-15 20:11:34,242 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:11:34,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-15 20:11:34,243 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:11:34,249 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:11:34,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:12:02,675 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:12:02,676 INFO L272 AbstractInterpreter]: Visited 119 different actions 467 times. Merged at 7 different actions 24 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 20:12:02,683 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:12:04,897 INFO L232 lantSequenceWeakener]: Weakened 260 states. On average, predicates are now at 78.23% of their original sizes. [2018-09-15 20:12:04,897 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:12:09,477 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:12:09,477 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:12:09,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-15 20:12:09,478 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:12:09,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-15 20:12:09,479 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-15 20:12:09,480 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-09-15 20:12:09,480 INFO L87 Difference]: Start difference. First operand 1035 states and 1256 transitions. Second operand 17 states. [2018-09-15 20:12:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:12:26,815 INFO L93 Difference]: Finished difference Result 2673 states and 3868 transitions. [2018-09-15 20:12:26,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-15 20:12:26,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 262 [2018-09-15 20:12:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:12:26,827 INFO L225 Difference]: With dead ends: 2673 [2018-09-15 20:12:26,827 INFO L226 Difference]: Without dead ends: 2012 [2018-09-15 20:12:26,832 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 282 GetRequests, 179 SyntacticMatches, 67 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=312, Invalid=1094, Unknown=0, NotChecked=0, Total=1406 [2018-09-15 20:12:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2018-09-15 20:12:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1652. [2018-09-15 20:12:26,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-09-15 20:12:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1949 transitions. [2018-09-15 20:12:26,893 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1949 transitions. Word has length 262 [2018-09-15 20:12:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:12:26,893 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 1949 transitions. [2018-09-15 20:12:26,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-15 20:12:26,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1949 transitions. [2018-09-15 20:12:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-15 20:12:26,901 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:12:26,901 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 20:12:26,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:12:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 976289219, now seen corresponding path program 1 times [2018-09-15 20:12:26,902 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:12:26,902 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-09-15 20:12:26,902 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:12:26,920 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:12:26,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:12:37,202 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:12:54,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:12:54,109 INFO L272 AbstractInterpreter]: Visited 119 different actions 580 times. Merged at 7 different actions 29 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 20:12:54,113 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:12:56,268 INFO L232 lantSequenceWeakener]: Weakened 285 states. On average, predicates are now at 78.15% of their original sizes. [2018-09-15 20:12:56,268 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:12:56,621 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:12:56,622 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:12:56,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-15 20:12:56,622 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:12:56,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-15 20:12:56,623 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-15 20:12:56,623 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-09-15 20:12:56,623 INFO L87 Difference]: Start difference. First operand 1652 states and 1949 transitions. Second operand 11 states. [2018-09-15 20:13:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:13:10,041 INFO L93 Difference]: Finished difference Result 2274 states and 3101 transitions. [2018-09-15 20:13:10,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-15 20:13:10,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 287 [2018-09-15 20:13:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:13:10,052 INFO L225 Difference]: With dead ends: 2274 [2018-09-15 20:13:10,053 INFO L226 Difference]: Without dead ends: 2029 [2018-09-15 20:13:10,055 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 297 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-09-15 20:13:10,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2018-09-15 20:13:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2022. [2018-09-15 20:13:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-09-15 20:13:10,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2383 transitions. [2018-09-15 20:13:10,128 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2383 transitions. Word has length 287 [2018-09-15 20:13:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:13:10,128 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 2383 transitions. [2018-09-15 20:13:10,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-15 20:13:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2383 transitions. [2018-09-15 20:13:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-15 20:13:10,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:13:10,139 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-15 20:13:10,139 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:13:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash -578198601, now seen corresponding path program 1 times [2018-09-15 20:13:10,139 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:13:10,140 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2018-09-15 20:13:10,140 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:13:10,144 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:13:10,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:13:20,571 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:13:45,745 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:13:45,746 INFO L272 AbstractInterpreter]: Visited 120 different actions 827 times. Merged at 8 different actions 53 times. Widened at 1 different actions 2 times. Found 11 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 20:13:45,753 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:13:47,408 INFO L232 lantSequenceWeakener]: Weakened 363 states. On average, predicates are now at 77.99% of their original sizes. [2018-09-15 20:13:47,409 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:13:47,662 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:13:47,662 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:13:47,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 20:13:47,663 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:13:47,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 20:13:47,663 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 20:13:47,663 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 20:13:47,664 INFO L87 Difference]: Start difference. First operand 2022 states and 2383 transitions. Second operand 10 states. [2018-09-15 20:13:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:13:53,645 INFO L93 Difference]: Finished difference Result 3049 states and 3862 transitions. [2018-09-15 20:13:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 20:13:53,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 365 [2018-09-15 20:13:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:13:53,658 INFO L225 Difference]: With dead ends: 3049 [2018-09-15 20:13:53,658 INFO L226 Difference]: Without dead ends: 2434 [2018-09-15 20:13:53,662 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 372 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 20:13:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2018-09-15 20:13:53,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2418. [2018-09-15 20:13:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2018-09-15 20:13:53,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 2863 transitions. [2018-09-15 20:13:53,755 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 2863 transitions. Word has length 365 [2018-09-15 20:13:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:13:53,756 INFO L480 AbstractCegarLoop]: Abstraction has 2418 states and 2863 transitions. [2018-09-15 20:13:53,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 20:13:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 2863 transitions. [2018-09-15 20:13:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-09-15 20:13:53,764 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:13:53,764 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 20:13:53,765 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:13:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1102495632, now seen corresponding path program 1 times [2018-09-15 20:13:53,765 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:13:53,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 391 with the following transitions: [2018-09-15 20:13:53,766 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:13:53,769 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:13:53,769 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 20:14:04,218 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-15 20:14:30,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 20:14:30,830 INFO L272 AbstractInterpreter]: Visited 120 different actions 829 times. Merged at 8 different actions 55 times. Widened at 1 different actions 2 times. Found 12 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 20:14:30,837 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 20:14:33,413 INFO L232 lantSequenceWeakener]: Weakened 388 states. On average, predicates are now at 77.94% of their original sizes. [2018-09-15 20:14:33,413 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 20:14:33,767 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 20:14:33,767 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 20:14:33,768 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-15 20:14:33,768 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 20:14:33,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-15 20:14:33,769 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-15 20:14:33,769 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-15 20:14:33,770 INFO L87 Difference]: Start difference. First operand 2418 states and 2863 transitions. Second operand 10 states. [2018-09-15 20:14:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 20:14:41,605 INFO L93 Difference]: Finished difference Result 3659 states and 4612 transitions. [2018-09-15 20:14:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-15 20:14:41,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 390 [2018-09-15 20:14:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 20:14:41,619 INFO L225 Difference]: With dead ends: 3659 [2018-09-15 20:14:41,620 INFO L226 Difference]: Without dead ends: 2650 [2018-09-15 20:14:41,625 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 397 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-15 20:14:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2018-09-15 20:14:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2629. [2018-09-15 20:14:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2018-09-15 20:14:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3127 transitions. [2018-09-15 20:14:41,739 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3127 transitions. Word has length 390 [2018-09-15 20:14:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 20:14:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 2629 states and 3127 transitions. [2018-09-15 20:14:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-15 20:14:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3127 transitions. [2018-09-15 20:14:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-09-15 20:14:41,751 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 20:14:41,752 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 20:14:41,752 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 20:14:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2095439897, now seen corresponding path program 1 times [2018-09-15 20:14:41,753 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 20:14:41,753 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 406 with the following transitions: [2018-09-15 20:14:41,754 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [429], [431], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-15 20:14:41,758 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2018-09-15 20:14:41,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-09-15 20:14:42,693 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-15 20:14:42,694 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-15 20:14:42,695 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 20:14:42,756 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 20:14:42,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:14:42 BoogieIcfgContainer [2018-09-15 20:14:42,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 20:14:42,758 INFO L168 Benchmark]: Toolchain (without parser) took 261284.62 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,760 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 20:14:42,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,762 INFO L168 Benchmark]: Boogie Preprocessor took 295.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -898.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,763 INFO L168 Benchmark]: RCFGBuilder took 3859.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,764 INFO L168 Benchmark]: TraceAbstraction took 256123.77 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-15 20:14:42,769 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.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 161.34 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 295.27 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 777.5 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -898.4 MB). Peak memory consumption was 37.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3859.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256123.77 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 181]: 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: [L7] int inputD = 4; [L8] int inputB = 2; [L9] int inputC = 3; [L10] int inputF = 6; [L11] int inputE = 5; [L12] int inputA = 1; [L15] int a21 = 7; [L16] int a15 = 8; [L17] int a12 = -49; [L18] int a24 = 1; [L877] int output = -1; [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND TRUE (((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8)) [L451] a21 = 10 [L453] RET return 22; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND TRUE ((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8)) [L445] a12 = ((((a12 % 26)+ -1) / 5) / 5) [L446] a21 = 7 [L448] RET return 25; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL, EXPR calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L183] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==7))) [L186] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L189] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==6))) [L192] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L195] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L198] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==7))) [L201] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L205] COND FALSE !((((a24==1) && ( ((11 < a12) && (80 >= a12)) && ((input == 5) && (a15==8)))) && (a21==9))) [L211] COND FALSE !((((a15==9) && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 5)) && a12 <= -43 )) && (a24==1))) [L217] COND FALSE !(((a15==9) && (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (input == 2))) && (a21==8)))) [L223] COND FALSE !(((a24==1) && ((a15==8) && ( ((11 < a12) && (80 >= a12)) && ((input == 1) && ((a21==7) || (a21==8))))))) [L229] COND FALSE !((((((a21==10) && ( 80 < a12 && (a15==8))) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 2)) && (a24==1))) [L235] COND FALSE !(((a24==1) && ((a15==9) && ((((a21==6) && 80 < a12 ) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))) && (input == 5))))) [L241] COND FALSE !((( a12 <= -43 && ((((a21==9) || ((a21==7) || (a21==8))) && (input == 4)) && (a24==1))) && (a15==9))) [L247] COND FALSE !((((((input == 2) && (a24==1)) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8))) [L252] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 2)) && (a24==1)) && (a15==8))) [L258] COND FALSE !(((a15==9) && (((input == 1) && ((( a12 <= -43 && (a21==10)) || ((a21==6) && ((-43 < a12) && (11 >= a12)) )) || ( ((-43 < a12) && (11 >= a12)) && (a21==7)))) && (a24==1)))) [L264] COND FALSE !((((a24==1) && (((input == 6) && ((a21==7) || (a21==8))) && 80 < a12 )) && (a15==9))) [L269] COND FALSE !(( ((-43 < a12) && (11 >= a12)) && ((a15==9) && ((a24==1) && (((a21==9) || (a21==10)) && (input == 2)))))) [L275] COND FALSE !((((((input == 5) && (a15==8)) && ((-43 < a12) && (11 >= a12)) ) && (a21==9)) && (a24==1))) [L280] COND FALSE !((( 80 < a12 && ((a15==8) && (((a21==8) || (a21==9)) && (input == 3)))) && (a24==1))) [L286] COND FALSE !(((input == 4) && ((((a15==9) && ((a24==1) && 80 < a12 )) && (a21==10)) || ((a21==6) && ((a15==5) && ((a24==2) && a12 <= -43 )))))) [L293] COND FALSE !(((((a24==1) && ((input == 3) && a12 <= -43 )) && (a21==7)) && (a15==8))) [L299] COND FALSE !(((a24==1) && (((( 80 < a12 && (a15==8)) && (a21==10)) || (((a15==9) && a12 <= -43 ) && (a21==6))) && (input == 3)))) [L305] COND FALSE !((((a24==1) && ((a15==9) && (((a21==7) || (a21==8)) && (input == 3)))) && 80 < a12 )) [L311] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 5)) && a12 <= -43 ) && (a15==8)) && (a24==1))) [L317] COND FALSE !(((((a15==9) && ((input == 1) && (a21==8))) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L323] COND FALSE !((((((((a21==8) || (a21==9)) || (a21==10)) && (input == 3)) && (a15==8)) && a12 <= -43 ) && (a24==1))) [L329] COND FALSE !(((a24==1) && (((a15==8) && ((input == 1) && (a21==9))) && ((11 < a12) && (80 >= a12)) ))) [L335] COND FALSE !(((a15==9) && ( 80 < a12 && ((a24==1) && (((a21==7) || (a21==8)) && (input == 4)))))) [L341] COND FALSE !(( 80 < a12 && ((a15==9) && (((input == 2) && ((a21==7) || (a21==8))) && (a24==1))))) [L347] COND FALSE !((((((input == 6) && ((11 < a12) && (80 >= a12)) ) && (a21==9)) && (a15==8)) && (a24==1))) [L353] COND FALSE !(((((a24==1) && ((input == 1) && ((a21==8) || ((a21==6) || (a21==7))))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L359] COND FALSE !(((((a21==10) && (( 80 < a12 && (a24==1)) && (a15==9))) || (((a15==5) && ((a24==2) && a12 <= -43 )) && (a21==6))) && (input == 3))) [L366] COND FALSE !(((((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 5)) && (a24==1)) && (a15==9))) [L372] COND FALSE !((((((input == 1) && (((a21==7) || (a21==8)) || (a21==9))) && (a15==9)) && a12 <= -43 ) && (a24==1))) [L378] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && ((-43 < a12) && (11 >= a12)) ) && (a21==8))))) [L384] COND FALSE !((((a24==1) && ((a15==9) && ((input == 5) && ((a21==8) || ((a21==6) || (a21==7)))))) && ((11 < a12) && (80 >= a12)) )) [L390] COND FALSE !(((((a15==8) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 5))) && ((-43 < a12) && (11 >= a12)) ) && (a24==1))) [L396] COND FALSE !(((a15==9) && ((((input == 3) && (((a21==6) || (a21==7)) || (a21==8))) && (a24==1)) && ((11 < a12) && (80 >= a12)) ))) [L402] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a15==8) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 3)))) && (a24==1))) [L408] COND FALSE !(((a15==9) && ((a24==1) && ((((a21==9) || (a21==10)) && (input == 5)) && ((-43 < a12) && (11 >= a12)) )))) [L414] COND FALSE !(( ((11 < a12) && (80 >= a12)) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 4))) && (a15==9)))) [L420] COND FALSE !(((a15==9) && ((a24==1) && (((input == 6) && 80 < a12 ) && (a21==9))))) [L426] COND FALSE !((((a24==1) && (((input == 2) && ((a21==10) || ((a21==8) || (a21==9)))) && a12 <= -43 )) && (a15==8))) [L432] COND FALSE !(((a24==1) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))))) && (a15==9)))) [L438] COND FALSE !((((((input == 6) && ((a21==9) || ((a21==7) || (a21==8)))) && (a24==1)) && (a15==9)) && a12 <= -43 )) [L444] COND FALSE !(((( a12 <= -43 && ((input == 6) && ((a21==10) || ((a21==8) || (a21==9))))) && (a24==1)) && (a15==8))) [L449] COND FALSE !((((((a21==7) && (input == 5)) && a12 <= -43 ) && (a24==1)) && (a15==8))) [L454] COND FALSE !((((a15==9) && ((((a21==9) || (a21==10)) && (input == 4)) && ((-43 < a12) && (11 >= a12)) )) && (a24==1))) [L460] COND FALSE !(((((( 80 < a12 && (a24==1)) && (a15==9)) && (a21==10)) || ((( a12 <= -43 && (a24==2)) && (a15==5)) && (a21==6))) && (input == 2))) [L467] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (((a21==9) || (a21==10)) && (input == 3))) && (a15==9)) && (a24==1))) [L472] COND FALSE !((((a15==8) && ( 80 < a12 && (((a21==8) || (a21==9)) && (input == 6)))) && (a24==1))) [L478] COND FALSE !((((((( a12 <= -43 && (a21==10)) || ( ((-43 < a12) && (11 >= a12)) && (a21==6))) || ((a21==7) && ((-43 < a12) && (11 >= a12)) )) && (input == 3)) && (a24==1)) && (a15==9))) [L484] COND FALSE !(((a24==1) && ((input == 1) && (((a21==10) && ((a15==8) && 80 < a12 )) || (( a12 <= -43 && (a15==9)) && (a21==6)))))) [L490] COND TRUE (( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8)) [L492] a21 = 9 [L494] RET return 21; [L888] EXPR calculate_output(input) [L888] output = calculate_output(input) [L880] COND TRUE 1 [L883] int input; [L884] input = __VERIFIER_nondet_int() [L885] COND FALSE !((input != 1) && (input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L888] CALL calculate_output(input) [L21] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==6))) [L24] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==8))) [L27] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L30] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==9))) [L33] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L36] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==6))) [L39] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L42] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==9))) [L45] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==10))) [L48] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==10))) [L51] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L54] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==8))) [L57] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==9))) [L60] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==7))) [L63] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==10))) [L66] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==8))) [L69] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L72] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==8))) [L75] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==10))) [L78] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==6))) [L81] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==6))) [L84] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==6))) [L87] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==7))) [L90] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L93] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==9))) [L96] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==6))) [L99] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==10))) [L102] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==9))) [L105] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==6)) && (a21==8))) [L108] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L111] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L114] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==7))) [L117] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L120] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==7)) && (a21==8))) [L123] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==8)) && (a21==6))) [L126] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==6)) && (a21==6))) [L129] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==7)) && (a21==9))) [L132] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==7))) [L135] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==7))) [L138] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L141] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==8))) [L144] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==9))) [L147] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==8))) [L150] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==10))) [L153] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==6)) && (a21==10))) [L156] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==10))) [L159] COND FALSE !(((( ((-43 < a12) && (11 >= a12)) && (a24==1)) && (a15==5)) && (a21==6))) [L162] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==7))) [L165] COND FALSE !(((( a12 <= -43 && (a24==1)) && (a15==5)) && (a21==8))) [L168] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==9))) [L171] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==5)) && (a21==9))) [L174] COND FALSE !(((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7))) [L177] COND FALSE !(((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==6)) && (a21==10))) [L180] COND TRUE ((( ((11 < a12) && (80 >= a12)) && (a24==1)) && (a15==7)) && (a21==6)) [L181] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 256.0s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 78.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1610 SDtfs, 9441 SDslu, 2928 SDs, 0 SdLazy, 19130 SolverSat, 2629 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 69.0s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 1761 GetRequests, 1519 SyntacticMatches, 106 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2629occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 153.4s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9954157443615697 AbsIntWeakeningRatio, 0.10053222945002957 AbsIntAvgWeakeningVarsNumRemoved, 438.4648137196925 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 654 StatesRemovedByMinimization, 7 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/Problem14_label49_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_20-14-42-784.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label49_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_OCT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_20-14-42-784.csv Completed graceful shutdown