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_CON-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-15 16:47:41,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-15 16:47:41,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-15 16:47:41,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-15 16:47:41,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-15 16:47:41,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-15 16:47:41,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-15 16:47:41,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-15 16:47:41,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-15 16:47:41,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-15 16:47:41,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-15 16:47:41,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-15 16:47:41,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-15 16:47:41,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-15 16:47:41,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-15 16:47:41,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-15 16:47:41,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-15 16:47:41,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-15 16:47:41,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-15 16:47:41,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-15 16:47:41,282 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-15 16:47:41,283 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-15 16:47:41,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-15 16:47:41,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-15 16:47:41,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-15 16:47:41,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-15 16:47:41,288 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-15 16:47:41,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-15 16:47:41,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-15 16:47:41,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-15 16:47:41,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-15 16:47:41,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-15 16:47:41,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-15 16:47:41,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-15 16:47:41,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-15 16:47:41,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-15 16:47:41,295 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf [2018-09-15 16:47:41,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-15 16:47:41,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-15 16:47:41,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-15 16:47:41,312 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-15 16:47:41,312 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-15 16:47:41,312 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Abstract domain=CongruenceDomain [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-15 16:47:41,313 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-15 16:47:41,314 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-15 16:47:41,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-15 16:47:41,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-15 16:47:41,315 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-15 16:47:41,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-15 16:47:41,315 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-15 16:47:41,315 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-15 16:47:41,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-15 16:47:41,316 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-15 16:47:41,316 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-15 16:47:41,316 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-15 16:47:41,316 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-15 16:47:41,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 16:47:41,317 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-15 16:47:41,317 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-15 16:47:41,317 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-15 16:47:41,317 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-15 16:47:41,317 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-15 16:47:41,318 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-15 16:47:41,318 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-15 16:47:41,318 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-15 16:47:41,318 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-15 16:47:41,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-15 16:47:41,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-15 16:47:41,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-15 16:47:41,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-15 16:47:41,399 INFO L276 PluginConnector]: CDTParser initialized [2018-09-15 16:47:41,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c [2018-09-15 16:47:41,762 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46568483/a8bea185a82b48c2bac807e2043efb5c/FLAG130c3748c [2018-09-15 16:47:42,027 INFO L277 CDTParser]: Found 1 translation units. [2018-09-15 16:47:42,031 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label11_true-unreach-call.c [2018-09-15 16:47:42,051 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46568483/a8bea185a82b48c2bac807e2043efb5c/FLAG130c3748c [2018-09-15 16:47:42,066 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c46568483/a8bea185a82b48c2bac807e2043efb5c [2018-09-15 16:47:42,081 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-15 16:47:42,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-15 16:47:42,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-15 16:47:42,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-15 16:47:42,097 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-15 16:47:42,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:42,101 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6503a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42, skipping insertion in model container [2018-09-15 16:47:42,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:42,113 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-15 16:47:42,598 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:47:42,621 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-15 16:47:42,751 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-15 16:47:42,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42 WrapperNode [2018-09-15 16:47:42,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-15 16:47:42,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-15 16:47:42,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-15 16:47:42,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-15 16:47:42,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:42,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:42,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-15 16:47:42,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-15 16:47:42,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-15 16:47:42,919 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-15 16:47:43,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... [2018-09-15 16:47:43,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-15 16:47:43,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-15 16:47:43,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-15 16:47:43,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-15 16:47:43,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-15 16:47:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-15 16:47:43,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-15 16:47:43,262 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-15 16:47:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-15 16:47:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-15 16:47:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-15 16:47:43,263 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-15 16:47:43,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-15 16:47:46,429 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-15 16:47:46,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:47:46 BoogieIcfgContainer [2018-09-15 16:47:46,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-15 16:47:46,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-15 16:47:46,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-15 16:47:46,439 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-15 16:47:46,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 04:47:42" (1/3) ... [2018-09-15 16:47:46,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f3be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:47:46, skipping insertion in model container [2018-09-15 16:47:46,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 04:47:42" (2/3) ... [2018-09-15 16:47:46,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f3be11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 04:47:46, skipping insertion in model container [2018-09-15 16:47:46,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 04:47:46" (3/3) ... [2018-09-15 16:47:46,444 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label11_true-unreach-call.c [2018-09-15 16:47:46,455 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-15 16:47:46,467 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-15 16:47:46,543 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-15 16:47:46,544 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-15 16:47:46,545 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-15 16:47:46,545 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-15 16:47:46,545 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-15 16:47:46,545 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-15 16:47:46,546 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-15 16:47:46,546 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-15 16:47:46,546 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-15 16:47:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-15 16:47:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-15 16:47:46,604 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:47:46,606 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:47:46,607 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:47:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1604912700, now seen corresponding path program 1 times [2018-09-15 16:47:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:47:46,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-09-15 16:47:46,623 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-15 16:47:46,671 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:47:46,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:47:46,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:47:46,911 INFO L272 AbstractInterpreter]: Visited 67 different actions 67 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-15 16:47:46,951 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:47:47,131 INFO L232 lantSequenceWeakener]: Weakened 65 states. On average, predicates are now at 75.77% of their original sizes. [2018-09-15 16:47:47,132 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:47:47,299 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:47:47,302 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:47:47,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-15 16:47:47,302 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:47:47,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-15 16:47:47,313 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-15 16:47:47,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:47:47,316 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 5 states. [2018-09-15 16:47:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:47:49,293 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-15 16:47:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-15 16:47:49,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-09-15 16:47:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:47:49,319 INFO L225 Difference]: With dead ends: 576 [2018-09-15 16:47:49,319 INFO L226 Difference]: Without dead ends: 358 [2018-09-15 16:47:49,325 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-15 16:47:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-15 16:47:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-15 16:47:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-15 16:47:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-15 16:47:49,399 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 68 [2018-09-15 16:47:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:47:49,400 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-15 16:47:49,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-15 16:47:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-15 16:47:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-15 16:47:49,408 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:47:49,408 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:47:49,409 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:47:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1663036981, now seen corresponding path program 1 times [2018-09-15 16:47:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:47:49,409 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-09-15 16:47:49,410 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:47:49,413 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:47:49,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:47:49,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:47:49,544 INFO L272 AbstractInterpreter]: Visited 78 different actions 150 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:47:49,577 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:47:49,801 INFO L232 lantSequenceWeakener]: Weakened 136 states. On average, predicates are now at 74.31% of their original sizes. [2018-09-15 16:47:49,801 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:47:50,242 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:47:50,243 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:47:50,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:47:50,243 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:47:50,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:47:50,245 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:47:50,245 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:47:50,246 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 9 states. [2018-09-15 16:47:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:47:53,415 INFO L93 Difference]: Finished difference Result 719 states and 1134 transitions. [2018-09-15 16:47:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:47:53,419 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2018-09-15 16:47:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:47:53,427 INFO L225 Difference]: With dead ends: 719 [2018-09-15 16:47:53,427 INFO L226 Difference]: Without dead ends: 513 [2018-09-15 16:47:53,432 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 145 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:47:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-09-15 16:47:53,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 504. [2018-09-15 16:47:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-09-15 16:47:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 662 transitions. [2018-09-15 16:47:53,473 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 662 transitions. Word has length 139 [2018-09-15 16:47:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:47:53,474 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 662 transitions. [2018-09-15 16:47:53,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:47:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 662 transitions. [2018-09-15 16:47:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-15 16:47:53,479 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:47:53,479 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-15 16:47:53,480 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:47:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash 325102480, now seen corresponding path program 1 times [2018-09-15 16:47:53,480 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:47:53,480 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-09-15 16:47:53,481 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:47:53,484 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:47:53,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:47:53,578 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:47:53,578 INFO L272 AbstractInterpreter]: Visited 87 different actions 167 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:47:53,603 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:47:53,815 INFO L232 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 74.28% of their original sizes. [2018-09-15 16:47:53,815 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:47:54,031 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:47:54,032 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:47:54,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:47:54,032 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:47:54,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:47:54,033 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:47:54,033 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:47:54,033 INFO L87 Difference]: Start difference. First operand 504 states and 662 transitions. Second operand 9 states. [2018-09-15 16:47:58,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:47:58,001 INFO L93 Difference]: Finished difference Result 1139 states and 1712 transitions. [2018-09-15 16:47:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-15 16:47:58,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-09-15 16:47:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:47:58,011 INFO L225 Difference]: With dead ends: 1139 [2018-09-15 16:47:58,011 INFO L226 Difference]: Without dead ends: 785 [2018-09-15 16:47:58,018 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 154 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:47:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-09-15 16:47:58,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 778. [2018-09-15 16:47:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-09-15 16:47:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 957 transitions. [2018-09-15 16:47:58,055 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 957 transitions. Word has length 148 [2018-09-15 16:47:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:47:58,057 INFO L480 AbstractCegarLoop]: Abstraction has 778 states and 957 transitions. [2018-09-15 16:47:58,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:47:58,058 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 957 transitions. [2018-09-15 16:47:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-15 16:47:58,073 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:47:58,073 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:47:58,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:47:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1281463288, now seen corresponding path program 1 times [2018-09-15 16:47:58,074 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:47:58,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-09-15 16:47:58,075 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [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], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:47:58,081 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:47:58,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:47:58,270 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:47:58,270 INFO L272 AbstractInterpreter]: Visited 123 different actions 240 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:47:58,300 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:47:58,510 INFO L232 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 73.97% of their original sizes. [2018-09-15 16:47:58,510 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:47:58,748 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:47:58,749 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:47:58,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:47:58,749 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:47:58,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:47:58,750 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:47:58,750 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:47:58,750 INFO L87 Difference]: Start difference. First operand 778 states and 957 transitions. Second operand 9 states. [2018-09-15 16:48:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:02,918 INFO L93 Difference]: Finished difference Result 1563 states and 2059 transitions. [2018-09-15 16:48:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:02,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2018-09-15 16:48:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:02,926 INFO L225 Difference]: With dead ends: 1563 [2018-09-15 16:48:02,926 INFO L226 Difference]: Without dead ends: 935 [2018-09-15 16:48:02,928 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 190 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2018-09-15 16:48:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 928. [2018-09-15 16:48:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-09-15 16:48:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1133 transitions. [2018-09-15 16:48:02,960 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1133 transitions. Word has length 184 [2018-09-15 16:48:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:02,960 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1133 transitions. [2018-09-15 16:48:02,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1133 transitions. [2018-09-15 16:48:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-15 16:48:02,964 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:02,965 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:48:02,965 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:02,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1550382411, now seen corresponding path program 1 times [2018-09-15 16:48:02,965 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:02,966 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-09-15 16:48:02,966 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [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], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [754], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:02,969 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:02,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:03,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:48:03,157 INFO L272 AbstractInterpreter]: Visited 142 different actions 414 times. Merged at 5 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-15 16:48:03,194 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:48:03,268 INFO L232 lantSequenceWeakener]: Weakened 200 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-15 16:48:03,268 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:48:03,475 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:48:03,475 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:48:03,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:48:03,475 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:48:03,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:48:03,476 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:48:03,476 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:48:03,477 INFO L87 Difference]: Start difference. First operand 928 states and 1133 transitions. Second operand 9 states. [2018-09-15 16:48:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:05,664 INFO L93 Difference]: Finished difference Result 1942 states and 2573 transitions. [2018-09-15 16:48:05,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:05,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-09-15 16:48:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:05,671 INFO L225 Difference]: With dead ends: 1942 [2018-09-15 16:48:05,671 INFO L226 Difference]: Without dead ends: 1164 [2018-09-15 16:48:05,674 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 209 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2018-09-15 16:48:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1157. [2018-09-15 16:48:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-09-15 16:48:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1390 transitions. [2018-09-15 16:48:05,706 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1390 transitions. Word has length 203 [2018-09-15 16:48:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:05,707 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1390 transitions. [2018-09-15 16:48:05,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1390 transitions. [2018-09-15 16:48:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-15 16:48:05,711 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:05,711 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:48:05,712 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1340234180, now seen corresponding path program 1 times [2018-09-15 16:48:05,712 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:05,712 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-09-15 16:48:05,713 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:05,715 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:05,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:05,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:48:05,799 INFO L272 AbstractInterpreter]: Visited 95 different actions 368 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:48:05,827 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:48:05,932 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 76.09% of their original sizes. [2018-09-15 16:48:05,933 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:48:06,004 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:48:06,004 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:48:06,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:48:06,005 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:48:06,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:48:06,006 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:48:06,006 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:48:06,006 INFO L87 Difference]: Start difference. First operand 1157 states and 1390 transitions. Second operand 9 states. [2018-09-15 16:48:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:08,617 INFO L93 Difference]: Finished difference Result 2420 states and 3040 transitions. [2018-09-15 16:48:08,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:08,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 226 [2018-09-15 16:48:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:08,625 INFO L225 Difference]: With dead ends: 2420 [2018-09-15 16:48:08,626 INFO L226 Difference]: Without dead ends: 1413 [2018-09-15 16:48:08,629 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2018-09-15 16:48:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1392. [2018-09-15 16:48:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-09-15 16:48:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1678 transitions. [2018-09-15 16:48:08,674 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1678 transitions. Word has length 226 [2018-09-15 16:48:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:08,674 INFO L480 AbstractCegarLoop]: Abstraction has 1392 states and 1678 transitions. [2018-09-15 16:48:08,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1678 transitions. [2018-09-15 16:48:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-15 16:48:08,680 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:08,681 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:48:08,681 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash -943242392, now seen corresponding path program 1 times [2018-09-15 16:48:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:08,682 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-09-15 16:48:08,682 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [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], [659], [663], [666], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:08,684 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:08,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:08,868 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:48:08,868 INFO L272 AbstractInterpreter]: Visited 121 different actions 472 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:48:08,903 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:48:09,021 INFO L232 lantSequenceWeakener]: Weakened 249 states. On average, predicates are now at 75.97% of their original sizes. [2018-09-15 16:48:09,022 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:48:09,146 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:48:09,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:48:09,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:48:09,147 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:48:09,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:48:09,147 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:48:09,148 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:48:09,148 INFO L87 Difference]: Start difference. First operand 1392 states and 1678 transitions. Second operand 9 states. [2018-09-15 16:48:11,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:11,636 INFO L93 Difference]: Finished difference Result 3072 states and 3947 transitions. [2018-09-15 16:48:11,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:11,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2018-09-15 16:48:11,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:11,646 INFO L225 Difference]: With dead ends: 3072 [2018-09-15 16:48:11,646 INFO L226 Difference]: Without dead ends: 1830 [2018-09-15 16:48:11,650 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-09-15 16:48:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1796. [2018-09-15 16:48:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2018-09-15 16:48:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2263 transitions. [2018-09-15 16:48:11,694 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2263 transitions. Word has length 252 [2018-09-15 16:48:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:11,695 INFO L480 AbstractCegarLoop]: Abstraction has 1796 states and 2263 transitions. [2018-09-15 16:48:11,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2263 transitions. [2018-09-15 16:48:11,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-15 16:48:11,701 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:11,701 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-15 16:48:11,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash 29719707, now seen corresponding path program 1 times [2018-09-15 16:48:11,702 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:11,702 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-09-15 16:48:11,702 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [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], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:11,704 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:11,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:11,873 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:48:11,874 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:48:11,881 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:48:12,068 INFO L232 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-15 16:48:12,068 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:48:12,214 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:48:12,214 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:48:12,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:48:12,215 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:48:12,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:48:12,215 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:48:12,215 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:48:12,216 INFO L87 Difference]: Start difference. First operand 1796 states and 2263 transitions. Second operand 9 states. [2018-09-15 16:48:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:14,983 INFO L93 Difference]: Finished difference Result 3876 states and 5109 transitions. [2018-09-15 16:48:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:14,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 257 [2018-09-15 16:48:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:15,008 INFO L225 Difference]: With dead ends: 3876 [2018-09-15 16:48:15,008 INFO L226 Difference]: Without dead ends: 2230 [2018-09-15 16:48:15,013 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2018-09-15 16:48:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2211. [2018-09-15 16:48:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2018-09-15 16:48:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2799 transitions. [2018-09-15 16:48:15,077 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2799 transitions. Word has length 257 [2018-09-15 16:48:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:15,078 INFO L480 AbstractCegarLoop]: Abstraction has 2211 states and 2799 transitions. [2018-09-15 16:48:15,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2799 transitions. [2018-09-15 16:48:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-15 16:48:15,084 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:15,085 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-09-15 16:48:15,085 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1925380864, now seen corresponding path program 1 times [2018-09-15 16:48:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:15,086 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-15 16:48:15,087 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [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], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:15,088 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:15,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:15,323 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-15 16:48:15,324 INFO L272 AbstractInterpreter]: Visited 124 different actions 486 times. Merged at 7 different actions 23 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:48:15,361 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-15 16:48:15,515 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 76.02% of their original sizes. [2018-09-15 16:48:15,515 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-15 16:48:15,851 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-15 16:48:15,851 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-15 16:48:15,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-15 16:48:15,851 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-15 16:48:15,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-15 16:48:15,852 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-15 16:48:15,852 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-15 16:48:15,853 INFO L87 Difference]: Start difference. First operand 2211 states and 2799 transitions. Second operand 9 states. [2018-09-15 16:48:18,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-15 16:48:18,205 INFO L93 Difference]: Finished difference Result 4540 states and 5880 transitions. [2018-09-15 16:48:18,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-15 16:48:18,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 262 [2018-09-15 16:48:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-15 16:48:18,217 INFO L225 Difference]: With dead ends: 4540 [2018-09-15 16:48:18,217 INFO L226 Difference]: Without dead ends: 2479 [2018-09-15 16:48:18,223 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 268 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-09-15 16:48:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2018-09-15 16:48:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2446. [2018-09-15 16:48:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2018-09-15 16:48:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 3100 transitions. [2018-09-15 16:48:18,282 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 3100 transitions. Word has length 262 [2018-09-15 16:48:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-15 16:48:18,283 INFO L480 AbstractCegarLoop]: Abstraction has 2446 states and 3100 transitions. [2018-09-15 16:48:18,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-15 16:48:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 3100 transitions. [2018-09-15 16:48:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-15 16:48:18,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-15 16:48:18,293 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-15 16:48:18,294 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-15 16:48:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 450221760, now seen corresponding path program 1 times [2018-09-15 16:48:18,294 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-15 16:48:18,294 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 347 with the following transitions: [2018-09-15 16:48:18,295 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [445], [447], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [694], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-15 16:48:18,296 INFO L148 AbstractInterpreter]: Using domain CongruenceDomain [2018-09-15 16:48:18,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CongruenceDomain (maxUnwinding=3, maxParallelStates=2) [2018-09-15 16:48:18,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-15 16:48:18,458 INFO L272 AbstractInterpreter]: Visited 130 different actions 636 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-15 16:48:18,496 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-15 16:48:18,545 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-15 16:48:18,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 04:48:18 BoogieIcfgContainer [2018-09-15 16:48:18,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-15 16:48:18,547 INFO L168 Benchmark]: Toolchain (without parser) took 36464.85 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -518.3 MB). Peak memory consumption was 689.7 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,549 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-15 16:48:18,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,551 INFO L168 Benchmark]: Boogie Preprocessor took 259.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -864.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,552 INFO L168 Benchmark]: RCFGBuilder took 3249.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,553 INFO L168 Benchmark]: TraceAbstraction took 32113.75 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 422.6 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 181.2 MB). Peak memory consumption was 603.8 MB. Max. memory is 7.1 GB. [2018-09-15 16:48:18,558 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 116.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 259.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 785.4 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -864.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3249.30 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32113.75 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 422.6 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 181.2 MB). Peak memory consumption was 603.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 187]: 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 inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] RET return 22; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND TRUE (((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0)) [L292] a1 = (((a1 / 5) - -435872) + 13710) [L293] a10 = 0 [L295] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) [L414] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) [L419] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) [L425] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) [L430] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) [L436] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) [L442] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) [L448] COND TRUE ((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0))) [L449] a1 = ((((((a1 % 25)- -12) - 0) * 5) % 25)- -13) [L450] a10 = 3 [L451] a19 = 6 [L453] RET return -1; [L590] EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND TRUE (((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6)) [L187] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 32.0s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 25.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1703 SDtfs, 5993 SDslu, 2438 SDs, 0 SdLazy, 14686 SolverSat, 2001 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0s Time, PredicateUnifierStatistics: 18 DeclaredPredicates, 1786 GetRequests, 1671 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2446occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 10 AbstIntIterations, 9 AbstIntStrong, 0.9970489078255522 AbsIntWeakeningRatio, 0.11445086705202312 AbsIntAvgWeakeningVarsNumRemoved, 6.623121387283237 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 139 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/Problem10_label11_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-15_16-48-18-574.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label11_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_CON-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-15_16-48-18-574.csv Received shutdown request...