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_label25_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-69f5bdd-m [2018-09-19 06:03:05,844 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 06:03:05,846 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 06:03:05,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 06:03:05,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 06:03:05,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 06:03:05,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 06:03:05,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 06:03:05,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 06:03:05,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 06:03:05,878 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 06:03:05,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 06:03:05,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 06:03:05,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 06:03:05,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 06:03:05,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 06:03:05,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 06:03:05,890 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 06:03:05,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 06:03:05,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 06:03:05,899 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 06:03:05,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 06:03:05,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 06:03:05,904 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 06:03:05,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 06:03:05,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 06:03:05,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 06:03:05,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 06:03:05,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 06:03:05,912 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 06:03:05,912 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 06:03:05,913 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 06:03:05,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 06:03:05,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 06:03:05,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 06:03:05,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 06:03:05,917 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:05,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 06:03:05,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 06:03:05,949 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 06:03:05,949 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-19 06:03:05,950 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-19 06:03:05,950 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-19 06:03:05,950 INFO L133 SettingsManager]: * Congruence Domain=false [2018-09-19 06:03:05,953 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-19 06:03:05,954 INFO L133 SettingsManager]: * Octagon Domain=false [2018-09-19 06:03:05,954 INFO L133 SettingsManager]: * Abstract domain=IntervalDomain [2018-09-19 06:03:05,954 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-19 06:03:05,954 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-19 06:03:05,954 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-19 06:03:05,955 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 06:03:05,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-19 06:03:05,956 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 06:03:05,956 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 06:03:05,956 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 06:03:05,956 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 06:03:05,956 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 06:03:05,957 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 06:03:05,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 06:03:05,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 06:03:05,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 06:03:05,959 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 06:03:05,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 06:03:05,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 06:03:05,960 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 06:03:05,960 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 06:03:05,960 INFO L133 SettingsManager]: * Trace refinement strategy=TOOTHLESS_TAIPAN [2018-09-19 06:03:05,960 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 06:03:05,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-19 06:03:05,961 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 06:03:05,961 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-19 06:03:05,962 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-19 06:03:06,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 06:03:06,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 06:03:06,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 06:03:06,051 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 06:03:06,051 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 06:03:06,052 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-09-19 06:03:06,409 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917cc71eb/ab678e84d711460da5858871ac3c6465/FLAGa55f4c4d8 [2018-09-19 06:03:06,710 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 06:03:06,711 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label25_true-unreach-call.c [2018-09-19 06:03:06,728 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917cc71eb/ab678e84d711460da5858871ac3c6465/FLAGa55f4c4d8 [2018-09-19 06:03:06,751 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/917cc71eb/ab678e84d711460da5858871ac3c6465 [2018-09-19 06:03:06,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 06:03:06,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-19 06:03:06,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 06:03:06,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 06:03:06,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 06:03:06,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:03:06" (1/1) ... [2018-09-19 06:03:06,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efa186f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:06, skipping insertion in model container [2018-09-19 06:03:06,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 06:03:06" (1/1) ... [2018-09-19 06:03:06,798 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 06:03:07,264 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:03:07,286 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 06:03:07,426 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 06:03:07,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:07 WrapperNode [2018-09-19 06:03:07,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 06:03:07,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-19 06:03:07,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-19 06:03:07,482 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-19 06:03:07,492 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:07" (1/1) ... [2018-09-19 06:03:07,532 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:07" (1/1) ... [2018-09-19 06:03:07,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-19 06:03:07,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 06:03:07,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 06:03:07,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 06:03:07,787 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:07" (1/1) ... [2018-09-19 06:03:07,787 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:07" (1/1) ... [2018-09-19 06:03:07,799 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:07" (1/1) ... [2018-09-19 06:03:07,800 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:07" (1/1) ... [2018-09-19 06:03:07,840 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:07" (1/1) ... [2018-09-19 06:03:07,862 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:07" (1/1) ... [2018-09-19 06:03:07,880 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:07" (1/1) ... [2018-09-19 06:03:07,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 06:03:07,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 06:03:07,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 06:03:07,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 06:03:07,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:07" (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:07,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 06:03:07,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 06:03:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-19 06:03:07,965 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-19 06:03:07,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 06:03:07,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 06:03:07,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 06:03:07,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 06:03:11,370 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 06:03:11,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:03:11 BoogieIcfgContainer [2018-09-19 06:03:11,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 06:03:11,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 06:03:11,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 06:03:11,376 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 06:03:11,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 06:03:06" (1/3) ... [2018-09-19 06:03:11,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495704b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:03:11, skipping insertion in model container [2018-09-19 06:03:11,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 06:03:07" (2/3) ... [2018-09-19 06:03:11,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4495704b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 06:03:11, skipping insertion in model container [2018-09-19 06:03:11,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 06:03:11" (3/3) ... [2018-09-19 06:03:11,382 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2018-09-19 06:03:11,394 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 06:03:11,405 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-19 06:03:11,474 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 06:03:11,475 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 06:03:11,476 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 06:03:11,476 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 06:03:11,476 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 06:03:11,476 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 06:03:11,476 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 06:03:11,477 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 06:03:11,477 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 06:03:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-09-19 06:03:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 06:03:11,540 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:11,542 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:11,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash 382760497, now seen corresponding path program 1 times [2018-09-19 06:03:11,554 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:11,556 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-09-19 06:03:11,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], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [796], [800], [806], [810], [817], [818], [819], [821] [2018-09-19 06:03:11,631 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:11,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:11,965 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:11,969 INFO L272 AbstractInterpreter]: Visited 70 different actions 70 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-09-19 06:03:12,017 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:12,230 INFO L232 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 75.78% of their original sizes. [2018-09-19 06:03:12,230 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:12,485 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:12,487 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:12,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-19 06:03:12,487 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:12,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-19 06:03:12,502 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-19 06:03:12,503 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-19 06:03:12,505 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 6 states. [2018-09-19 06:03:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:15,605 INFO L93 Difference]: Finished difference Result 576 states and 995 transitions. [2018-09-19 06:03:15,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-19 06:03:15,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-09-19 06:03:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:15,624 INFO L225 Difference]: With dead ends: 576 [2018-09-19 06:03:15,624 INFO L226 Difference]: Without dead ends: 358 [2018-09-19 06:03:15,632 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 70 GetRequests, 66 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:03:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-19 06:03:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-09-19 06:03:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-19 06:03:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2018-09-19 06:03:15,721 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 71 [2018-09-19 06:03:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:15,722 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2018-09-19 06:03:15,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-19 06:03:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2018-09-19 06:03:15,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-19 06:03:15,730 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:15,731 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:03:15,731 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:15,731 INFO L82 PathProgramCache]: Analyzing trace with hash 793000707, now seen corresponding path program 1 times [2018-09-19 06:03:15,732 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:15,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 143 with the following transitions: [2018-09-19 06:03:15,732 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [474], [482], [490], [495], [498], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-09-19 06:03:15,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:15,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:15,842 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:15,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:15,956 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:03:15,986 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:16,211 INFO L232 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 74.29% of their original sizes. [2018-09-19 06:03:16,213 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:16,591 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:16,592 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:16,592 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:16,592 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:16,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:16,594 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:16,594 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:16,594 INFO L87 Difference]: Start difference. First operand 356 states and 497 transitions. Second operand 10 states. [2018-09-19 06:03:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:19,855 INFO L93 Difference]: Finished difference Result 717 states and 1132 transitions. [2018-09-19 06:03:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:19,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-09-19 06:03:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:19,865 INFO L225 Difference]: With dead ends: 717 [2018-09-19 06:03:19,865 INFO L226 Difference]: Without dead ends: 511 [2018-09-19 06:03:19,870 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:19,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-09-19 06:03:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 505. [2018-09-19 06:03:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-09-19 06:03:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 669 transitions. [2018-09-19 06:03:19,906 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 669 transitions. Word has length 142 [2018-09-19 06:03:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:19,907 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 669 transitions. [2018-09-19 06:03:19,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 669 transitions. [2018-09-19 06:03:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-19 06:03:19,911 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:19,912 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:03:19,912 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1467562684, now seen corresponding path program 1 times [2018-09-19 06:03:19,913 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:19,913 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-09-19 06:03:19,913 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:19,918 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:19,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:20,006 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:20,087 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:20,087 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:03:20,112 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:20,244 INFO L232 lantSequenceWeakener]: Weakened 148 states. On average, predicates are now at 74.19% of their original sizes. [2018-09-19 06:03:20,245 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:20,727 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:20,727 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:20,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:20,727 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:20,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:20,728 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:20,728 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:20,729 INFO L87 Difference]: Start difference. First operand 505 states and 669 transitions. Second operand 10 states. [2018-09-19 06:03:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:23,729 INFO L93 Difference]: Finished difference Result 1149 states and 1736 transitions. [2018-09-19 06:03:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:23,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 151 [2018-09-19 06:03:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:23,736 INFO L225 Difference]: With dead ends: 1149 [2018-09-19 06:03:23,736 INFO L226 Difference]: Without dead ends: 794 [2018-09-19 06:03:23,739 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:03:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-09-19 06:03:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 783. [2018-09-19 06:03:23,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-09-19 06:03:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1001 transitions. [2018-09-19 06:03:23,774 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1001 transitions. Word has length 151 [2018-09-19 06:03:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:23,775 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 1001 transitions. [2018-09-19 06:03:23,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1001 transitions. [2018-09-19 06:03:23,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-19 06:03:23,780 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:23,780 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,780 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:23,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1455651900, now seen corresponding path program 1 times [2018-09-19 06:03:23,781 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:23,781 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2018-09-19 06:03:23,782 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:23,786 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:23,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:23,869 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:24,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:24,034 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:03:24,076 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:24,294 INFO L232 lantSequenceWeakener]: Weakened 184 states. On average, predicates are now at 73.91% of their original sizes. [2018-09-19 06:03:24,294 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:24,660 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:24,660 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:24,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:24,660 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:24,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:24,661 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:24,661 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:24,662 INFO L87 Difference]: Start difference. First operand 783 states and 1001 transitions. Second operand 10 states. [2018-09-19 06:03:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:28,985 INFO L93 Difference]: Finished difference Result 1723 states and 2332 transitions. [2018-09-19 06:03:28,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:28,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2018-09-19 06:03:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:28,994 INFO L225 Difference]: With dead ends: 1723 [2018-09-19 06:03:28,994 INFO L226 Difference]: Without dead ends: 1090 [2018-09-19 06:03:28,997 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-09-19 06:03:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1081. [2018-09-19 06:03:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-09-19 06:03:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1351 transitions. [2018-09-19 06:03:29,034 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1351 transitions. Word has length 187 [2018-09-19 06:03:29,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:29,035 INFO L480 AbstractCegarLoop]: Abstraction has 1081 states and 1351 transitions. [2018-09-19 06:03:29,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:29,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1351 transitions. [2018-09-19 06:03:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-19 06:03:29,042 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:29,042 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,043 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:29,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1125130115, now seen corresponding path program 1 times [2018-09-19 06:03:29,043 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:29,044 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-09-19 06:03:29,044 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:29,052 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:29,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:29,264 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:29,266 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:03:29,305 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:29,472 INFO L232 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 73.8% of their original sizes. [2018-09-19 06:03:29,472 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:29,982 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:29,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:29,984 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:29,984 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:29,985 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:29,985 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:29,985 INFO L87 Difference]: Start difference. First operand 1081 states and 1351 transitions. Second operand 10 states. [2018-09-19 06:03:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:31,893 INFO L93 Difference]: Finished difference Result 2464 states and 3201 transitions. [2018-09-19 06:03:31,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 06:03:31,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-09-19 06:03:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:31,906 INFO L225 Difference]: With dead ends: 2464 [2018-09-19 06:03:31,906 INFO L226 Difference]: Without dead ends: 1533 [2018-09-19 06:03:31,910 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 212 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-19 06:03:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2018-09-19 06:03:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1521. [2018-09-19 06:03:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2018-09-19 06:03:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 1842 transitions. [2018-09-19 06:03:31,952 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 1842 transitions. Word has length 206 [2018-09-19 06:03:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:31,953 INFO L480 AbstractCegarLoop]: Abstraction has 1521 states and 1842 transitions. [2018-09-19 06:03:31,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 1842 transitions. [2018-09-19 06:03:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-19 06:03:31,957 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:31,958 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:31,958 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1512083002, now seen corresponding path program 1 times [2018-09-19 06:03:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:31,959 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 219 with the following transitions: [2018-09-19 06:03:31,959 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:31,962 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:31,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:31,996 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:32,064 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:32,065 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:03:32,087 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:32,218 INFO L232 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 73.78% of their original sizes. [2018-09-19 06:03:32,219 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:32,324 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:32,324 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:32,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:32,325 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:32,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:32,326 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:32,326 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:32,326 INFO L87 Difference]: Start difference. First operand 1521 states and 1842 transitions. Second operand 10 states. [2018-09-19 06:03:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:35,717 INFO L93 Difference]: Finished difference Result 3061 states and 3845 transitions. [2018-09-19 06:03:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:35,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 218 [2018-09-19 06:03:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:35,739 INFO L225 Difference]: With dead ends: 3061 [2018-09-19 06:03:35,739 INFO L226 Difference]: Without dead ends: 1690 [2018-09-19 06:03:35,744 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 225 GetRequests, 209 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:03:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2018-09-19 06:03:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1672. [2018-09-19 06:03:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-09-19 06:03:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2020 transitions. [2018-09-19 06:03:35,802 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2020 transitions. Word has length 218 [2018-09-19 06:03:35,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:35,803 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2020 transitions. [2018-09-19 06:03:35,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:35,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2020 transitions. [2018-09-19 06:03:35,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-19 06:03:35,808 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:35,809 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:35,809 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:35,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1354830506, now seen corresponding path program 1 times [2018-09-19 06:03:35,809 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:35,810 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 221 with the following transitions: [2018-09-19 06:03:35,810 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:35,812 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:35,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:35,844 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:35,938 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:35,938 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:03:35,978 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:36,118 INFO L232 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 73.77% of their original sizes. [2018-09-19 06:03:36,119 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:36,451 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:36,452 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:36,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:36,452 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:36,452 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:36,453 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:36,453 INFO L87 Difference]: Start difference. First operand 1672 states and 2020 transitions. Second operand 10 states. [2018-09-19 06:03:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:39,162 INFO L93 Difference]: Finished difference Result 3362 states and 4211 transitions. [2018-09-19 06:03:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:39,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 220 [2018-09-19 06:03:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:39,180 INFO L225 Difference]: With dead ends: 3362 [2018-09-19 06:03:39,180 INFO L226 Difference]: Without dead ends: 1840 [2018-09-19 06:03:39,184 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 211 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:03:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2018-09-19 06:03:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1823. [2018-09-19 06:03:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1823 states. [2018-09-19 06:03:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2218 transitions. [2018-09-19 06:03:39,230 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2218 transitions. Word has length 220 [2018-09-19 06:03:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:39,231 INFO L480 AbstractCegarLoop]: Abstraction has 1823 states and 2218 transitions. [2018-09-19 06:03:39,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2218 transitions. [2018-09-19 06:03:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 06:03:39,236 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:39,236 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:39,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash -970007438, now seen corresponding path program 1 times [2018-09-19 06:03:39,237 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:39,237 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 06:03:39,237 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:39,239 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:39,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:39,267 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:39,348 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:39,348 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:03:39,385 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:39,509 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.75% of their original sizes. [2018-09-19 06:03:39,509 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:39,616 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:39,616 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:39,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:39,617 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:39,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:39,617 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:39,618 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:39,618 INFO L87 Difference]: Start difference. First operand 1823 states and 2218 transitions. Second operand 10 states. [2018-09-19 06:03:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:44,822 INFO L93 Difference]: Finished difference Result 3819 states and 4796 transitions. [2018-09-19 06:03:44,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:44,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2018-09-19 06:03:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:44,833 INFO L225 Difference]: With dead ends: 3819 [2018-09-19 06:03:44,833 INFO L226 Difference]: Without dead ends: 2146 [2018-09-19 06:03:44,838 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 215 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:03:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2018-09-19 06:03:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2123. [2018-09-19 06:03:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2018-09-19 06:03:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2596 transitions. [2018-09-19 06:03:44,893 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2596 transitions. Word has length 224 [2018-09-19 06:03:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:44,894 INFO L480 AbstractCegarLoop]: Abstraction has 2123 states and 2596 transitions. [2018-09-19 06:03:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2596 transitions. [2018-09-19 06:03:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-19 06:03:44,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:44,900 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:44,900 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -560153092, now seen corresponding path program 1 times [2018-09-19 06:03:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:44,901 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-09-19 06:03:44,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], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:44,903 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:44,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:44,935 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:44,997 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:44,997 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:03:44,999 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:45,145 INFO L232 lantSequenceWeakener]: Weakened 221 states. On average, predicates are now at 73.75% of their original sizes. [2018-09-19 06:03:45,145 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:45,296 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:45,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:45,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:45,296 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:45,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:45,297 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:45,297 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:45,297 INFO L87 Difference]: Start difference. First operand 2123 states and 2596 transitions. Second operand 10 states. [2018-09-19 06:03:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:48,557 INFO L93 Difference]: Finished difference Result 4418 states and 5553 transitions. [2018-09-19 06:03:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:48,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 224 [2018-09-19 06:03:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:48,579 INFO L225 Difference]: With dead ends: 4418 [2018-09-19 06:03:48,579 INFO L226 Difference]: Without dead ends: 2445 [2018-09-19 06:03:48,585 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 215 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:03:48,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2018-09-19 06:03:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2411. [2018-09-19 06:03:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2018-09-19 06:03:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2974 transitions. [2018-09-19 06:03:48,652 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2974 transitions. Word has length 224 [2018-09-19 06:03:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:48,653 INFO L480 AbstractCegarLoop]: Abstraction has 2411 states and 2974 transitions. [2018-09-19 06:03:48,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2974 transitions. [2018-09-19 06:03:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-19 06:03:48,662 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:48,662 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:48,662 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1443635426, now seen corresponding path program 1 times [2018-09-19 06:03:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:48,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-09-19 06:03:48,663 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:48,665 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:48,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:48,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:51,330 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:51,331 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:03:51,339 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:51,916 INFO L232 lantSequenceWeakener]: Weakened 227 states. On average, predicates are now at 73.72% of their original sizes. [2018-09-19 06:03:51,916 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:52,015 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:52,015 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:52,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:52,015 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:52,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:52,016 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:52,016 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:52,016 INFO L87 Difference]: Start difference. First operand 2411 states and 2974 transitions. Second operand 10 states. [2018-09-19 06:03:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:55,750 INFO L93 Difference]: Finished difference Result 4850 states and 6141 transitions. [2018-09-19 06:03:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:55,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2018-09-19 06:03:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:55,769 INFO L225 Difference]: With dead ends: 4850 [2018-09-19 06:03:55,769 INFO L226 Difference]: Without dead ends: 2589 [2018-09-19 06:03:55,775 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 237 GetRequests, 221 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:03:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2018-09-19 06:03:55,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2566. [2018-09-19 06:03:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2018-09-19 06:03:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3192 transitions. [2018-09-19 06:03:55,840 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3192 transitions. Word has length 230 [2018-09-19 06:03:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:55,841 INFO L480 AbstractCegarLoop]: Abstraction has 2566 states and 3192 transitions. [2018-09-19 06:03:55,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3192 transitions. [2018-09-19 06:03:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-19 06:03:55,848 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:55,849 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:55,849 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash -821493435, now seen corresponding path program 1 times [2018-09-19 06:03:55,850 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:55,850 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2018-09-19 06:03:55,850 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:55,852 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:55,853 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:55,879 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:56,419 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:56,419 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:03:56,455 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:56,726 INFO L232 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 73.69% of their original sizes. [2018-09-19 06:03:56,726 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:56,945 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:56,945 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:56,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:56,946 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:56,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:56,946 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:56,946 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:56,946 INFO L87 Difference]: Start difference. First operand 2566 states and 3192 transitions. Second operand 10 states. [2018-09-19 06:03:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:03:58,876 INFO L93 Difference]: Finished difference Result 5163 states and 6584 transitions. [2018-09-19 06:03:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:03:58,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 239 [2018-09-19 06:03:58,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:03:58,893 INFO L225 Difference]: With dead ends: 5163 [2018-09-19 06:03:58,893 INFO L226 Difference]: Without dead ends: 2747 [2018-09-19 06:03:58,899 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 246 GetRequests, 230 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:03:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-09-19 06:03:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2721. [2018-09-19 06:03:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2721 states. [2018-09-19 06:03:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2721 states to 2721 states and 3412 transitions. [2018-09-19 06:03:58,966 INFO L78 Accepts]: Start accepts. Automaton has 2721 states and 3412 transitions. Word has length 239 [2018-09-19 06:03:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:03:58,967 INFO L480 AbstractCegarLoop]: Abstraction has 2721 states and 3412 transitions. [2018-09-19 06:03:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:03:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2721 states and 3412 transitions. [2018-09-19 06:03:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-19 06:03:58,975 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:03:58,975 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03:58,976 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:03:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1507913679, now seen corresponding path program 1 times [2018-09-19 06:03:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:03:58,976 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2018-09-19 06:03:58,977 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03:58,979 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:03:58,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:03:59,006 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:03:59,150 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:03:59,150 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:03:59,186 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:03:59,369 INFO L232 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 73.66% of their original sizes. [2018-09-19 06:03:59,369 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:03:59,567 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:03:59,568 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:03:59,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:03:59,568 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:03:59,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:03:59,569 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:03:59,569 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:03:59,569 INFO L87 Difference]: Start difference. First operand 2721 states and 3412 transitions. Second operand 10 states. [2018-09-19 06:04:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:01,521 INFO L93 Difference]: Finished difference Result 5472 states and 7022 transitions. [2018-09-19 06:04:01,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:01,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 245 [2018-09-19 06:04:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:01,540 INFO L225 Difference]: With dead ends: 5472 [2018-09-19 06:04:01,540 INFO L226 Difference]: Without dead ends: 2901 [2018-09-19 06:04:01,546 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 252 GetRequests, 236 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:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2018-09-19 06:04:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2876. [2018-09-19 06:04:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-09-19 06:04:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3624 transitions. [2018-09-19 06:04:01,609 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3624 transitions. Word has length 245 [2018-09-19 06:04:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:01,610 INFO L480 AbstractCegarLoop]: Abstraction has 2876 states and 3624 transitions. [2018-09-19 06:04:01,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3624 transitions. [2018-09-19 06:04:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-19 06:04:01,617 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:01,618 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:01,618 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash -684859158, now seen corresponding path program 1 times [2018-09-19 06:04:01,618 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:01,619 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-09-19 06:04:01,619 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:01,621 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:01,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:01,646 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:01,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:01,774 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:01,781 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:01,915 INFO L232 lantSequenceWeakener]: Weakened 249 states. On average, predicates are now at 73.64% of their original sizes. [2018-09-19 06:04:01,915 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:02,012 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:02,012 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:02,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:02,013 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:02,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:02,014 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:02,014 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:02,014 INFO L87 Difference]: Start difference. First operand 2876 states and 3624 transitions. Second operand 10 states. [2018-09-19 06:04:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:03,780 INFO L93 Difference]: Finished difference Result 5959 states and 7691 transitions. [2018-09-19 06:04:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:03,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 252 [2018-09-19 06:04:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:03,793 INFO L225 Difference]: With dead ends: 5959 [2018-09-19 06:04:03,794 INFO L226 Difference]: Without dead ends: 3233 [2018-09-19 06:04:03,800 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 259 GetRequests, 243 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:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3233 states. [2018-09-19 06:04:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3233 to 3184. [2018-09-19 06:04:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3184 states. [2018-09-19 06:04:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 4030 transitions. [2018-09-19 06:04:03,875 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 4030 transitions. Word has length 252 [2018-09-19 06:04:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:03,876 INFO L480 AbstractCegarLoop]: Abstraction has 3184 states and 4030 transitions. [2018-09-19 06:04:03,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 4030 transitions. [2018-09-19 06:04:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-19 06:04:03,884 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:03,884 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:03,884 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:03,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2060148212, now seen corresponding path program 1 times [2018-09-19 06:04:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:03,885 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 261 with the following transitions: [2018-09-19 06:04:03,885 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:03,888 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:03,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:03,944 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:04,085 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:04,086 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:04,121 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:04,242 INFO L232 lantSequenceWeakener]: Weakened 257 states. On average, predicates are now at 73.61% of their original sizes. [2018-09-19 06:04:04,242 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:04,321 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:04,321 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:04,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:04,321 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:04,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:04,322 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:04,322 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:04,323 INFO L87 Difference]: Start difference. First operand 3184 states and 4030 transitions. Second operand 10 states. [2018-09-19 06:04:06,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:06,268 INFO L93 Difference]: Finished difference Result 6547 states and 8487 transitions. [2018-09-19 06:04:06,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:06,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 260 [2018-09-19 06:04:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:06,289 INFO L225 Difference]: With dead ends: 6547 [2018-09-19 06:04:06,292 INFO L226 Difference]: Without dead ends: 3513 [2018-09-19 06:04:06,303 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 267 GetRequests, 251 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:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2018-09-19 06:04:06,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3486. [2018-09-19 06:04:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2018-09-19 06:04:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4452 transitions. [2018-09-19 06:04:06,392 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4452 transitions. Word has length 260 [2018-09-19 06:04:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:06,392 INFO L480 AbstractCegarLoop]: Abstraction has 3486 states and 4452 transitions. [2018-09-19 06:04:06,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4452 transitions. [2018-09-19 06:04:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-19 06:04:06,402 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:06,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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 06:04:06,402 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:06,403 INFO L82 PathProgramCache]: Analyzing trace with hash -896901566, now seen corresponding path program 1 times [2018-09-19 06:04:06,403 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:06,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2018-09-19 06:04:06,403 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:06,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:06,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:06,434 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:06,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:06,728 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:06,729 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:06,859 INFO L232 lantSequenceWeakener]: Weakened 261 states. On average, predicates are now at 73.59% of their original sizes. [2018-09-19 06:04:06,860 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:06,967 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:06,968 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:06,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:06,968 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:06,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:06,969 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:06,969 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:06,969 INFO L87 Difference]: Start difference. First operand 3486 states and 4452 transitions. Second operand 10 states. [2018-09-19 06:04:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:08,590 INFO L93 Difference]: Finished difference Result 7025 states and 9137 transitions. [2018-09-19 06:04:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:08,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 264 [2018-09-19 06:04:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:08,611 INFO L225 Difference]: With dead ends: 7025 [2018-09-19 06:04:08,611 INFO L226 Difference]: Without dead ends: 3689 [2018-09-19 06:04:08,623 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 271 GetRequests, 255 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:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2018-09-19 06:04:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3649. [2018-09-19 06:04:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3649 states. [2018-09-19 06:04:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 4696 transitions. [2018-09-19 06:04:08,694 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 4696 transitions. Word has length 264 [2018-09-19 06:04:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:08,695 INFO L480 AbstractCegarLoop]: Abstraction has 3649 states and 4696 transitions. [2018-09-19 06:04:08,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 4696 transitions. [2018-09-19 06:04:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-19 06:04:08,704 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:08,704 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08,705 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1092007403, now seen corresponding path program 1 times [2018-09-19 06:04:08,705 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:08,705 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 280 with the following transitions: [2018-09-19 06:04:08,706 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:08,708 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:08,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:08,734 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:08,930 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:08,930 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:08,934 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:09,089 INFO L232 lantSequenceWeakener]: Weakened 276 states. On average, predicates are now at 73.55% of their original sizes. [2018-09-19 06:04:09,089 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:09,172 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:09,172 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:09,172 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:09,172 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:09,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:09,173 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:09,173 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:09,173 INFO L87 Difference]: Start difference. First operand 3649 states and 4696 transitions. Second operand 10 states. [2018-09-19 06:04:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:11,606 INFO L93 Difference]: Finished difference Result 7322 states and 9594 transitions. [2018-09-19 06:04:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:11,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 279 [2018-09-19 06:04:11,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:11,618 INFO L225 Difference]: With dead ends: 7322 [2018-09-19 06:04:11,618 INFO L226 Difference]: Without dead ends: 3823 [2018-09-19 06:04:11,626 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 286 GetRequests, 270 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:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2018-09-19 06:04:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3806. [2018-09-19 06:04:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3806 states. [2018-09-19 06:04:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3806 states to 3806 states and 4906 transitions. [2018-09-19 06:04:11,694 INFO L78 Accepts]: Start accepts. Automaton has 3806 states and 4906 transitions. Word has length 279 [2018-09-19 06:04:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 3806 states and 4906 transitions. [2018-09-19 06:04:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 3806 states and 4906 transitions. [2018-09-19 06:04:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-09-19 06:04:11,704 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:11,704 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:11,704 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1498720035, now seen corresponding path program 1 times [2018-09-19 06:04:11,705 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:11,705 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2018-09-19 06:04:11,705 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:11,709 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:11,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:11,737 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:11,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:11,918 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:11,923 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:12,072 INFO L232 lantSequenceWeakener]: Weakened 290 states. On average, predicates are now at 73.51% of their original sizes. [2018-09-19 06:04:12,072 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:12,182 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:12,182 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:12,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:12,182 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:12,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:12,183 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:12,183 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:12,183 INFO L87 Difference]: Start difference. First operand 3806 states and 4906 transitions. Second operand 10 states. [2018-09-19 06:04:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:14,900 INFO L93 Difference]: Finished difference Result 8367 states and 11098 transitions. [2018-09-19 06:04:14,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:14,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 293 [2018-09-19 06:04:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:14,920 INFO L225 Difference]: With dead ends: 8367 [2018-09-19 06:04:14,920 INFO L226 Difference]: Without dead ends: 4711 [2018-09-19 06:04:14,928 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 300 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-09-19 06:04:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4711 states. [2018-09-19 06:04:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4711 to 4649. [2018-09-19 06:04:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4649 states. [2018-09-19 06:04:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 6018 transitions. [2018-09-19 06:04:15,026 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 6018 transitions. Word has length 293 [2018-09-19 06:04:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:15,027 INFO L480 AbstractCegarLoop]: Abstraction has 4649 states and 6018 transitions. [2018-09-19 06:04:15,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 6018 transitions. [2018-09-19 06:04:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-19 06:04:15,038 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:15,038 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:04:15,038 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2119870302, now seen corresponding path program 1 times [2018-09-19 06:04:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:15,039 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 302 with the following transitions: [2018-09-19 06:04:15,039 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:04:15,041 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:15,041 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:15,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:15,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:15,192 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:04:15,233 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:15,422 INFO L232 lantSequenceWeakener]: Weakened 298 states. On average, predicates are now at 73.52% of their original sizes. [2018-09-19 06:04:15,422 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:16,173 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:16,173 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:16,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:16,173 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:16,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:16,174 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:16,174 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:16,174 INFO L87 Difference]: Start difference. First operand 4649 states and 6018 transitions. Second operand 10 states. [2018-09-19 06:04:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:18,805 INFO L93 Difference]: Finished difference Result 9531 states and 12530 transitions. [2018-09-19 06:04:18,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-19 06:04:18,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 301 [2018-09-19 06:04:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:18,827 INFO L225 Difference]: With dead ends: 9531 [2018-09-19 06:04:18,827 INFO L226 Difference]: Without dead ends: 5032 [2018-09-19 06:04:18,836 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 308 GetRequests, 292 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:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5032 states. [2018-09-19 06:04:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5032 to 4977. [2018-09-19 06:04:18,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4977 states. [2018-09-19 06:04:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6473 transitions. [2018-09-19 06:04:18,926 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6473 transitions. Word has length 301 [2018-09-19 06:04:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:18,926 INFO L480 AbstractCegarLoop]: Abstraction has 4977 states and 6473 transitions. [2018-09-19 06:04:18,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6473 transitions. [2018-09-19 06:04:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-09-19 06:04:18,939 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:18,939 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:04:18,940 INFO L423 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:18,940 INFO L82 PathProgramCache]: Analyzing trace with hash 643299478, now seen corresponding path program 1 times [2018-09-19 06:04:18,940 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:18,940 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 318 with the following transitions: [2018-09-19 06:04:18,940 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:04:18,942 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:18,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:18,969 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:23,685 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-09-19 06:04:23,685 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:04:23,705 INFO L399 sIntCurrentIteration]: Generating AbsInt predicates [2018-09-19 06:04:25,073 INFO L232 lantSequenceWeakener]: Weakened 314 states. On average, predicates are now at 73.48% of their original sizes. [2018-09-19 06:04:25,073 INFO L412 sIntCurrentIteration]: Unifying AI predicates [2018-09-19 06:04:25,149 INFO L423 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-09-19 06:04:25,150 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 06:04:25,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-19 06:04:25,150 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-19 06:04:25,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-19 06:04:25,150 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-19 06:04:25,150 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-19 06:04:25,151 INFO L87 Difference]: Start difference. First operand 4977 states and 6473 transitions. Second operand 10 states. [2018-09-19 06:04:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 06:04:27,284 INFO L93 Difference]: Finished difference Result 10225 states and 13506 transitions. [2018-09-19 06:04:27,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 06:04:27,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 317 [2018-09-19 06:04:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 06:04:27,307 INFO L225 Difference]: With dead ends: 10225 [2018-09-19 06:04:27,307 INFO L226 Difference]: Without dead ends: 5398 [2018-09-19 06:04:27,317 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 324 GetRequests, 308 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:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5398 states. [2018-09-19 06:04:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5398 to 5325. [2018-09-19 06:04:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5325 states. [2018-09-19 06:04:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 6951 transitions. [2018-09-19 06:04:27,411 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 6951 transitions. Word has length 317 [2018-09-19 06:04:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 06:04:27,412 INFO L480 AbstractCegarLoop]: Abstraction has 5325 states and 6951 transitions. [2018-09-19 06:04:27,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-19 06:04:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 6951 transitions. [2018-09-19 06:04:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-19 06:04:27,515 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 06:04:27,515 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:04:27,516 INFO L423 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 06:04:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1265840158, now seen corresponding path program 1 times [2018-09-19 06:04:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy ToothlessTaipanRefinementStrategy [2018-09-19 06:04:27,517 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 320 with the following transitions: [2018-09-19 06:04:27,517 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [469], [471], [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:04:27,519 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2018-09-19 06:04:27,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=1) [2018-09-19 06:04:27,542 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-09-19 06:04:27,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-09-19 06:04:27,698 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:04:27,704 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-19 06:04:27,746 WARN L209 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-09-19 06:04:27,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 06:04:27 BoogieIcfgContainer [2018-09-19 06:04:27,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 06:04:27,747 INFO L168 Benchmark]: Toolchain (without parser) took 80981.47 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 3.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 185.9 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,749 INFO L168 Benchmark]: CDTParser took 0.21 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:04:27,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.90 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,751 INFO L168 Benchmark]: Boogie Preprocessor took 266.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,752 INFO L168 Benchmark]: RCFGBuilder took 3478.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,752 INFO L168 Benchmark]: TraceAbstraction took 76374.14 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. [2018-09-19 06:04:27,757 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.21 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 710.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 144.90 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 266.00 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 774.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -868.4 MB). Peak memory consumption was 29.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3478.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 106.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76374.14 ms. Allocated memory was 2.3 GB in the beginning and 3.6 GB in the end (delta: 1.3 GB). Free memory was 2.1 GB in the beginning and 3.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 118.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 196]: 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 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 TRUE (((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7)) [L196] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. UNKNOWN Result, 76.2s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 53.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3592 SDtfs, 11928 SDslu, 5242 SDs, 0 SdLazy, 30640 SolverSat, 3288 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 44.0s Time, PredicateUnifierStatistics: 38 DeclaredPredicates, 4445 GetRequests, 4156 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 5.5s 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, 11.8s AbstIntTime, 20 AbstIntIterations, 19 AbstIntStrong, 0.9970007699253474 AbsIntWeakeningRatio, 0.1092007434944238 AbsIntAvgWeakeningVarsNumRemoved, 19.332016728624534 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s 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_label25_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-19_06-04-27-779.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem10_label25_true-unreach-call.c_svcomp-Reach-64bit-ToothlessTaipan_INT-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-19_06-04-27-779.csv Received shutdown request...