java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 04:11:30,147 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 04:11:30,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 04:11:30,164 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 04:11:30,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 04:11:30,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 04:11:30,168 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 04:11:30,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 04:11:30,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 04:11:30,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 04:11:30,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 04:11:30,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 04:11:30,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 04:11:30,181 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 04:11:30,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 04:11:30,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 04:11:30,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 04:11:30,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 04:11:30,199 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 04:11:30,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 04:11:30,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 04:11:30,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 04:11:30,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 04:11:30,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 04:11:30,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 04:11:30,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 04:11:30,217 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 04:11:30,218 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 04:11:30,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 04:11:30,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 04:11:30,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 04:11:30,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 04:11:30,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 04:11:30,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 04:11:30,226 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 04:11:30,227 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 04:11:30,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf [2018-09-19 04:11:30,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 04:11:30,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 04:11:30,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 04:11:30,251 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 04:11:30,251 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 04:11:30,251 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 04:11:30,252 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 04:11:30,252 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-19 04:11:30,252 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 04:11:30,252 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 04:11:30,252 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 04:11:30,253 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-19 04:11:30,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 04:11:30,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 04:11:30,254 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 04:11:30,254 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 04:11:30,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 04:11:30,254 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 04:11:30,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 04:11:30,255 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 04:11:30,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 04:11:30,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 04:11:30,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 04:11:30,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 04:11:30,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 04:11:30,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 04:11:30,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 04:11:30,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 04:11:30,256 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 04:11:30,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 04:11:30,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 04:11:30,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 04:11:30,257 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 04:11:30,257 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 04:11:30,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 04:11:30,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 04:11:30,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 04:11:30,344 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 04:11:30,345 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 04:11:30,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-19 04:11:30,768 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d5b1175/292eae159d554661a73279c26756e8f9/FLAG36341ac77 [2018-09-19 04:11:31,147 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 04:11:31,149 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55_true-unreach-call_false-termination.c [2018-09-19 04:11:31,180 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d5b1175/292eae159d554661a73279c26756e8f9/FLAG36341ac77 [2018-09-19 04:11:31,201 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d5b1175/292eae159d554661a73279c26756e8f9 [2018-09-19 04:11:31,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 04:11:31,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 04:11:31,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 04:11:31,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 04:11:31,230 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 04:11:31,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:11:31" (1/1) ... [2018-09-19 04:11:31,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f414e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:31, skipping insertion in model container [2018-09-19 04:11:31,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:11:31" (1/1) ... [2018-09-19 04:11:31,249 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 04:11:31,875 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:11:31,900 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 04:11:32,070 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 04:11:32,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32 WrapperNode [2018-09-19 04:11:32,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 04:11:32,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 04:11:32,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 04:11:32,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 04:11:32,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 04:11:32,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 04:11:32,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 04:11:32,296 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 04:11:32,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (1/1) ... [2018-09-19 04:11:32,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 04:11:32,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 04:11:32,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 04:11:32,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 04:11:32,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (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-19 04:11:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 04:11:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 04:11:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 04:11:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 04:11:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 04:11:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 04:11:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 04:11:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 04:11:36,615 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 04:11:36,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:11:36 BoogieIcfgContainer [2018-09-19 04:11:36,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 04:11:36,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 04:11:36,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 04:11:36,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 04:11:36,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:11:31" (1/3) ... [2018-09-19 04:11:36,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530daf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:11:36, skipping insertion in model container [2018-09-19 04:11:36,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:11:32" (2/3) ... [2018-09-19 04:11:36,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1530daf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:11:36, skipping insertion in model container [2018-09-19 04:11:36,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:11:36" (3/3) ... [2018-09-19 04:11:36,627 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55_true-unreach-call_false-termination.c [2018-09-19 04:11:36,638 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 04:11:36,648 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 04:11:36,707 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 04:11:36,708 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 04:11:36,708 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 04:11:36,708 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 04:11:36,708 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 04:11:36,709 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 04:11:36,709 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 04:11:36,709 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 04:11:36,709 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 04:11:36,738 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-09-19 04:11:36,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 04:11:36,749 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:11:36,750 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] [2018-09-19 04:11:36,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:11:36,757 INFO L82 PathProgramCache]: Analyzing trace with hash -353931284, now seen corresponding path program 1 times [2018-09-19 04:11:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:11:36,761 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-09-19 04:11:36,764 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], [413], [415], [952], [956], [962], [966], [973], [974], [975], [977] [2018-09-19 04:11:36,828 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:11:36,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:11:38,424 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:11:38,426 INFO L272 AbstractInterpreter]: Visited 63 different actions 63 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 04:11:38,446 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:11:39,289 INFO L232 lantSequenceWeakener]: Weakened 62 states. On average, predicates are now at 80.76% of their original sizes. [2018-09-19 04:11:39,289 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:11:39,581 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:11:39,583 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:11:39,583 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 04:11:39,583 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:11:39,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 04:11:39,599 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 04:11:39,600 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 04:11:39,603 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 6 states. [2018-09-19 04:11:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:11:42,979 INFO L93 Difference]: Finished difference Result 693 states and 1229 transitions. [2018-09-19 04:11:42,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 04:11:42,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-09-19 04:11:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:11:43,000 INFO L225 Difference]: With dead ends: 693 [2018-09-19 04:11:43,000 INFO L226 Difference]: Without dead ends: 436 [2018-09-19 04:11:43,008 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 63 GetRequests, 59 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-19 04:11:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-19 04:11:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2018-09-19 04:11:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-19 04:11:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 615 transitions. [2018-09-19 04:11:43,092 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 615 transitions. Word has length 64 [2018-09-19 04:11:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:11:43,093 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 615 transitions. [2018-09-19 04:11:43,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 04:11:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 615 transitions. [2018-09-19 04:11:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-19 04:11:43,101 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:11:43,102 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 04:11:43,102 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:11:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 342897051, now seen corresponding path program 1 times [2018-09-19 04:11:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:11:43,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-09-19 04:11:43,103 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], [413], [415], [418], [426], [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-19 04:11:43,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:11:43,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:11:46,765 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:11:46,765 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-19 04:11:46,775 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:11:47,888 INFO L232 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 78.81% of their original sizes. [2018-09-19 04:11:47,888 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:11:48,646 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:11:48,647 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:11:48,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:11:48,647 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:11:48,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:11:48,649 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:11:48,649 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:11:48,650 INFO L87 Difference]: Start difference. First operand 434 states and 615 transitions. Second operand 14 states. [2018-09-19 04:12:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:12:00,021 INFO L93 Difference]: Finished difference Result 1340 states and 2335 transitions. [2018-09-19 04:12:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-19 04:12:00,022 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2018-09-19 04:12:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:12:00,034 INFO L225 Difference]: With dead ends: 1340 [2018-09-19 04:12:00,035 INFO L226 Difference]: Without dead ends: 1095 [2018-09-19 04:12:00,039 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 161 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2018-09-19 04:12:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-19 04:12:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 850. [2018-09-19 04:12:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-09-19 04:12:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1058 transitions. [2018-09-19 04:12:00,128 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1058 transitions. Word has length 149 [2018-09-19 04:12:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:12:00,129 INFO L480 AbstractCegarLoop]: Abstraction has 850 states and 1058 transitions. [2018-09-19 04:12:00,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:12:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1058 transitions. [2018-09-19 04:12:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-19 04:12:00,135 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:12:00,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 04:12:00,136 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:12:00,136 INFO L82 PathProgramCache]: Analyzing trace with hash -961343481, now seen corresponding path program 1 times [2018-09-19 04:12:00,137 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:12:00,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-09-19 04:12:00,137 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], [413], [415], [418], [426], [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-19 04:12:00,144 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:12:00,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:12:05,258 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:12:05,259 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-19 04:12:05,273 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:12:06,467 INFO L232 lantSequenceWeakener]: Weakened 173 states. On average, predicates are now at 78.58% of their original sizes. [2018-09-19 04:12:06,468 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:12:07,544 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:12:07,544 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:12:07,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-19 04:12:07,545 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:12:07,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-19 04:12:07,546 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-19 04:12:07,546 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-09-19 04:12:07,547 INFO L87 Difference]: Start difference. First operand 850 states and 1058 transitions. Second operand 11 states. [2018-09-19 04:12:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:12:15,750 INFO L93 Difference]: Finished difference Result 1283 states and 1842 transitions. [2018-09-19 04:12:15,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 04:12:15,755 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2018-09-19 04:12:15,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:12:15,764 INFO L225 Difference]: With dead ends: 1283 [2018-09-19 04:12:15,764 INFO L226 Difference]: Without dead ends: 1038 [2018-09-19 04:12:15,766 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 182 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-09-19 04:12:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2018-09-19 04:12:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2018-09-19 04:12:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-09-19 04:12:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1256 transitions. [2018-09-19 04:12:15,808 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1256 transitions. Word has length 175 [2018-09-19 04:12:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:12:15,809 INFO L480 AbstractCegarLoop]: Abstraction has 1035 states and 1256 transitions. [2018-09-19 04:12:15,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-19 04:12:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1256 transitions. [2018-09-19 04:12:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-19 04:12:15,818 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:12:15,819 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, 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] [2018-09-19 04:12:15,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:12:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash -2113089928, now seen corresponding path program 1 times [2018-09-19 04:12:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:12:15,820 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-19 04:12:15,823 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], [413], [415], [418], [426], [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-19 04:12:15,834 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:12:15,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:12:23,796 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:12:23,796 INFO L272 AbstractInterpreter]: Visited 119 different actions 352 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:12:23,835 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:12:25,912 INFO L232 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 78.18% of their original sizes. [2018-09-19 04:12:25,912 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:12:27,145 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:12:27,146 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:12:27,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-19 04:12:27,146 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:12:27,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-19 04:12:27,148 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-19 04:12:27,148 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-09-19 04:12:27,148 INFO L87 Difference]: Start difference. First operand 1035 states and 1256 transitions. Second operand 16 states. [2018-09-19 04:12:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:12:37,778 INFO L93 Difference]: Finished difference Result 2673 states and 3868 transitions. [2018-09-19 04:12:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-19 04:12:37,778 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 260 [2018-09-19 04:12:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:12:37,791 INFO L225 Difference]: With dead ends: 2673 [2018-09-19 04:12:37,791 INFO L226 Difference]: Without dead ends: 2012 [2018-09-19 04:12:37,797 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 278 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2018-09-19 04:12:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2018-09-19 04:12:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1652. [2018-09-19 04:12:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2018-09-19 04:12:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1949 transitions. [2018-09-19 04:12:37,855 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1949 transitions. Word has length 260 [2018-09-19 04:12:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:12:37,856 INFO L480 AbstractCegarLoop]: Abstraction has 1652 states and 1949 transitions. [2018-09-19 04:12:37,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-19 04:12:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1949 transitions. [2018-09-19 04:12:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-19 04:12:37,863 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:12:37,863 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, 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] [2018-09-19 04:12:37,864 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:12:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -130902053, now seen corresponding path program 1 times [2018-09-19 04:12:37,864 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:12:37,864 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 286 with the following transitions: [2018-09-19 04:12:37,865 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], [413], [415], [418], [426], [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-19 04:12:37,872 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:12:37,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:12:42,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:12:52,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:12:52,559 INFO L272 AbstractInterpreter]: Visited 119 different actions 465 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:12:52,566 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:12:54,444 INFO L232 lantSequenceWeakener]: Weakened 283 states. On average, predicates are now at 78.1% of their original sizes. [2018-09-19 04:12:54,444 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:12:54,685 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:12:54,685 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:12:54,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 04:12:54,686 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:12:54,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 04:12:54,687 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 04:12:54,687 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 04:12:54,687 INFO L87 Difference]: Start difference. First operand 1652 states and 1949 transitions. Second operand 10 states. [2018-09-19 04:13:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:13:00,976 INFO L93 Difference]: Finished difference Result 2091 states and 2739 transitions. [2018-09-19 04:13:00,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 04:13:00,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 285 [2018-09-19 04:13:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:13:00,986 INFO L225 Difference]: With dead ends: 2091 [2018-09-19 04:13:00,987 INFO L226 Difference]: Without dead ends: 1846 [2018-09-19 04:13:00,989 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 292 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 04:13:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2018-09-19 04:13:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1839. [2018-09-19 04:13:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2018-09-19 04:13:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2167 transitions. [2018-09-19 04:13:01,043 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2167 transitions. Word has length 285 [2018-09-19 04:13:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:13:01,044 INFO L480 AbstractCegarLoop]: Abstraction has 1839 states and 2167 transitions. [2018-09-19 04:13:01,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 04:13:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2167 transitions. [2018-09-19 04:13:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-09-19 04:13:01,054 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:13:01,054 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:13:01,055 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:13:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash -675859729, now seen corresponding path program 1 times [2018-09-19 04:13:01,055 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:13:01,056 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 364 with the following transitions: [2018-09-19 04:13:01,056 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], [413], [415], [418], [426], [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-19 04:13:01,061 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:13:01,061 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:13:05,976 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:13:20,841 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:13:20,842 INFO L272 AbstractInterpreter]: Visited 120 different actions 709 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:13:20,849 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:13:23,008 INFO L232 lantSequenceWeakener]: Weakened 361 states. On average, predicates are now at 77.95% of their original sizes. [2018-09-19 04:13:23,009 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:13:23,465 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:13:23,465 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:13:23,466 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:13:23,466 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:13:23,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:13:23,467 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:13:23,467 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:13:23,468 INFO L87 Difference]: Start difference. First operand 1839 states and 2167 transitions. Second operand 14 states. [2018-09-19 04:13:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:13:35,347 INFO L93 Difference]: Finished difference Result 2871 states and 3949 transitions. [2018-09-19 04:13:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:13:35,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 363 [2018-09-19 04:13:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:13:35,360 INFO L225 Difference]: With dead ends: 2871 [2018-09-19 04:13:35,361 INFO L226 Difference]: Without dead ends: 2439 [2018-09-19 04:13:35,365 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 382 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 04:13:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2018-09-19 04:13:35,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 2046. [2018-09-19 04:13:35,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2018-09-19 04:13:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2424 transitions. [2018-09-19 04:13:35,428 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2424 transitions. Word has length 363 [2018-09-19 04:13:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:13:35,429 INFO L480 AbstractCegarLoop]: Abstraction has 2046 states and 2424 transitions. [2018-09-19 04:13:35,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:13:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2424 transitions. [2018-09-19 04:13:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-19 04:13:35,439 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:13:35,440 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:13:35,440 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:13:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash 441760295, now seen corresponding path program 1 times [2018-09-19 04:13:35,440 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:13:35,441 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 368 with the following transitions: [2018-09-19 04:13:35,441 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], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [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-19 04:13:35,444 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:13:35,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:13:40,180 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:14:00,242 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:14:00,243 INFO L272 AbstractInterpreter]: Visited 120 different actions 945 times. Merged at 8 different actions 62 times. Widened at 1 different actions 3 times. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:14:00,265 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:14:02,278 INFO L232 lantSequenceWeakener]: Weakened 365 states. On average, predicates are now at 77.94% of their original sizes. [2018-09-19 04:14:02,279 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:14:02,528 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:14:02,529 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:14:02,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 04:14:02,529 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:14:02,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 04:14:02,530 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 04:14:02,530 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 04:14:02,531 INFO L87 Difference]: Start difference. First operand 2046 states and 2424 transitions. Second operand 10 states. [2018-09-19 04:14:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:14:06,652 INFO L93 Difference]: Finished difference Result 2880 states and 3695 transitions. [2018-09-19 04:14:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 04:14:06,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 367 [2018-09-19 04:14:06,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:14:06,666 INFO L225 Difference]: With dead ends: 2880 [2018-09-19 04:14:06,666 INFO L226 Difference]: Without dead ends: 2241 [2018-09-19 04:14:06,669 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 374 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 04:14:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-09-19 04:14:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2231. [2018-09-19 04:14:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2018-09-19 04:14:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2642 transitions. [2018-09-19 04:14:06,733 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2642 transitions. Word has length 367 [2018-09-19 04:14:06,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:14:06,734 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 2642 transitions. [2018-09-19 04:14:06,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 04:14:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2642 transitions. [2018-09-19 04:14:06,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-19 04:14:06,741 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:14:06,741 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 04:14:06,742 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:14:06,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1074557752, now seen corresponding path program 1 times [2018-09-19 04:14:06,742 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:14:06,742 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2018-09-19 04:14:06,743 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], [413], [415], [418], [426], [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-19 04:14:06,746 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:14:06,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:14:10,875 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:14:24,298 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:14:24,298 INFO L272 AbstractInterpreter]: Visited 120 different actions 709 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:14:24,305 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:14:26,341 INFO L232 lantSequenceWeakener]: Weakened 386 states. On average, predicates are now at 77.9% of their original sizes. [2018-09-19 04:14:26,342 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:14:26,791 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:14:26,791 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:14:26,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:14:26,792 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:14:26,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:14:26,793 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:14:26,793 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:14:26,794 INFO L87 Difference]: Start difference. First operand 2231 states and 2642 transitions. Second operand 14 states. [2018-09-19 04:14:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:14:39,557 INFO L93 Difference]: Finished difference Result 3661 states and 4914 transitions. [2018-09-19 04:14:39,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:14:39,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 388 [2018-09-19 04:14:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:14:39,569 INFO L225 Difference]: With dead ends: 3661 [2018-09-19 04:14:39,569 INFO L226 Difference]: Without dead ends: 2837 [2018-09-19 04:14:39,574 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 407 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 04:14:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2018-09-19 04:14:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2442. [2018-09-19 04:14:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2018-09-19 04:14:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2905 transitions. [2018-09-19 04:14:39,646 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2905 transitions. Word has length 388 [2018-09-19 04:14:39,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:14:39,647 INFO L480 AbstractCegarLoop]: Abstraction has 2442 states and 2905 transitions. [2018-09-19 04:14:39,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:14:39,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2905 transitions. [2018-09-19 04:14:39,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-09-19 04:14:39,655 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:14:39,656 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-09-19 04:14:39,656 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:14:39,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1822582725, now seen corresponding path program 1 times [2018-09-19 04:14:39,656 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:14:39,657 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 446 with the following transitions: [2018-09-19 04:14:39,657 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], [413], [415], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [539], [542], [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-19 04:14:39,660 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:14:39,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:14:43,827 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 04:15:10,905 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 04:15:10,906 INFO L272 AbstractInterpreter]: Visited 121 different actions 1206 times. Merged at 9 different actions 95 times. Widened at 1 different actions 5 times. Found 26 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 04:15:10,912 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 04:15:13,192 INFO L232 lantSequenceWeakener]: Weakened 443 states. On average, predicates are now at 77.84% of their original sizes. [2018-09-19 04:15:13,192 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 04:15:13,633 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 04:15:13,634 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 04:15:13,634 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 04:15:13,634 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 04:15:13,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 04:15:13,635 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 04:15:13,635 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-19 04:15:13,635 INFO L87 Difference]: Start difference. First operand 2442 states and 2905 transitions. Second operand 14 states. [2018-09-19 04:15:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 04:15:24,934 INFO L93 Difference]: Finished difference Result 4083 states and 5187 transitions. [2018-09-19 04:15:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-19 04:15:24,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 445 [2018-09-19 04:15:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 04:15:24,948 INFO L225 Difference]: With dead ends: 4083 [2018-09-19 04:15:24,948 INFO L226 Difference]: Without dead ends: 3048 [2018-09-19 04:15:24,951 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 464 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-09-19 04:15:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2018-09-19 04:15:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 2647. [2018-09-19 04:15:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-09-19 04:15:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3163 transitions. [2018-09-19 04:15:25,032 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3163 transitions. Word has length 445 [2018-09-19 04:15:25,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 04:15:25,033 INFO L480 AbstractCegarLoop]: Abstraction has 2647 states and 3163 transitions. [2018-09-19 04:15:25,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 04:15:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3163 transitions. [2018-09-19 04:15:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-09-19 04:15:25,043 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 04:15:25,043 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 04:15:25,043 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 04:15:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash -901221653, now seen corresponding path program 1 times [2018-09-19 04:15:25,044 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 04:15:25,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 446 with the following transitions: [2018-09-19 04:15:25,045 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], [413], [415], [418], [426], [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], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-09-19 04:15:25,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-09-19 04:15:25,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 04:15:30,657 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-09-19 04:15:37,717 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-09-19 04:15:37,718 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-09-19 04:15:37,719 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 04:15:37,783 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 04:15:37,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:15:37 BoogieIcfgContainer [2018-09-19 04:15:37,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 04:15:37,785 INFO L168 Benchmark]: Toolchain (without parser) took 246568.13 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -292.8 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2018-09-19 04:15:37,790 INFO L168 Benchmark]: CDTParser took 0.23 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-19 04:15:37,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 915.63 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 04:15:37,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.44 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-19 04:15:37,792 INFO L168 Benchmark]: Boogie Preprocessor took 324.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -815.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2018-09-19 04:15:37,794 INFO L168 Benchmark]: RCFGBuilder took 3995.37 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 141.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. [2018-09-19 04:15:37,795 INFO L168 Benchmark]: TraceAbstraction took 241166.49 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 328.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-09-19 04:15:37,800 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.23 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 915.63 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 157.44 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 324.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 725.6 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -815.8 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3995.37 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 141.4 MB). Peak memory consumption was 141.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241166.49 ms. Allocated memory was 2.2 GB in the beginning and 4.1 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 1.7 GB in the end (delta: 328.8 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 175]: 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 FALSE !((( ((-43 < a12) && (11 >= a12)) && ((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 1)))) && (a15==8))) [L495] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==7) || (a21==8)) || (a21==9)) && (input == 3)))) && (a15==9))) [L500] COND FALSE !((((a24==1) && ((input == 4) && ((((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) )) || ((a21==6) && 80 < a12 )))) && (a15==9))) [L506] COND FALSE !(((a15==8) && (((a21==7) && ((input == 2) && (a24==1))) && a12 <= -43 ))) [L512] COND FALSE !(((a15==8) && (((input == 4) && (( ((-43 < a12) && (11 >= a12)) && (a21==10)) || ((a21==6) && ((11 < a12) && (80 >= a12)) ))) && (a24==1)))) [L518] COND FALSE !(((a15==9) && (( a12 <= -43 && (((a21==9) || ((a21==7) || (a21==8))) && (input == 2))) && (a24==1)))) [L524] COND FALSE !(((a24==1) && ((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 3))))) [L530] COND FALSE !((((a15==8) && (((a24==1) && (input == 4)) && ((11 < a12) && (80 >= a12)) )) && (a21==9))) [L536] COND FALSE !(((((input == 6) && ((( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10))) || ( 80 < a12 && (a21==6)))) && (a24==1)) && (a15==9))) [L541] COND FALSE !((((a15==8) && ((((a21==10) && ((-43 < a12) && (11 >= a12)) ) || ( ((11 < a12) && (80 >= a12)) && (a21==6))) && (input == 6))) && (a24==1))) [L547] COND FALSE !(((((a24==1) && (((a21==8) || ((a21==6) || (a21==7))) && (input == 2))) && (a15==9)) && ((11 < a12) && (80 >= a12)) )) [L552] COND FALSE !((((a21==9) && (((input == 3) && (a24==1)) && 80 < a12 )) && (a15==9))) [L555] COND FALSE !(((((((a21==7) || (a21==8)) && (input == 1)) && (a15==9)) && 80 < a12 ) && (a24==1))) [L561] COND FALSE !((((((a15==9) && ( 80 < a12 && (a24==1))) && (a21==10)) || ((a21==6) && (((a24==2) && a12 <= -43 ) && (a15==5)))) && (input == 6))) [L568] COND FALSE !(((a15==9) && ((a21==9) && ( 80 < a12 && ((input == 2) && (a24==1)))))) [L573] COND FALSE !(((((a15==8) && (((a21==7) || (a21==8)) && (input == 3))) && (a24==1)) && ((11 < a12) && (80 >= a12)) )) [L579] COND FALSE !(((a24==1) && ((input == 5) && ((((a15==8) && 80 < a12 ) && (a21==10)) || ((a21==6) && ( a12 <= -43 && (a15==9))))))) [L585] COND FALSE !(((a24==1) && (((( 80 < a12 && (a21==6)) || (((a21==9) && ((11 < a12) && (80 >= a12)) ) || ((a21==10) && ((11 < a12) && (80 >= a12)) ))) && (input == 1)) && (a15==9)))) [L591] COND FALSE !((((a24==1) && ( a12 <= -43 && ((((a21==8) || (a21==9)) || (a21==10)) && (input == 1)))) && (a15==8))) [L597] COND FALSE !(((a24==1) && (((((a21==7) && ((-43 < a12) && (11 >= a12)) ) || (((a21==10) && a12 <= -43 ) || ((a21==6) && ((-43 < a12) && (11 >= a12)) ))) && (input == 6)) && (a15==9)))) [L603] COND FALSE !(((a15==8) && (((a24==1) && ((((a21==6) || (a21==7)) || (a21==8)) && (input == 2))) && ((-43 < a12) && (11 >= a12)) ))) [L609] COND FALSE !((((((input == 6) && (((a21==6) || (a21==7)) || (a21==8))) && (a15==8)) && (a24==1)) && ((-43 < a12) && (11 >= a12)) )) [L615] COND FALSE !(((a24==1) && (((((a21==7) || (a21==8)) && (input == 6)) && (a15==8)) && ((11 < a12) && (80 >= a12)) ))) [L621] COND FALSE !(((((( ((-43 < a12) && (11 >= a12)) && (a21==7)) || (((a21==10) && a12 <= -43 ) || ( ((-43 < a12) && (11 >= a12)) && (a21==6)))) && (input == 2)) && (a15==9)) && (a24==1))) [L626] COND FALSE !((( ((-43 < a12) && (11 >= a12)) && (((input == 1) && (a15==8)) && (a24==1))) && (a21==9))) [L632] COND FALSE !(((a24==1) && ((a15==9) && ((input == 2) && (( 80 < a12 && (a21==6)) || (( ((11 < a12) && (80 >= a12)) && (a21==9)) || ( ((11 < a12) && (80 >= a12)) && (a21==10)))))))) [L638] COND FALSE !(((a24==1) && ((a15==8) && (((input == 2) && ((a21==7) || (a21==8))) && ((11 < a12) && (80 >= a12)) )))) [L644] COND FALSE !(((a24==1) && ((a21==9) && (((input == 5) && (a15==9)) && 80 < a12 )))) [L650] COND FALSE !((( a12 <= -43 && (((input == 1) && (a21==7)) && (a24==1))) && (a15==8))) [L656] COND FALSE !((((a21==9) && (( ((11 < a12) && (80 >= a12)) && (input == 3)) && (a24==1))) && (a15==8))) [L662] COND FALSE !((((a15==8) && ((((a21==8) || (a21==9)) && (input == 2)) && (a24==1))) && 80 < a12 )) [L668] COND FALSE !((( 80 < a12 && ((a24==1) && (((a21==8) || (a21==9)) && (input == 4)))) && (a15==8))) [L674] COND FALSE !(((a21==9) && ((a15==9) && ((a24==1) && ( 80 < a12 && (input == 1)))))) [L677] COND FALSE !(((a15==8) && (((input == 3) && ((((a21==10) && ((11 < a12) && (80 >= a12)) ) || ((a21==6) && 80 < a12 )) || ( 80 < a12 && (a21==7)))) && (a24==1)))) [L683] COND FALSE !(((a24==1) && ( 80 < a12 && ((a21==9) && ((a15==9) && (input == 4)))))) [L688] COND FALSE !(((a15==8) && (((input == 6) && (( 80 < a12 && (a21==7)) || (((a21==10) && ((11 < a12) && (80 >= a12)) ) || ( 80 < a12 && (a21==6))))) && (a24==1)))) [L694] COND FALSE !(((a15==9) && ((a24==1) && ( ((-43 < a12) && (11 >= a12)) && ((input == 1) && ((a21==9) || (a21==10))))))) [L700] COND FALSE !(((((( 80 < a12 && (a15==8)) && (a21==10)) || ((a21==6) && ((a15==9) && a12 <= -43 ))) && (input == 6)) && (a24==1))) [L706] COND FALSE !(((((a15==8) && (((a21==8) || (a21==9)) && (input == 1))) && (a24==1)) && 80 < a12 )) [L712] COND FALSE !((((a24==1) && ((((a21==7) && 80 < a12 ) || (( ((11 < a12) && (80 >= a12)) && (a21==10)) || ((a21==6) && 80 < a12 ))) && (input == 2))) && (a15==8))) [L718] COND FALSE !(((a24==1) && ( ((-43 < a12) && (11 >= a12)) && (((((a21==6) || (a21==7)) || (a21==8)) && (input == 4)) && (a15==8))))) [L724] COND FALSE !((((a15==8) && (((a21==7) && (input == 4)) && (a24==1))) && a12 <= -43 )) [L730] COND TRUE ((a21==9) && (((a24==1) && ((input == 2) && ((-43 < a12) && (11 >= a12)) )) && (a15==8))) [L731] a12 = (((a12 - -61) - -3) - -1) [L732] a21 = 8 [L734] RET return 26; [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 TRUE ((( 80 < a12 && (a24==1)) && (a15==7)) && (a21==7)) [L175] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. UNKNOWN Result, 241.0s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 80.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2044 SDtfs, 15969 SDslu, 3116 SDs, 0 SdLazy, 22776 SolverSat, 4534 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 68.5s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 2603 GetRequests, 2396 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2647occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 139.3s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9956264671151656 AbsIntWeakeningRatio, 0.09650180940892641 AbsIntAvgWeakeningVarsNumRemoved, 921.9529553679132 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1816 StatesRemovedByMinimization, 9 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_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_04-15-37-836.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem14_label55_true-unreach-call_false-termination.c_svcomp-Reach-64bit-ToothlessTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_04-15-37-836.csv Completed graceful shutdown