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_label33_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:03:55,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:03:55,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:03:55,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:03:55,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:03:55,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:03:55,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:03:55,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:03:55,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:03:55,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:03:55,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:03:55,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:03:55,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:03:55,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:03:55,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:03:55,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:03:55,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:03:55,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:03:55,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:03:55,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:03:55,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:03:55,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:03:55,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:03:55,709 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:03:55,709 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:03:55,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:03:55,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:03:55,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:03:55,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:03:55,722 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:03:55,722 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:03:55,723 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:03:55,727 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:03:55,727 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:03:55,728 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:03:55,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:03:55,731 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:03:55,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:03:55,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:03:55,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:03:55,765 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:03:55,765 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:03:55,765 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:03:55,766 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:03:55,766 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:03:55,766 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:03:55,766 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:03:55,766 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:03:55,767 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:03:55,767 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:03:55,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:03:55,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:03:55,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:03:55,768 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:03:55,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:03:55,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:03:55,770 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:03:55,770 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:03:55,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:03:55,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:03:55,771 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:03:55,771 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:03:55,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:03:55,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:03:55,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:03:55,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:03:55,773 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:03:55,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:03:55,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:03:55,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:03:55,773 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:03:55,774 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:03:55,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:03:55,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:03:55,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:03:55,853 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:03:55,853 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:03:55,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label33_true-unreach-call.c [2018-09-19 06:03:56,219 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f151779d/8e8da10c9dbd4e7eafaf5d0e4b8e1377/FLAGe72db0f2e [2018-09-19 06:03:56,473 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:03:56,474 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label33_true-unreach-call.c [2018-09-19 06:03:56,496 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f151779d/8e8da10c9dbd4e7eafaf5d0e4b8e1377/FLAGe72db0f2e [2018-09-19 06:03:56,521 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f151779d/8e8da10c9dbd4e7eafaf5d0e4b8e1377 [2018-09-19 06:03:56,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:03:56,538 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:03:56,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:03:56,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:03:56,547 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:03:56,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:03:56" (1/1) ... [2018-09-19 06:03:56,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f1297b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:56, skipping insertion in model container [2018-09-19 06:03:56,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:03:56" (1/1) ... [2018-09-19 06:03:56,565 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:03:57,142 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:03:57,164 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:03:57,302 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:03:57,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57 WrapperNode [2018-09-19 06:03:57,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:03:57,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:03:57,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:03:57,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:03:57,365 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:03:57" (1/1) ... [2018-09-19 06:03:57,397 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:03:57" (1/1) ... [2018-09-19 06:03:57,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:03:57,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:03:57,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:03:57,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:03:57,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (1/1) ... [2018-09-19 06:03:57,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:03:57,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:03:57,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:03:57,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:03:57,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (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:03:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:03:57,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:03:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:03:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:03:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:03:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:03:57,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:03:57,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:04:01,419 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:04:01,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:01 BoogieIcfgContainer [2018-09-19 06:04:01,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:04:01,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:04:01,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:04:01,425 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:04:01,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:03:56" (1/3) ... [2018-09-19 06:04:01,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71faa919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:01, skipping insertion in model container [2018-09-19 06:04:01,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:57" (2/3) ... [2018-09-19 06:04:01,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71faa919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:04:01, skipping insertion in model container [2018-09-19 06:04:01,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:04:01" (3/3) ... [2018-09-19 06:04:01,429 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label33_true-unreach-call.c [2018-09-19 06:04:01,438 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:04:01,448 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:04:01,498 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:04:01,499 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:04:01,499 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:04:01,499 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:04:01,499 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:04:01,500 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:04:01,500 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:04:01,500 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:04:01,501 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:04:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:04:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-19 06:04:01,544 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:01,545 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] [2018-09-19 06:04:01,546 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2083208225, now seen corresponding path program 1 times [2018-09-19 06:04:01,555 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:01,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-09-19 06:04:01,559 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], [309], [311], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:04:01,604 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:01,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:01,914 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:01,918 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:04:01,966 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:02,105 INFO L232 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 75.16% of their original sizes. [2018-09-19 06:04:02,106 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:02,347 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:02,350 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:02,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:04:02,350 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:02,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:04:02,367 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:04:02,368 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:04:02,371 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:04:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:04,913 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:04:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:04:04,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-09-19 06:04:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:04,943 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:04:04,943 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:04:04,957 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 46 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:04:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:04:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:04:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:04:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:04:05,035 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 51 [2018-09-19 06:04:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:05,036 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:04:05,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:04:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:04:05,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-19 06:04:05,042 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:05,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:05,044 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:05,044 INFO L82 PathProgramCache]: Analyzing trace with hash -961000269, now seen corresponding path program 1 times [2018-09-19 06:04:05,044 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:05,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 123 with the following transitions: [2018-09-19 06:04:05,045 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:05,051 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:05,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:05,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:05,243 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:05,243 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:04:05,260 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:05,400 INFO L232 lantSequenceWeakener]: Weakened 119 states. On average, predicates are now at 73.79% of their original sizes. [2018-09-19 06:04:05,400 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:05,667 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:05,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:05,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:05,668 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:05,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:05,669 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:05,670 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:05,670 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:04:10,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:10,869 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:04:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:10,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 122 [2018-09-19 06:04:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:10,879 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:04:10,879 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:04:10,882 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 128 GetRequests, 113 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:04:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:04:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:04:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:04:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:04:10,914 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 122 [2018-09-19 06:04:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:10,915 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:04:10,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:04:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-19 06:04:10,919 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:10,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,920 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:10,920 INFO L82 PathProgramCache]: Analyzing trace with hash -660742804, now seen corresponding path program 1 times [2018-09-19 06:04:10,920 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:10,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 132 with the following transitions: [2018-09-19 06:04:10,921 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:10,925 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:10,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:10,975 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:11,049 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:11,049 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:04:11,088 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:11,213 INFO L232 lantSequenceWeakener]: Weakened 128 states. On average, predicates are now at 73.71% of their original sizes. [2018-09-19 06:04:11,213 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:11,528 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:11,528 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:11,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:11,529 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:11,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:11,530 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:11,530 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:11,530 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:04:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:14,094 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:04:14,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:14,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-09-19 06:04:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:14,103 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:04:14,103 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:04:14,105 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 138 GetRequests, 122 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:04:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:04:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:04:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:04:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:04:14,144 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 131 [2018-09-19 06:04:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:14,145 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:04:14,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:04:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-19 06:04:14,150 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:14,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:14,151 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:14,151 INFO L82 PathProgramCache]: Analyzing trace with hash 931027572, now seen corresponding path program 1 times [2018-09-19 06:04:14,152 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:14,152 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 168 with the following transitions: [2018-09-19 06:04:14,152 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:14,157 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:14,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:14,254 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:14,426 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:14,426 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:04:14,459 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:14,643 INFO L232 lantSequenceWeakener]: Weakened 164 states. On average, predicates are now at 73.5% of their original sizes. [2018-09-19 06:04:14,643 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:15,426 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:15,426 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:15,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:15,427 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:15,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:15,427 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:15,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:15,428 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:04:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:18,675 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:04:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:18,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 167 [2018-09-19 06:04:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:18,681 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:04:18,682 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:04:18,684 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 173 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:04:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:04:18,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:04:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:04:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:04:18,717 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 167 [2018-09-19 06:04:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:18,718 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:04:18,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:04:18,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-19 06:04:18,724 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:18,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:18,725 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash 372076851, now seen corresponding path program 1 times [2018-09-19 06:04:18,725 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:18,725 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 187 with the following transitions: [2018-09-19 06:04:18,726 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [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:04:18,731 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:18,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:18,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:18,931 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:04:18,965 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:19,116 INFO L232 lantSequenceWeakener]: Weakened 183 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-19 06:04:19,117 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:19,895 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:19,895 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:19,896 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:19,896 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:19,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:19,896 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:19,896 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:19,897 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:04:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:22,830 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:04:22,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:04:22,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 186 [2018-09-19 06:04:22,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:22,847 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:04:22,847 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:04:22,851 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:04:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:04:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:04:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:04:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:04:22,894 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 186 [2018-09-19 06:04:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:22,895 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:04:22,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:04:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-19 06:04:22,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:22,899 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, 2, 2, 2, 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] [2018-09-19 06:04:22,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash -575460298, now seen corresponding path program 1 times [2018-09-19 06:04:22,900 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:22,900 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 199 with the following transitions: [2018-09-19 06:04:22,901 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [518], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:22,904 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:22,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:22,936 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:23,009 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:23,009 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:04:23,047 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:23,163 INFO L232 lantSequenceWeakener]: Weakened 195 states. On average, predicates are now at 73.42% of their original sizes. [2018-09-19 06:04:23,164 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:23,502 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:23,503 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:23,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:23,503 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:23,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:23,504 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:23,504 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:23,504 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:04:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:25,859 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:04:25,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:25,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 198 [2018-09-19 06:04:25,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:25,868 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:04:25,868 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:04:25,872 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 205 GetRequests, 189 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:04:25,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:04:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:04:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:04:25,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:04:25,916 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 198 [2018-09-19 06:04:25,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:25,917 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:04:25,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:04:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-19 06:04:25,921 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:25,921 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, 2, 2, 2, 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] [2018-09-19 06:04:25,921 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash 70592282, now seen corresponding path program 1 times [2018-09-19 06:04:25,922 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:25,922 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2018-09-19 06:04:25,922 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:04:25,925 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:25,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:25,954 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:26,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:26,040 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:04:26,052 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:26,170 INFO L232 lantSequenceWeakener]: Weakened 197 states. On average, predicates are now at 73.41% of their original sizes. [2018-09-19 06:04:26,171 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:26,441 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:26,441 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:26,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:26,442 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:26,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:26,442 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:26,443 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:26,443 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:04:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:28,973 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:04:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:28,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 200 [2018-09-19 06:04:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:28,989 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:04:28,989 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:04:28,994 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 207 GetRequests, 191 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:04:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:04:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:04:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:04:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:04:29,044 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 200 [2018-09-19 06:04:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:29,045 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:04:29,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:04:29,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-19 06:04:29,049 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:29,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, 2, 2, 2, 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] [2018-09-19 06:04:29,050 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash -34102046, now seen corresponding path program 1 times [2018-09-19 06:04:29,050 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:29,050 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-19 06:04:29,051 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:04:29,053 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:29,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:29,081 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:29,162 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:29,162 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:04:29,198 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:29,312 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-19 06:04:29,312 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:29,421 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:29,421 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:29,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:29,422 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:29,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:29,423 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:29,423 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:29,423 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:04:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:32,124 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:04:32,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:32,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2018-09-19 06:04:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:32,143 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:04:32,143 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:04:32,148 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 195 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:04:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:04:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:04:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:04:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:04:32,211 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 204 [2018-09-19 06:04:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:32,213 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:04:32,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:04:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-19 06:04:32,218 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:32,218 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, 2, 2, 2, 2, 2, 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] [2018-09-19 06:04:32,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash -939092756, now seen corresponding path program 1 times [2018-09-19 06:04:32,219 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:32,219 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-09-19 06:04:32,219 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:04:32,221 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:32,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:32,259 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:32,339 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:32,340 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:04:32,375 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:32,505 INFO L232 lantSequenceWeakener]: Weakened 201 states. On average, predicates are now at 73.4% of their original sizes. [2018-09-19 06:04:32,506 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:33,227 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:33,228 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:33,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:33,228 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:33,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:33,229 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:33,229 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:33,229 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:04:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:35,644 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:04:35,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:35,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 204 [2018-09-19 06:04:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:35,656 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:04:35,656 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:04:35,662 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 211 GetRequests, 195 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:04:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:04:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:04:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:04:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:04:35,718 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 204 [2018-09-19 06:04:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:35,718 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:04:35,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:04:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-19 06:04:35,723 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:35,724 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, 2, 2, 2, 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] [2018-09-19 06:04:35,724 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:35,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1072543118, now seen corresponding path program 1 times [2018-09-19 06:04:35,724 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:35,725 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-09-19 06:04:35,725 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:35,727 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:35,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:35,754 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:38,378 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:38,378 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:04:38,383 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:38,960 INFO L232 lantSequenceWeakener]: Weakened 207 states. On average, predicates are now at 73.38% of their original sizes. [2018-09-19 06:04:38,961 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:39,059 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:39,059 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:39,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:39,059 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:39,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:39,060 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:39,060 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:39,060 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:04:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:41,586 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:04:41,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:41,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 210 [2018-09-19 06:04:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:41,597 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:04:41,597 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:04:41,602 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 201 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:04:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:04:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:04:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:04:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:04:41,653 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 210 [2018-09-19 06:04:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:41,654 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:04:41,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:04:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-19 06:04:41,659 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:41,659 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, 2, 2, 2, 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:04:41,659 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:41,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1493761739, now seen corresponding path program 1 times [2018-09-19 06:04:41,660 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:41,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-09-19 06:04:41,660 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [602], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:41,662 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:41,662 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:41,688 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:42,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:42,169 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:04:42,206 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:42,458 INFO L232 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 73.35% of their original sizes. [2018-09-19 06:04:42,458 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:42,588 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:42,588 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:42,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:42,589 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:42,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:42,589 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:42,589 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:42,590 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:04:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:44,256 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:04:44,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:44,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 219 [2018-09-19 06:04:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:44,269 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:04:44,270 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:04:44,276 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 226 GetRequests, 210 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:04:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:04:44,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:04:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:04:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:04:44,335 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 219 [2018-09-19 06:04:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:44,336 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:04:44,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:44,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:04:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-19 06:04:44,341 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:44,342 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, 2, 2, 2, 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] [2018-09-19 06:04:44,342 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 624082465, now seen corresponding path program 1 times [2018-09-19 06:04:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:44,343 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-09-19 06:04:44,343 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [626], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:44,345 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:44,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:44,371 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:44,523 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:44,523 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:04:44,560 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:44,691 INFO L232 lantSequenceWeakener]: Weakened 222 states. On average, predicates are now at 73.34% of their original sizes. [2018-09-19 06:04:44,691 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:44,992 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:44,993 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:44,993 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:44,993 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:44,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:44,994 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:44,994 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:44,994 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:04:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:48,603 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:04:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:48,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 225 [2018-09-19 06:04:48,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:48,615 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:04:48,615 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:04:48,622 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 232 GetRequests, 216 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:04:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:04:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:04:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:04:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:04:48,683 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 225 [2018-09-19 06:04:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:48,683 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:04:48,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:04:48,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-19 06:04:48,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:48,689 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, 2, 2, 2, 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] [2018-09-19 06:04:48,690 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash -444099238, now seen corresponding path program 1 times [2018-09-19 06:04:48,690 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:48,690 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2018-09-19 06:04:48,691 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:48,693 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:48,693 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:48,718 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:48,859 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:48,860 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:04:48,895 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:49,026 INFO L232 lantSequenceWeakener]: Weakened 229 states. On average, predicates are now at 73.32% of their original sizes. [2018-09-19 06:04:49,026 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:49,131 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:49,131 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:49,131 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:49,131 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:49,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:49,132 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:49,132 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:49,133 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:04:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:51,641 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:04:51,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:51,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 232 [2018-09-19 06:04:51,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:51,655 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:04:51,655 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:04:51,661 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 239 GetRequests, 223 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:04:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:04:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:04:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:04:51,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:04:51,728 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 232 [2018-09-19 06:04:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:51,729 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:04:51,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:04:51,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-19 06:04:51,735 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:51,736 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, 2, 2, 2, 2, 2, 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] [2018-09-19 06:04:51,736 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash 575832292, now seen corresponding path program 1 times [2018-09-19 06:04:51,736 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:51,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2018-09-19 06:04:51,737 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:04:51,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:51,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:51,799 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:51,948 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:51,948 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:04:51,986 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:52,135 INFO L232 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 73.3% of their original sizes. [2018-09-19 06:04:52,135 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:52,269 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:52,269 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:52,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:52,269 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:52,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:52,270 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:52,270 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:52,270 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:04:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:54,023 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:04:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:54,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 240 [2018-09-19 06:04:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:54,044 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:04:54,044 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:04:54,052 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 247 GetRequests, 231 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:04:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:04:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:04:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:04:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:04:54,123 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 240 [2018-09-19 06:04:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:54,124 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:04:54,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:04:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-19 06:04:54,131 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:54,131 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:54,131 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 951201458, now seen corresponding path program 1 times [2018-09-19 06:04:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:54,132 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-09-19 06:04:54,132 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [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:04:54,135 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:54,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:54,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:54,454 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:54,454 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:04:54,460 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:54,572 INFO L232 lantSequenceWeakener]: Weakened 241 states. On average, predicates are now at 73.29% of their original sizes. [2018-09-19 06:04:54,572 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:54,640 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:54,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:54,641 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:54,641 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:54,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:54,641 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:54,641 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:54,642 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:04:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:56,280 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:04:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:56,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2018-09-19 06:04:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:56,305 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:04:56,305 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:04:56,315 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 251 GetRequests, 235 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:04:56,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:04:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:04:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:04:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:04:56,390 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 244 [2018-09-19 06:04:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:56,391 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:04:56,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:56,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:04:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-19 06:04:56,401 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:56,402 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, 2, 2, 2, 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] [2018-09-19 06:04:56,403 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:56,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1324363259, now seen corresponding path program 1 times [2018-09-19 06:04:56,403 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:56,404 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2018-09-19 06:04:56,404 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [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:04:56,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:56,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:56,434 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:56,638 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:56,639 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:04:56,684 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:56,814 INFO L232 lantSequenceWeakener]: Weakened 256 states. On average, predicates are now at 73.26% of their original sizes. [2018-09-19 06:04:56,814 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:57,002 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:57,002 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:57,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:57,002 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:57,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:57,003 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:57,003 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:57,004 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:04:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:59,003 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:04:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:59,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-09-19 06:04:59,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:59,023 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:04:59,023 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:04:59,030 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 266 GetRequests, 250 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:04:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:04:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:04:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:04:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:04:59,099 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 259 [2018-09-19 06:04:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:59,100 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:04:59,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:04:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-09-19 06:04:59,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:59,110 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-09-19 06:04:59,110 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1654469485, now seen corresponding path program 1 times [2018-09-19 06:04:59,111 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:59,111 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 274 with the following transitions: [2018-09-19 06:04:59,111 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:04:59,114 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:59,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:59,145 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:59,383 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:59,383 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:04:59,417 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:59,600 INFO L232 lantSequenceWeakener]: Weakened 270 states. On average, predicates are now at 73.23% of their original sizes. [2018-09-19 06:04:59,600 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:59,775 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:59,776 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:59,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:59,776 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:59,776 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:59,777 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:59,777 INFO L87 Difference]: Start difference. First operand 3806 states and 4906 transitions. Second operand 10 states. [2018-09-19 06:05:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:03,071 INFO L93 Difference]: Finished difference Result 8367 states and 11098 transitions. [2018-09-19 06:05:03,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:03,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 273 [2018-09-19 06:05:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:03,084 INFO L225 Difference]: With dead ends: 8367 [2018-09-19 06:05:03,084 INFO L226 Difference]: Without dead ends: 4711 [2018-09-19 06:05:03,092 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 280 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:05:03,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2018-09-19 06:05:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4649. [2018-09-19 06:05:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-09-19 06:05:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6018 transitions. [2018-09-19 06:05:03,191 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6018 transitions. Word has length 273 [2018-09-19 06:05:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:03,191 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 6018 transitions. [2018-09-19 06:05:03,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6018 transitions. [2018-09-19 06:05:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-19 06:05:03,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:03,201 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, 3, 3, 3, 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] [2018-09-19 06:05:03,201 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:03,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1969050482, now seen corresponding path program 1 times [2018-09-19 06:05:03,201 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:03,202 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 282 with the following transitions: [2018-09-19 06:05:03,202 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:05:03,204 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:03,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:03,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:03,355 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:03,355 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:05:03,392 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:03,570 INFO L232 lantSequenceWeakener]: Weakened 278 states. On average, predicates are now at 73.25% of their original sizes. [2018-09-19 06:05:03,570 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:03,707 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:03,708 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:03,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:03,708 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:03,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:03,708 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:03,708 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:03,709 INFO L87 Difference]: Start difference. First operand 4649 states and 6018 transitions. Second operand 10 states. [2018-09-19 06:05:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:06,131 INFO L93 Difference]: Finished difference Result 9531 states and 12530 transitions. [2018-09-19 06:05:06,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:05:06,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 281 [2018-09-19 06:05:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:06,146 INFO L225 Difference]: With dead ends: 9531 [2018-09-19 06:05:06,146 INFO L226 Difference]: Without dead ends: 5032 [2018-09-19 06:05:06,156 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 288 GetRequests, 272 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:05:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2018-09-19 06:05:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4977. [2018-09-19 06:05:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-09-19 06:05:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6473 transitions. [2018-09-19 06:05:06,253 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6473 transitions. Word has length 281 [2018-09-19 06:05:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:06,254 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6473 transitions. [2018-09-19 06:05:06,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6473 transitions. [2018-09-19 06:05:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-19 06:05:06,264 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:06,265 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:05:06,265 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash -63915578, now seen corresponding path program 1 times [2018-09-19 06:05:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:06,266 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2018-09-19 06:05:06,266 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [562], [563], [566], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:05:06,268 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:06,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:06,295 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:11,289 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:05:11,290 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:05:11,296 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:05:12,617 INFO L232 lantSequenceWeakener]: Weakened 294 states. On average, predicates are now at 73.22% of their original sizes. [2018-09-19 06:05:12,617 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:05:12,713 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:05:12,714 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:05:12,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:05:12,714 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:05:12,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:05:12,714 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:05:12,714 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:05:12,715 INFO L87 Difference]: Start difference. First operand 4977 states and 6473 transitions. Second operand 10 states. [2018-09-19 06:05:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:05:14,793 INFO L93 Difference]: Finished difference Result 10225 states and 13506 transitions. [2018-09-19 06:05:14,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:05:14,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2018-09-19 06:05:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:05:14,816 INFO L225 Difference]: With dead ends: 10225 [2018-09-19 06:05:14,816 INFO L226 Difference]: Without dead ends: 5398 [2018-09-19 06:05:14,826 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 304 GetRequests, 288 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:05:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2018-09-19 06:05:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5325. [2018-09-19 06:05:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2018-09-19 06:05:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6951 transitions. [2018-09-19 06:05:14,928 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6951 transitions. Word has length 297 [2018-09-19 06:05:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:05:14,929 INFO L480 AbstractCegarLoop]: Abstraction has 5325 states and 6951 transitions. [2018-09-19 06:05:14,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:05:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6951 transitions. [2018-09-19 06:05:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-19 06:05:14,940 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:05:14,941 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, 3, 3, 3, 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] [2018-09-19 06:05:14,941 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:05:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1642131694, now seen corresponding path program 1 times [2018-09-19 06:05:14,942 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:05:14,942 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 300 with the following transitions: [2018-09-19 06:05:14,942 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], [309], [311], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [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:05:14,944 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:05:14,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:05:14,970 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:05:15,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:05:15,141 INFO L272 AbstractInterpreter]: Visited 109 different actions 529 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:05:15,168 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:05:15,214 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:05:15,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:05:15 BoogieIcfgContainer [2018-09-19 06:05:15,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:05:15,216 INFO L168 Benchmark]: Toolchain (without parser) took 78681.40 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -407.9 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-19 06:05:15,218 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 06:05:15,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:15,219 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.39 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:05:15,220 INFO L168 Benchmark]: Boogie Preprocessor took 275.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -865.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:15,221 INFO L168 Benchmark]: RCFGBuilder took 3656.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. [2018-09-19 06:05:15,221 INFO L168 Benchmark]: TraceAbstraction took 73793.74 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 293.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-19 06:05:15,228 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 133.39 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 275.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 781.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -865.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3656.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.1 GB in the end (delta: 121.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73793.74 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 293.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 136]: 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 TRUE (((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0)) [L245] a1 = (((((a1 % 25)- -13) - 42605) / 5) - -8517) [L246] a10 = 3 [L248] 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 TRUE (((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14)) [L346] a1 = ((((a1 - 287698) - 189392) % 89)+ 206) [L347] a10 = 2 [L348] a19 = 7 [L350] 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 TRUE (((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) [L136] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 73.7s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 50.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3592 SDtfs, 11903 SDslu, 5709 SDs, 0 SdLazy, 31530 SolverSat, 3203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.8s Time, PredicateUnifierStatistics: 38 DeclaredPredicates, 4065 GetRequests, 3776 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5325occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.1s AbstIntTime, 20 AbstIntIterations, 19 AbstIntStrong, 0.9967103246072119 AbsIntWeakeningRatio, 0.11977573904179409 AbsIntAvgWeakeningVarsNumRemoved, 19.150101936799185 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 529 StatesRemovedByMinimization, 19 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_label33_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-05-15-253.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label33_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-05-15-253.csv Received shutdown request...