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_INT-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label04_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:00:32,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:00:32,544 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:00:32,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:00:32,562 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:00:32,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:00:32,565 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:00:32,568 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:00:32,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:00:32,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:00:32,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:00:32,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:00:32,577 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:00:32,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:00:32,582 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:00:32,583 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:00:32,585 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:00:32,593 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:00:32,599 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:00:32,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:00:32,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:00:32,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:00:32,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:00:32,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:00:32,610 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:00:32,612 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:00:32,613 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:00:32,614 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:00:32,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:00:32,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:00:32,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:00:32,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:00:32,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:00:32,618 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:00:32,620 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:00:32,621 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:00:32,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf [2018-09-19 06:00:32,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:00:32,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:00:32,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:00:32,648 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:00:32,648 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:00:32,648 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:00:32,649 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:00:32,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:00:32,649 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:00:32,649 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:00:32,650 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:00:32,650 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:00:32,650 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:00:32,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:00:32,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:00:32,653 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:00:32,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:00:32,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:00:32,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:00:32,655 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:00:32,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:00:32,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:00:32,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:00:32,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:00:32,656 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:00:32,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:00:32,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:00:32,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:00:32,657 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:00:32,658 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:00:32,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:00:32,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:00:32,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:00:32,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:00:32,729 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:00:32,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label04_true-unreach-call.c [2018-09-19 06:00:33,100 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec368f9f1/a9a95de83bc44905b9ffe879c221b895/FLAG8faa514da [2018-09-19 06:00:33,366 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:00:33,367 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label04_true-unreach-call.c [2018-09-19 06:00:33,387 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec368f9f1/a9a95de83bc44905b9ffe879c221b895/FLAG8faa514da [2018-09-19 06:00:33,406 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec368f9f1/a9a95de83bc44905b9ffe879c221b895 [2018-09-19 06:00:33,417 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:00:33,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:00:33,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:00:33,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:00:33,428 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:00:33,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:00:33" (1/1) ... [2018-09-19 06:00:33,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c58416c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:33, skipping insertion in model container [2018-09-19 06:00:33,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:00:33" (1/1) ... [2018-09-19 06:00:33,445 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:00:33,925 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:00:33,944 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:00:34,096 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:00:34,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34 WrapperNode [2018-09-19 06:00:34,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:00:34,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:00:34,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:00:34,166 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:00:34,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:00:34,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:00:34,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:00:34,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:00:34,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... [2018-09-19 06:00:34,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:00:34,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:00:34,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:00:34,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:00:34,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:00:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:00:34,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:00:34,619 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:00:34,619 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:00:34,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:00:34,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:00:34,620 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:00:34,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:00:38,464 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:00:38,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:00:38 BoogieIcfgContainer [2018-09-19 06:00:38,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:00:38,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:00:38,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:00:38,469 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:00:38,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:00:33" (1/3) ... [2018-09-19 06:00:38,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fea838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:00:38, skipping insertion in model container [2018-09-19 06:00:38,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:00:34" (2/3) ... [2018-09-19 06:00:38,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fea838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:00:38, skipping insertion in model container [2018-09-19 06:00:38,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:00:38" (3/3) ... [2018-09-19 06:00:38,473 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label04_true-unreach-call.c [2018-09-19 06:00:38,484 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:00:38,493 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:00:38,547 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:00:38,548 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:00:38,548 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:00:38,548 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:00:38,548 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:00:38,548 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:00:38,549 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:00:38,549 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:00:38,549 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:00:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:00:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-19 06:00:38,592 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:38,594 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, 1, 1, 1, 1, 1] [2018-09-19 06:00:38,597 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1534205543, now seen corresponding path program 1 times [2018-09-19 06:00:38,606 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:38,607 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 74 with the following transitions: [2018-09-19 06:00:38,609 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], [449], [457], [465], [473], [481], [485], [487], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:00:38,654 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:38,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:38,979 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:38,981 INFO L272 AbstractInterpreter]: Visited 72 different actions 72 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:00:39,027 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:39,235 INFO L232 lantSequenceWeakener]: Weakened 70 states. On average, predicates are now at 75.83% of their original sizes. [2018-09-19 06:00:39,235 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:39,480 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:39,482 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:39,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:00:39,483 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:39,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:00:39,500 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:00:39,501 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:00:39,504 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:00:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:42,413 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:00:42,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:00:42,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-09-19 06:00:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:42,437 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:00:42,437 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:00:42,444 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:00:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:00:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:00:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:00:42,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:00:42,519 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 73 [2018-09-19 06:00:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:42,520 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:00:42,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:00:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:00:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-19 06:00:42,530 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:42,530 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:42,531 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 553948683, now seen corresponding path program 1 times [2018-09-19 06:00:42,533 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:42,533 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 145 with the following transitions: [2018-09-19 06:00:42,533 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:42,541 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:42,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:42,626 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:42,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:42,727 INFO L272 AbstractInterpreter]: Visited 78 different actions 221 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:00:42,766 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:42,962 INFO L232 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 74.33% of their original sizes. [2018-09-19 06:00:42,963 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:43,183 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:43,183 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:43,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:43,184 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:43,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:43,186 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:43,186 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:43,187 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:00:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:47,654 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:00:47,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:00:47,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 144 [2018-09-19 06:00:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:47,662 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:00:47,663 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:00:47,665 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 150 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:00:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:00:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:00:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:00:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:00:47,712 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 144 [2018-09-19 06:00:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:47,713 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:00:47,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:00:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-19 06:00:47,725 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:47,725 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, 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] [2018-09-19 06:00:47,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1855747908, now seen corresponding path program 1 times [2018-09-19 06:00:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:47,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-09-19 06:00:47,728 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], [449], [457], [465], [473], [481], [485], [487], [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-19 06:00:47,731 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:47,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:47,807 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:47,890 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:47,890 INFO L272 AbstractInterpreter]: Visited 87 different actions 248 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:00:47,931 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:48,080 INFO L232 lantSequenceWeakener]: Weakened 150 states. On average, predicates are now at 74.24% of their original sizes. [2018-09-19 06:00:48,080 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:48,411 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:48,411 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:48,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:48,412 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:48,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:48,413 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:48,413 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:48,413 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:00:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:51,484 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:00:51,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:00:51,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 153 [2018-09-19 06:00:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:51,491 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:00:51,491 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:00:51,493 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:00:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:00:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:00:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:00:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:00:51,524 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 153 [2018-09-19 06:00:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:51,525 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:00:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:00:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-19 06:00:51,529 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:51,529 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, 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] [2018-09-19 06:00:51,530 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:51,530 INFO L82 PathProgramCache]: Analyzing trace with hash 317926988, now seen corresponding path program 1 times [2018-09-19 06:00:51,530 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:51,530 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-09-19 06:00:51,531 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], [449], [457], [465], [473], [481], [485], [487], [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-19 06:00:51,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:51,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:51,615 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:51,831 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:51,831 INFO L272 AbstractInterpreter]: Visited 123 different actions 356 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:00:51,877 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:52,054 INFO L232 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 73.94% of their original sizes. [2018-09-19 06:00:52,056 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:52,230 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:52,231 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:52,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:52,231 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:52,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:52,231 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:52,232 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:52,232 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:00:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:55,611 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:00:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:00:55,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-09-19 06:00:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:55,617 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:00:55,617 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:00:55,620 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:00:55,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:00:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:00:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:00:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:00:55,652 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 189 [2018-09-19 06:00:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:55,653 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:00:55,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:00:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-19 06:00:55,657 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:55,657 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, 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] [2018-09-19 06:00:55,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1267180917, now seen corresponding path program 1 times [2018-09-19 06:00:55,658 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:55,658 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 209 with the following transitions: [2018-09-19 06:00:55,658 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], [449], [457], [465], [473], [481], [485], [487], [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-19 06:00:55,663 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:55,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:55,843 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:55,843 INFO L272 AbstractInterpreter]: Visited 142 different actions 413 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:00:55,879 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:56,024 INFO L232 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 73.83% of their original sizes. [2018-09-19 06:00:56,024 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:56,261 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:56,261 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:56,261 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:56,261 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:56,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:56,262 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:56,262 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:56,263 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:00:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:00:58,973 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:00:58,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:00:58,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 208 [2018-09-19 06:00:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:00:58,984 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:00:58,984 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:00:58,987 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:00:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:00:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:00:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:00:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:00:59,042 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 208 [2018-09-19 06:00:59,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:00:59,043 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:00:59,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:00:59,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:00:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 06:00:59,048 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:00:59,049 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:00:59,049 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:00:59,049 INFO L82 PathProgramCache]: Analyzing trace with hash 924233710, now seen corresponding path program 1 times [2018-09-19 06:00:59,049 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:00:59,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 06:00:59,050 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:00:59,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:00:59,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:00:59,092 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:00:59,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:00:59,162 INFO L272 AbstractInterpreter]: Visited 84 different actions 323 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:00:59,188 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:00:59,324 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.81% of their original sizes. [2018-09-19 06:00:59,324 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:00:59,513 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:00:59,514 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:00:59,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:00:59,515 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:00:59,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:00:59,516 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:00:59,516 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:00:59,516 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:01:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:02,073 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:01:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:02,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 06:01:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:02,082 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:01:02,082 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:01:02,086 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:01:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:01:02,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:01:02,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:01:02,130 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 220 [2018-09-19 06:01:02,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:02,131 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:01:02,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:01:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-19 06:01:02,136 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:02,136 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:02,136 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash 118138834, now seen corresponding path program 1 times [2018-09-19 06:01:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:02,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-09-19 06:01:02,137 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:02,139 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:02,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:02,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:02,250 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:02,250 INFO L272 AbstractInterpreter]: Visited 86 different actions 332 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:02,272 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:02,413 INFO L232 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 73.8% of their original sizes. [2018-09-19 06:01:02,413 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:02,761 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:02,762 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:02,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:02,762 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:02,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:02,763 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:02,763 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:02,764 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:01:04,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:04,903 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:01:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:04,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 222 [2018-09-19 06:01:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:04,912 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:01:04,912 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:01:04,916 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:01:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:01:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:01:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:01:04,962 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 222 [2018-09-19 06:01:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:04,962 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:01:04,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:01:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-19 06:01:04,967 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:04,967 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:04,968 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:04,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1356537754, now seen corresponding path program 1 times [2018-09-19 06:01:04,968 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:04,968 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-09-19 06:01:04,969 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:04,970 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:04,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:04,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:05,075 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:05,076 INFO L272 AbstractInterpreter]: Visited 90 different actions 348 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:05,090 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:05,212 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 06:01:05,212 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:05,298 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:05,298 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:05,298 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:05,298 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:05,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:05,299 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:05,299 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:05,300 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:01:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:07,965 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:01:07,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:07,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 226 [2018-09-19 06:01:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:07,975 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:01:07,975 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:01:07,979 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:01:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:01:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:01:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:01:08,039 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 226 [2018-09-19 06:01:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:08,041 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:01:08,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:01:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-19 06:01:08,046 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:08,046 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:08,047 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1073820956, now seen corresponding path program 1 times [2018-09-19 06:01:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:08,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 227 with the following transitions: [2018-09-19 06:01:08,048 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:08,049 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:08,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:08,082 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:08,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:08,157 INFO L272 AbstractInterpreter]: Visited 88 different actions 340 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:08,186 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:08,310 INFO L232 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 06:01:08,311 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:08,427 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:08,428 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:08,428 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:08,428 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:08,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:08,429 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:08,429 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:08,429 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:01:10,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:10,604 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:01:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:10,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 226 [2018-09-19 06:01:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:10,615 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:01:10,615 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:01:10,620 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 233 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:01:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:01:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:01:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:01:10,679 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 226 [2018-09-19 06:01:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:10,680 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:01:10,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:01:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-19 06:01:10,686 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:10,686 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:10,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:10,687 INFO L82 PathProgramCache]: Analyzing trace with hash 391063366, now seen corresponding path program 1 times [2018-09-19 06:01:10,687 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:10,687 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-09-19 06:01:10,688 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:10,689 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:10,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:10,716 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:13,329 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:13,329 INFO L272 AbstractInterpreter]: Visited 96 different actions 372 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:13,336 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:13,843 INFO L232 lantSequenceWeakener]: Weakened 229 states. On average, predicates are now at 73.76% of their original sizes. [2018-09-19 06:01:13,843 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:14,002 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:14,002 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:14,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:14,002 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:14,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:14,003 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:14,003 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:14,003 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:01:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:17,077 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:01:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:17,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-09-19 06:01:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:17,087 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:01:17,087 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:01:17,092 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:17,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:01:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:01:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:01:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:01:17,152 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 232 [2018-09-19 06:01:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:17,153 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:01:17,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:01:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-19 06:01:17,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:17,159 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:17,160 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1263791187, now seen corresponding path program 1 times [2018-09-19 06:01:17,160 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:17,160 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2018-09-19 06:01:17,161 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], [449], [457], [465], [473], [481], [485], [487], [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], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:17,163 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:17,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:17,189 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:17,716 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:17,716 INFO L272 AbstractInterpreter]: Visited 105 different actions 407 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:01:17,753 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:18,027 INFO L232 lantSequenceWeakener]: Weakened 238 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 06:01:18,027 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:18,218 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:18,219 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:18,219 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:18,219 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:18,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:18,220 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:18,220 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:18,220 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:01:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:20,048 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:01:20,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:20,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 241 [2018-09-19 06:01:20,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:20,060 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:01:20,060 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:01:20,066 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 248 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:01:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:01:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:01:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:01:20,130 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 241 [2018-09-19 06:01:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:20,131 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:01:20,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:01:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-19 06:01:20,138 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:20,138 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:20,139 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:20,139 INFO L82 PathProgramCache]: Analyzing trace with hash -134932583, now seen corresponding path program 1 times [2018-09-19 06:01:20,139 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:20,139 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2018-09-19 06:01:20,140 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [485], [487], [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], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:20,142 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:20,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:20,166 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:20,308 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:20,308 INFO L272 AbstractInterpreter]: Visited 111 different actions 432 times. Merged at 7 different actions 21 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:20,343 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:20,531 INFO L232 lantSequenceWeakener]: Weakened 244 states. On average, predicates are now at 73.69% of their original sizes. [2018-09-19 06:01:20,532 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:20,666 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:20,666 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:20,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:20,667 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:20,667 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:20,667 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:20,668 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:01:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:25,370 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:01:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:25,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 247 [2018-09-19 06:01:25,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:25,381 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:01:25,382 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:01:25,387 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 254 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:01:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:01:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:01:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:01:25,446 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 247 [2018-09-19 06:01:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:25,446 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:01:25,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:01:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-19 06:01:25,454 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:25,454 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:25,455 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1494424046, now seen corresponding path program 1 times [2018-09-19 06:01:25,455 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:25,455 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 255 with the following transitions: [2018-09-19 06:01:25,456 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], [449], [457], [465], [473], [481], [485], [487], [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], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:25,458 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:25,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:25,483 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:25,616 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:25,617 INFO L272 AbstractInterpreter]: Visited 118 different actions 459 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:01:25,618 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:25,741 INFO L232 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 06:01:25,741 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:25,859 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:25,859 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:25,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:25,860 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:25,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:25,860 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:25,861 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:25,861 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:01:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:28,390 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:01:28,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:28,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 254 [2018-09-19 06:01:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:28,403 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:01:28,403 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:01:28,409 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:01:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:01:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:01:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:01:28,472 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 254 [2018-09-19 06:01:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:28,473 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:01:28,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:01:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-19 06:01:28,481 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:28,482 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, 3, 3, 3, 3, 3, 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-19 06:01:28,482 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:28,482 INFO L82 PathProgramCache]: Analyzing trace with hash -502940452, now seen corresponding path program 1 times [2018-09-19 06:01:28,482 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:28,483 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 263 with the following transitions: [2018-09-19 06:01:28,483 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], [449], [457], [465], [473], [481], [485], [487], [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-19 06:01:28,485 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:28,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:28,537 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:28,662 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:28,663 INFO L272 AbstractInterpreter]: Visited 124 different actions 483 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:01:28,669 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:28,789 INFO L232 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 06:01:28,789 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:28,862 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:28,862 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:28,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:28,863 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:28,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:28,863 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:28,863 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:28,864 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:01:30,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:30,908 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:01:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:30,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 262 [2018-09-19 06:01:30,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:30,923 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:01:30,923 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:01:30,929 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 269 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:01:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:01:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:01:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:01:30,999 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 262 [2018-09-19 06:01:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:31,000 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:01:31,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:01:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-19 06:01:31,007 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:31,008 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:31,008 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:31,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1646882154, now seen corresponding path program 1 times [2018-09-19 06:01:31,008 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:31,008 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2018-09-19 06:01:31,009 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], [449], [457], [465], [473], [481], [485], [487], [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], [667], [671], [675], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:31,011 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:31,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:31,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:31,286 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:31,286 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 times. Merged at 7 different actions 28 times. Never widened. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:31,320 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:31,492 INFO L232 lantSequenceWeakener]: Weakened 263 states. On average, predicates are now at 73.62% of their original sizes. [2018-09-19 06:01:31,492 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:31,636 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:31,636 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:31,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:31,637 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:31,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:31,637 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:31,638 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:31,638 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:01:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:34,073 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:01:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:34,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 266 [2018-09-19 06:01:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:34,102 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:01:34,102 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:01:34,109 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 273 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:01:34,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:01:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:01:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:01:34,188 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 266 [2018-09-19 06:01:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:34,189 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:01:34,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:01:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-19 06:01:34,198 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:34,198 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:34,199 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1504614275, now seen corresponding path program 1 times [2018-09-19 06:01:34,199 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:34,199 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-09-19 06:01:34,200 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], [449], [457], [465], [473], [481], [485], [487], [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], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [762], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:34,204 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:34,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:34,236 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:34,468 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:34,469 INFO L272 AbstractInterpreter]: Visited 145 different actions 567 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:01:34,506 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:34,678 INFO L232 lantSequenceWeakener]: Weakened 278 states. On average, predicates are now at 73.57% of their original sizes. [2018-09-19 06:01:34,678 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:34,978 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:34,978 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:34,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:34,979 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:34,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:34,980 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:34,980 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:34,980 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:01:38,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:38,054 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:01:38,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:38,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 281 [2018-09-19 06:01:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:38,078 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:01:38,078 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:01:38,085 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 288 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:01:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:01:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:01:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:01:38,155 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 281 [2018-09-19 06:01:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:38,156 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:01:38,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:01:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-19 06:01:38,165 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:38,166 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, 3, 3, 3, 3, 3, 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] [2018-09-19 06:01:38,166 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1091871285, now seen corresponding path program 1 times [2018-09-19 06:01:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:38,166 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2018-09-19 06:01:38,167 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [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], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:38,169 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:38,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:38,198 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:38,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:38,532 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:01:38,541 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:38,699 INFO L232 lantSequenceWeakener]: Weakened 292 states. On average, predicates are now at 73.53% of their original sizes. [2018-09-19 06:01:38,700 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:38,856 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:38,856 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:38,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:38,856 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:38,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:38,857 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:38,857 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:38,857 INFO L87 Difference]: Start difference. First operand 3806 states and 4906 transitions. Second operand 10 states. [2018-09-19 06:01:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:41,548 INFO L93 Difference]: Finished difference Result 8367 states and 11098 transitions. [2018-09-19 06:01:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:41,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 295 [2018-09-19 06:01:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:41,562 INFO L225 Difference]: With dead ends: 8367 [2018-09-19 06:01:41,562 INFO L226 Difference]: Without dead ends: 4711 [2018-09-19 06:01:41,570 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:41,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2018-09-19 06:01:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4649. [2018-09-19 06:01:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-09-19 06:01:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6018 transitions. [2018-09-19 06:01:41,658 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6018 transitions. Word has length 295 [2018-09-19 06:01:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:41,659 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 6018 transitions. [2018-09-19 06:01:41,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:41,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6018 transitions. [2018-09-19 06:01:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-19 06:01:41,670 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:41,670 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:41,670 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:41,670 INFO L82 PathProgramCache]: Analyzing trace with hash -273167450, now seen corresponding path program 1 times [2018-09-19 06:01:41,671 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:41,671 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-09-19 06:01:41,671 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [526], [527], [531], [535], [538], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:41,673 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:41,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:41,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:41,828 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:41,829 INFO L272 AbstractInterpreter]: Visited 90 different actions 438 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:41,868 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:42,065 INFO L232 lantSequenceWeakener]: Weakened 300 states. On average, predicates are now at 73.54% of their original sizes. [2018-09-19 06:01:42,065 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:42,259 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:42,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:42,259 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:42,259 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:42,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:42,260 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:42,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:42,260 INFO L87 Difference]: Start difference. First operand 4649 states and 6018 transitions. Second operand 10 states. [2018-09-19 06:01:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:44,268 INFO L93 Difference]: Finished difference Result 9531 states and 12530 transitions. [2018-09-19 06:01:44,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:44,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 303 [2018-09-19 06:01:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:44,291 INFO L225 Difference]: With dead ends: 9531 [2018-09-19 06:01:44,292 INFO L226 Difference]: Without dead ends: 5032 [2018-09-19 06:01:44,300 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 310 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2018-09-19 06:01:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4977. [2018-09-19 06:01:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-09-19 06:01:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6473 transitions. [2018-09-19 06:01:44,388 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6473 transitions. Word has length 303 [2018-09-19 06:01:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:44,389 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6473 transitions. [2018-09-19 06:01:44,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6473 transitions. [2018-09-19 06:01:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-19 06:01:44,402 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:44,402 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, 4, 4, 4, 4, 4, 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] [2018-09-19 06:01:44,402 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:44,403 INFO L82 PathProgramCache]: Analyzing trace with hash 498996958, now seen corresponding path program 1 times [2018-09-19 06:01:44,403 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:44,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 320 with the following transitions: [2018-09-19 06:01:44,403 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:44,405 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:44,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:44,430 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:48,896 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:48,897 INFO L272 AbstractInterpreter]: Visited 97 different actions 569 times. Merged at 8 different actions 42 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:48,905 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:50,223 INFO L232 lantSequenceWeakener]: Weakened 316 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 06:01:50,223 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:50,302 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:50,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:50,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:50,303 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:50,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:50,304 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:50,304 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:50,304 INFO L87 Difference]: Start difference. First operand 4977 states and 6473 transitions. Second operand 10 states. [2018-09-19 06:01:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:52,446 INFO L93 Difference]: Finished difference Result 10225 states and 13506 transitions. [2018-09-19 06:01:52,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:01:52,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 319 [2018-09-19 06:01:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:52,471 INFO L225 Difference]: With dead ends: 10225 [2018-09-19 06:01:52,471 INFO L226 Difference]: Without dead ends: 5398 [2018-09-19 06:01:52,480 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 326 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2018-09-19 06:01:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5325. [2018-09-19 06:01:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2018-09-19 06:01:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6951 transitions. [2018-09-19 06:01:52,572 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6951 transitions. Word has length 319 [2018-09-19 06:01:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:52,572 INFO L480 AbstractCegarLoop]: Abstraction has 5325 states and 6951 transitions. [2018-09-19 06:01:52,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6951 transitions. [2018-09-19 06:01:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-19 06:01:52,585 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:52,585 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-09-19 06:01:52,585 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1780095786, now seen corresponding path program 1 times [2018-09-19 06:01:52,586 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:52,586 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 322 with the following transitions: [2018-09-19 06:01:52,586 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [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], [610], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:52,588 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:52,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:52,612 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:52,775 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:52,775 INFO L272 AbstractInterpreter]: Visited 108 different actions 528 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:52,780 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:52,952 INFO L232 lantSequenceWeakener]: Weakened 318 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 06:01:52,953 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:53,068 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:53,068 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:53,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:53,068 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:53,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:53,069 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:53,069 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:53,069 INFO L87 Difference]: Start difference. First operand 5325 states and 6951 transitions. Second operand 10 states. [2018-09-19 06:01:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:01:56,218 INFO L93 Difference]: Finished difference Result 12495 states and 16698 transitions. [2018-09-19 06:01:56,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:01:56,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2018-09-19 06:01:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:01:56,244 INFO L225 Difference]: With dead ends: 12495 [2018-09-19 06:01:56,244 INFO L226 Difference]: Without dead ends: 7320 [2018-09-19 06:01:56,256 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 328 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:01:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2018-09-19 06:01:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 7265. [2018-09-19 06:01:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7265 states. [2018-09-19 06:01:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 9556 transitions. [2018-09-19 06:01:56,386 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 9556 transitions. Word has length 321 [2018-09-19 06:01:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:01:56,386 INFO L480 AbstractCegarLoop]: Abstraction has 7265 states and 9556 transitions. [2018-09-19 06:01:56,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:01:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 9556 transitions. [2018-09-19 06:01:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-19 06:01:56,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:01:56,401 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:01:56,402 INFO L423 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:01:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash -472529648, now seen corresponding path program 1 times [2018-09-19 06:01:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:01:56,402 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 322 with the following transitions: [2018-09-19 06:01:56,402 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:01:56,404 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:01:56,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:01:56,434 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:01:56,575 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:01:56,575 INFO L272 AbstractInterpreter]: Visited 104 different actions 510 times. Merged at 8 different actions 34 times. Never widened. Found 8 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:01:56,602 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:01:56,796 INFO L232 lantSequenceWeakener]: Weakened 318 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 06:01:56,796 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:01:56,880 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:01:56,881 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:01:56,881 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:01:56,881 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:01:56,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:01:56,881 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:01:56,882 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:01:56,882 INFO L87 Difference]: Start difference. First operand 7265 states and 9556 transitions. Second operand 10 states. [2018-09-19 06:02:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:01,721 INFO L93 Difference]: Finished difference Result 16202 states and 21703 transitions. [2018-09-19 06:02:01,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:02:01,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 321 [2018-09-19 06:02:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:01,743 INFO L225 Difference]: With dead ends: 16202 [2018-09-19 06:02:01,743 INFO L226 Difference]: Without dead ends: 9087 [2018-09-19 06:02:01,754 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 328 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9087 states. [2018-09-19 06:02:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9087 to 8821. [2018-09-19 06:02:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2018-09-19 06:02:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 11487 transitions. [2018-09-19 06:02:01,917 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 11487 transitions. Word has length 321 [2018-09-19 06:02:01,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:01,918 INFO L480 AbstractCegarLoop]: Abstraction has 8821 states and 11487 transitions. [2018-09-19 06:02:01,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:01,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 11487 transitions. [2018-09-19 06:02:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-09-19 06:02:01,937 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:01,937 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:02:01,937 INFO L423 AbstractCegarLoop]: === Iteration 22 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:01,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1962452691, now seen corresponding path program 1 times [2018-09-19 06:02:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:01,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2018-09-19 06:02:01,939 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], [449], [457], [465], [473], [481], [485], [487], [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], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [782], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:01,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:01,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:01,997 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:02,218 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:02,218 INFO L272 AbstractInterpreter]: Visited 150 different actions 587 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 1 different actions. Largest state had 24 variables. [2018-09-19 06:02:02,223 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:02,583 INFO L232 lantSequenceWeakener]: Weakened 328 states. On average, predicates are now at 73.44% of their original sizes. [2018-09-19 06:02:02,583 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:02,708 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:02,709 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:02,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:02,709 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:02,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:02,710 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:02,710 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:02,710 INFO L87 Difference]: Start difference. First operand 8821 states and 11487 transitions. Second operand 10 states. [2018-09-19 06:02:07,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:07,485 INFO L93 Difference]: Finished difference Result 18387 states and 24076 transitions. [2018-09-19 06:02:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:02:07,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 331 [2018-09-19 06:02:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:07,505 INFO L225 Difference]: With dead ends: 18387 [2018-09-19 06:02:07,506 INFO L226 Difference]: Without dead ends: 9716 [2018-09-19 06:02:07,517 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9716 states. [2018-09-19 06:02:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9716 to 9552. [2018-09-19 06:02:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9552 states. [2018-09-19 06:02:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9552 states to 9552 states and 12465 transitions. [2018-09-19 06:02:07,683 INFO L78 Accepts]: Start accepts. Automaton has 9552 states and 12465 transitions. Word has length 331 [2018-09-19 06:02:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:07,684 INFO L480 AbstractCegarLoop]: Abstraction has 9552 states and 12465 transitions. [2018-09-19 06:02:07,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9552 states and 12465 transitions. [2018-09-19 06:02:07,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-19 06:02:07,699 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:07,699 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-09-19 06:02:07,699 INFO L423 AbstractCegarLoop]: === Iteration 23 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:07,700 INFO L82 PathProgramCache]: Analyzing trace with hash -434401410, now seen corresponding path program 1 times [2018-09-19 06:02:07,700 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:07,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-09-19 06:02:07,700 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [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], [679], [683], [687], [691], [695], [699], [702], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:07,703 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:07,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:07,726 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:07,977 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:07,978 INFO L272 AbstractInterpreter]: Visited 131 different actions 774 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:02:07,983 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:08,159 INFO L232 lantSequenceWeakener]: Weakened 336 states. On average, predicates are now at 73.46% of their original sizes. [2018-09-19 06:02:08,160 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:08,269 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:08,270 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:08,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:08,270 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:08,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:08,270 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:08,271 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:08,271 INFO L87 Difference]: Start difference. First operand 9552 states and 12465 transitions. Second operand 10 states. [2018-09-19 06:02:10,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:10,261 INFO L93 Difference]: Finished difference Result 19826 states and 26220 transitions. [2018-09-19 06:02:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:02:10,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 339 [2018-09-19 06:02:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:10,281 INFO L225 Difference]: With dead ends: 19826 [2018-09-19 06:02:10,281 INFO L226 Difference]: Without dead ends: 10424 [2018-09-19 06:02:10,291 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 346 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10424 states. [2018-09-19 06:02:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10424 to 10350. [2018-09-19 06:02:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10350 states. [2018-09-19 06:02:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10350 states to 10350 states and 13664 transitions. [2018-09-19 06:02:10,449 INFO L78 Accepts]: Start accepts. Automaton has 10350 states and 13664 transitions. Word has length 339 [2018-09-19 06:02:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:10,450 INFO L480 AbstractCegarLoop]: Abstraction has 10350 states and 13664 transitions. [2018-09-19 06:02:10,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10350 states and 13664 transitions. [2018-09-19 06:02:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-19 06:02:10,465 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:10,465 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, 4, 4, 4, 4, 4, 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] [2018-09-19 06:02:10,466 INFO L423 AbstractCegarLoop]: === Iteration 24 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:10,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1324297582, now seen corresponding path program 1 times [2018-09-19 06:02:10,466 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:10,466 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-09-19 06:02:10,467 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], [449], [457], [465], [473], [481], [485], [487], [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], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:10,469 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:10,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:10,492 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:10,703 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:10,704 INFO L272 AbstractInterpreter]: Visited 119 different actions 700 times. Merged at 8 different actions 41 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:02:10,731 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:10,871 INFO L232 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 06:02:10,871 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:10,943 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:10,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:10,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:10,943 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:10,944 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:10,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:10,944 INFO L87 Difference]: Start difference. First operand 10350 states and 13664 transitions. Second operand 10 states. [2018-09-19 06:02:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:12,879 INFO L93 Difference]: Finished difference Result 21036 states and 27952 transitions. [2018-09-19 06:02:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:02:12,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 341 [2018-09-19 06:02:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:12,900 INFO L225 Difference]: With dead ends: 21036 [2018-09-19 06:02:12,900 INFO L226 Difference]: Without dead ends: 10836 [2018-09-19 06:02:12,913 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:12,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10836 states. [2018-09-19 06:02:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10836 to 10710. [2018-09-19 06:02:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10710 states. [2018-09-19 06:02:13,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10710 states to 10710 states and 14126 transitions. [2018-09-19 06:02:13,212 INFO L78 Accepts]: Start accepts. Automaton has 10710 states and 14126 transitions. Word has length 341 [2018-09-19 06:02:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:13,213 INFO L480 AbstractCegarLoop]: Abstraction has 10710 states and 14126 transitions. [2018-09-19 06:02:13,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 10710 states and 14126 transitions. [2018-09-19 06:02:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-19 06:02:13,222 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:13,223 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:02:13,223 INFO L423 AbstractCegarLoop]: === Iteration 25 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:13,223 INFO L82 PathProgramCache]: Analyzing trace with hash -564410888, now seen corresponding path program 1 times [2018-09-19 06:02:13,223 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:13,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 342 with the following transitions: [2018-09-19 06:02:13,224 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [534], [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], [674], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:13,226 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:13,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:13,255 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:13,548 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:13,548 INFO L272 AbstractInterpreter]: Visited 124 different actions 732 times. Merged at 8 different actions 43 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:02:13,553 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:13,747 INFO L232 lantSequenceWeakener]: Weakened 338 states. On average, predicates are now at 73.45% of their original sizes. [2018-09-19 06:02:13,747 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:13,852 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:13,852 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:13,852 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:13,852 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:13,853 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:13,853 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:13,853 INFO L87 Difference]: Start difference. First operand 10710 states and 14126 transitions. Second operand 10 states. [2018-09-19 06:02:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:17,064 INFO L93 Difference]: Finished difference Result 22957 states and 30637 transitions. [2018-09-19 06:02:17,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:02:17,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 341 [2018-09-19 06:02:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:17,091 INFO L225 Difference]: With dead ends: 22957 [2018-09-19 06:02:17,091 INFO L226 Difference]: Without dead ends: 12397 [2018-09-19 06:02:17,106 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 348 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12397 states. [2018-09-19 06:02:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12397 to 12226. [2018-09-19 06:02:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12226 states. [2018-09-19 06:02:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12226 states to 12226 states and 16091 transitions. [2018-09-19 06:02:17,299 INFO L78 Accepts]: Start accepts. Automaton has 12226 states and 16091 transitions. Word has length 341 [2018-09-19 06:02:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:17,299 INFO L480 AbstractCegarLoop]: Abstraction has 12226 states and 16091 transitions. [2018-09-19 06:02:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12226 states and 16091 transitions. [2018-09-19 06:02:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-09-19 06:02:17,310 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:17,311 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-09-19 06:02:17,311 INFO L423 AbstractCegarLoop]: === Iteration 26 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash 871107346, now seen corresponding path program 1 times [2018-09-19 06:02:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:17,311 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 350 with the following transitions: [2018-09-19 06:02:17,312 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [542], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [706], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:02:17,314 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:17,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:17,337 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:17,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:02:17,545 INFO L272 AbstractInterpreter]: Visited 132 different actions 648 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:02:17,579 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:02:17,786 INFO L232 lantSequenceWeakener]: Weakened 346 states. On average, predicates are now at 73.43% of their original sizes. [2018-09-19 06:02:17,786 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:02:18,478 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:02:18,478 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:02:18,478 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:02:18,478 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:02:18,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:02:18,479 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:02:18,479 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:02:18,479 INFO L87 Difference]: Start difference. First operand 12226 states and 16091 transitions. Second operand 10 states. [2018-09-19 06:02:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:02:21,611 INFO L93 Difference]: Finished difference Result 27351 states and 36318 transitions. [2018-09-19 06:02:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:02:21,611 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 349 [2018-09-19 06:02:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:02:21,642 INFO L225 Difference]: With dead ends: 27351 [2018-09-19 06:02:21,642 INFO L226 Difference]: Without dead ends: 15275 [2018-09-19 06:02:21,657 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 356 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:02:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15275 states. [2018-09-19 06:02:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15275 to 15041. [2018-09-19 06:02:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15041 states. [2018-09-19 06:02:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 19851 transitions. [2018-09-19 06:02:21,879 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 19851 transitions. Word has length 349 [2018-09-19 06:02:21,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:02:21,879 INFO L480 AbstractCegarLoop]: Abstraction has 15041 states and 19851 transitions. [2018-09-19 06:02:21,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:02:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 19851 transitions. [2018-09-19 06:02:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-19 06:02:21,888 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:02:21,888 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, 4, 4, 4, 4, 4, 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] [2018-09-19 06:02:21,888 INFO L423 AbstractCegarLoop]: === Iteration 27 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:02:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1376203201, now seen corresponding path program 1 times [2018-09-19 06:02:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:02:21,889 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2018-09-19 06:02:21,889 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], [449], [457], [465], [473], [481], [485], [487], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [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-19 06:02:21,891 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:02:21,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:02:21,914 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:02:24,226 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:02:24,226 INFO L272 AbstractInterpreter]: Visited 130 different actions 634 times. Merged at 8 different actions 32 times. Never widened. Found 7 fixpoints after 2 different actions. Largest state had 24 variables. [2018-09-19 06:02:24,239 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:02:24,284 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:02:24,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:02:24 BoogieIcfgContainer [2018-09-19 06:02:24,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:02:24,285 INFO L168 Benchmark]: Toolchain (without parser) took 110867.99 ms. Allocated memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: 2.4 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2018-09-19 06:02:24,287 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:02:24,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.36 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:02:24,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.42 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-19 06:02:24,289 INFO L168 Benchmark]: Boogie Preprocessor took 246.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -892.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:02:24,290 INFO L168 Benchmark]: RCFGBuilder took 3923.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. [2018-09-19 06:02:24,290 INFO L168 Benchmark]: TraceAbstraction took 105818.44 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -413.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-09-19 06:02:24,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.36 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 128.42 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 246.08 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 791.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -892.3 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3923.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105818.44 ms. Allocated memory was 2.3 GB in the beginning and 3.9 GB in the end (delta: 1.6 GB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -413.0 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 202]: 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 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 TRUE ((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14)) [L297] a1 = ((((((a1 * 9)/ 10) % 299993)+ -300005) / 5) + -75819) [L298] a10 = 4 [L300] RET return 26; [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 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 TRUE (((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6)) [L202] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 105.7s OverallTime, 27 OverallIterations, 4 TraceHistogramMax, 76.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4771 SDtfs, 16499 SDslu, 8468 SDs, 0 SdLazy, 46404 SolverSat, 4970 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 62.0s Time, PredicateUnifierStatistics: 52 DeclaredPredicates, 6875 GetRequests, 6474 SyntacticMatches, 0 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15041occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.6s AbstIntTime, 27 AbstIntIterations, 26 AbstIntStrong, 0.9970491750697922 AbsIntWeakeningRatio, 0.10302485774183888 AbsIntAvgWeakeningVarsNumRemoved, 19.515124288709195 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 1619 StatesRemovedByMinimization, 26 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_label04_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-02-24-309.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label04_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-02-24-309.csv Received shutdown request...